/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 16:27:00,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 16:27:00,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 16:27:00,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 16:27:00,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 16:27:00,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 16:27:00,585 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 16:27:00,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 16:27:00,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 16:27:00,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 16:27:00,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 16:27:00,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 16:27:00,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 16:27:00,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 16:27:00,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 16:27:00,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 16:27:00,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 16:27:00,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 16:27:00,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 16:27:00,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 16:27:00,604 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 16:27:00,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 16:27:00,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 16:27:00,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 16:27:00,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 16:27:00,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 16:27:00,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 16:27:00,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 16:27:00,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 16:27:00,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 16:27:00,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 16:27:00,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 16:27:00,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 16:27:00,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 16:27:00,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 16:27:00,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 16:27:00,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 16:27:00,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 16:27:00,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 16:27:00,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 16:27:00,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 16:27:00,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 16:27:00,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 16:27:00,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 16:27:00,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 16:27:00,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 16:27:00,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 16:27:00,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 16:27:00,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 16:27:00,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 16:27:00,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 16:27:00,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 16:27:00,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 16:27:00,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 16:27:00,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:27:00,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 16:27:00,628 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 16:27:00,628 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 16:27:00,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 16:27:00,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 16:27:00,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 16:27:00,799 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 16:27:00,800 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 16:27:00,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound5.c [2022-04-15 16:27:00,837 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36c1d0e8/c7dad3214120418aa85217e77cc42d58/FLAG91a3d399d [2022-04-15 16:27:01,180 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 16:27:01,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound5.c [2022-04-15 16:27:01,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36c1d0e8/c7dad3214120418aa85217e77cc42d58/FLAG91a3d399d [2022-04-15 16:27:01,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36c1d0e8/c7dad3214120418aa85217e77cc42d58 [2022-04-15 16:27:01,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 16:27:01,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 16:27:01,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 16:27:01,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 16:27:01,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 16:27:01,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4221e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01, skipping insertion in model container [2022-04-15 16:27:01,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 16:27:01,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 16:27:01,764 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/prodbin-ll_valuebound5.c[537,550] [2022-04-15 16:27:01,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:27:01,784 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 16:27:01,793 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/prodbin-ll_valuebound5.c[537,550] [2022-04-15 16:27:01,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 16:27:01,806 INFO L208 MainTranslator]: Completed translation [2022-04-15 16:27:01,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01 WrapperNode [2022-04-15 16:27:01,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 16:27:01,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 16:27:01,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 16:27:01,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 16:27:01,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 16:27:01,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 16:27:01,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 16:27:01,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 16:27:01,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (1/1) ... [2022-04-15 16:27:01,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 16:27:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:01,842 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 16:27:01,847 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 16:27:01,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 16:27:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 16:27:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 16:27:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 16:27:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 16:27:01,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 16:27:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 16:27:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 16:27:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 16:27:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 16:27:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 16:27:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 16:27:01,909 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 16:27:01,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 16:27:02,028 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 16:27:02,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 16:27:02,033 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 16:27:02,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:27:02 BoogieIcfgContainer [2022-04-15 16:27:02,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 16:27:02,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 16:27:02,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 16:27:02,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 16:27:02,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 04:27:01" (1/3) ... [2022-04-15 16:27:02,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4231c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:27:02, skipping insertion in model container [2022-04-15 16:27:02,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 04:27:01" (2/3) ... [2022-04-15 16:27:02,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4231c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 04:27:02, skipping insertion in model container [2022-04-15 16:27:02,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 04:27:02" (3/3) ... [2022-04-15 16:27:02,039 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound5.c [2022-04-15 16:27:02,042 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 16:27:02,042 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 16:27:02,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 16:27:02,072 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 16:27:02,072 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 16:27:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 16:27:02,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:02,090 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:27:02,090 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-15 16:27:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401192794] [2022-04-15 16:27:02,108 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 2 times [2022-04-15 16:27:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:02,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795803430] [2022-04-15 16:27:02,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 16:27:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 16:27:02,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 16:27:02,248 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-15 16:27:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 16:27:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 16:27:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 16:27:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 16:27:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 16:27:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-15 16:27:02,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 16:27:02,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 16:27:02,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 16:27:02,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-15 16:27:02,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-15 16:27:02,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 16:27:02,299 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-15 16:27:02,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,301 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 16:27:02,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-15 16:27:02,301 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {35#true} is VALID [2022-04-15 16:27:02,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,302 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,302 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 16:27:02,303 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-15 16:27:02,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 16:27:02,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 16:27:02,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 16:27:02,304 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-15 16:27:02,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-15 16:27:02,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-15 16:27:02,304 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-15 16:27:02,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 16:27:02,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 16:27:02,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 16:27:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:27:02,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:27:02,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795803430] [2022-04-15 16:27:02,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795803430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:02,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:02,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:27:02,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:27:02,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401192794] [2022-04-15 16:27:02,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401192794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:02,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:02,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 16:27:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815713724] [2022-04-15 16:27:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:27:02,315 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 16:27:02,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:27:02,319 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:27:02,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:02,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 16:27:02,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:02,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 16:27:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 16:27:02,374 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:27:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:02,497 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-15 16:27:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 16:27:02,498 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 16:27:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:27:02,499 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:27:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-15 16:27:02,508 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:27:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-15 16:27:02,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-15 16:27:02,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:02,610 INFO L225 Difference]: With dead ends: 57 [2022-04-15 16:27:02,610 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 16:27:02,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 16:27:02,619 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:27:02,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:27:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 16:27:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 16:27:02,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:27:02,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 16:27:02,648 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 16:27:02,649 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 16:27:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:02,652 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 16:27:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 16:27:02,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:02,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:02,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-15 16:27:02,655 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-15 16:27:02,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:02,659 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 16:27:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 16:27:02,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:02,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:02,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:27:02,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:27:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 16:27:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 16:27:02,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-15 16:27:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:27:02,664 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 16:27:02,665 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 16:27:02,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 16:27:02,699 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 16:27:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 16:27:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 16:27:02,700 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:02,700 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:27:02,701 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 16:27:02,701 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-15 16:27:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:02,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1873489566] [2022-04-15 16:27:02,703 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 2 times [2022-04-15 16:27:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:02,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467400566] [2022-04-15 16:27:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:02,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:27:02,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140574483] [2022-04-15 16:27:02,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:27:02,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:02,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:02,750 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 16:27:02,751 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 16:27:02,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 16:27:02,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:27:02,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 16:27:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:02,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:27:02,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {277#true} is VALID [2022-04-15 16:27:02,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#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(13, 2);call #Ultimate.allocInit(12, 3); {277#true} is VALID [2022-04-15 16:27:02,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-15 16:27:02,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#true} {277#true} #71#return; {277#true} is VALID [2022-04-15 16:27:02,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#true} call #t~ret6 := main(); {277#true} is VALID [2022-04-15 16:27:02,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {277#true} is VALID [2022-04-15 16:27:02,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {277#true} is VALID [2022-04-15 16:27:02,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-15 16:27:02,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-15 16:27:02,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#true} {277#true} #61#return; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {277#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {277#true} is VALID [2022-04-15 16:27:02,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-15 16:27:02,932 INFO L290 TraceCheckUtils]: 15: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {277#true} {277#true} #63#return; {277#true} is VALID [2022-04-15 16:27:02,932 INFO L272 TraceCheckUtils]: 17: Hoare triple {277#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {277#true} is VALID [2022-04-15 16:27:02,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-15 16:27:02,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-15 16:27:02,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-15 16:27:02,933 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {277#true} {277#true} #65#return; {277#true} is VALID [2022-04-15 16:27:02,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {277#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:02,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:02,935 INFO L272 TraceCheckUtils]: 24: Hoare triple {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {355#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:02,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:02,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {278#false} is VALID [2022-04-15 16:27:02,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-04-15 16:27:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:27:02,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 16:27:02,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:27:02,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467400566] [2022-04-15 16:27:02,936 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:27:02,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140574483] [2022-04-15 16:27:02,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140574483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:02,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:27:02,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:27:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1873489566] [2022-04-15 16:27:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1873489566] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:02,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:02,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 16:27:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608105892] [2022-04-15 16:27:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:27:02,938 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 16:27:02,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:27:02,938 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:27:02,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:02,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 16:27:02,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:02,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 16:27:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 16:27:02,954 INFO L87 Difference]: Start difference. First operand 27 states and 31 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:27:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,064 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 16:27:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 16:27:03,064 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-15 16:27:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:27:03,064 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:27:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 16:27:03,065 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:27:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-15 16:27:03,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-15 16:27:03,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:03,097 INFO L225 Difference]: With dead ends: 39 [2022-04-15 16:27:03,097 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 16:27:03,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 16:27:03,098 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:27:03,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:27:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 16:27:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-15 16:27:03,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:27:03,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,107 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,107 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,109 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 16:27:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 16:27:03,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:03,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:03,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-15 16:27:03,110 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-15 16:27:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,111 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 16:27:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 16:27:03,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:03,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:03,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:27:03,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:27:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 16:27:03,113 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-15 16:27:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:27:03,114 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 16:27:03,114 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 16:27:03,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 16:27:03,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 16:27:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 16:27:03,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:03,145 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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 16:27:03,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 16:27:03,361 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 16:27:03,361 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-15 16:27:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:03,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309674757] [2022-04-15 16:27:03,362 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 2 times [2022-04-15 16:27:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:03,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545681999] [2022-04-15 16:27:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:03,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:27:03,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257953861] [2022-04-15 16:27:03,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:27:03,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:03,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:03,377 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 16:27:03,378 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 16:27:03,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:27:03,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:27:03,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 16:27:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:03,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:27:03,508 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-15 16:27:03,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#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(13, 2);call #Ultimate.allocInit(12, 3); {585#true} is VALID [2022-04-15 16:27:03,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #71#return; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret6 := main(); {585#true} is VALID [2022-04-15 16:27:03,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {585#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {585#true} is VALID [2022-04-15 16:27:03,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-15 16:27:03,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-15 16:27:03,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {585#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {585#true} is VALID [2022-04-15 16:27:03,510 INFO L272 TraceCheckUtils]: 12: Hoare triple {585#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {585#true} is VALID [2022-04-15 16:27:03,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-15 16:27:03,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-15 16:27:03,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 16:27:03,510 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {585#true} {585#true} #63#return; {585#true} is VALID [2022-04-15 16:27:03,510 INFO L272 TraceCheckUtils]: 17: Hoare triple {585#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {585#true} is VALID [2022-04-15 16:27:03,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {585#true} ~cond := #in~cond; {644#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:27:03,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {644#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {648#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:27:03,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {648#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {648#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:27:03,512 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {648#(not (= |assume_abort_if_not_#in~cond| 0))} {585#true} #65#return; {655#(<= 1 main_~b~0)} is VALID [2022-04-15 16:27:03,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {655#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {659#(<= 1 main_~y~0)} is VALID [2022-04-15 16:27:03,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {659#(<= 1 main_~y~0)} assume !false; {659#(<= 1 main_~y~0)} is VALID [2022-04-15 16:27:03,512 INFO L272 TraceCheckUtils]: 24: Hoare triple {659#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {585#true} is VALID [2022-04-15 16:27:03,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-15 16:27:03,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-15 16:27:03,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-15 16:27:03,513 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {585#true} {659#(<= 1 main_~y~0)} #67#return; {659#(<= 1 main_~y~0)} is VALID [2022-04-15 16:27:03,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {659#(<= 1 main_~y~0)} assume !(0 != ~y~0); {586#false} is VALID [2022-04-15 16:27:03,514 INFO L272 TraceCheckUtils]: 30: Hoare triple {586#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {586#false} is VALID [2022-04-15 16:27:03,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-15 16:27:03,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-15 16:27:03,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-15 16:27:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:27:03,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 16:27:03,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:27:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545681999] [2022-04-15 16:27:03,515 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:27:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257953861] [2022-04-15 16:27:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257953861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:03,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:03,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 16:27:03,515 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:27:03,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309674757] [2022-04-15 16:27:03,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309674757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:03,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:03,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 16:27:03,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985342563] [2022-04-15 16:27:03,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:27:03,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 16:27:03,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:27:03,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:03,535 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 16:27:03,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 16:27:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:03,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 16:27:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 16:27:03,536 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,682 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 16:27:03,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 16:27:03,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 16:27:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:27:03,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 16:27:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 16:27:03,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 16:27:03,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:03,724 INFO L225 Difference]: With dead ends: 43 [2022-04-15 16:27:03,724 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 16:27:03,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 16:27:03,734 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 16:27:03,734 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 16:27:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 16:27:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-15 16:27:03,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:27:03,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,748 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,748 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,749 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 16:27:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 16:27:03,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:03,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:03,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-15 16:27:03,750 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-15 16:27:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:03,751 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-15 16:27:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-15 16:27:03,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:03,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:03,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:27:03,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:27:03,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 16:27:03,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 16:27:03,753 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-15 16:27:03,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:27:03,753 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 16:27:03,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:03,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 16:27:03,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 16:27:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 16:27:03,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:03,792 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-15 16:27:03,811 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 16:27:04,008 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 16:27:04,009 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:04,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-15 16:27:04,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:04,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [97606670] [2022-04-15 16:27:04,010 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 2 times [2022-04-15 16:27:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:04,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986115254] [2022-04-15 16:27:04,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:04,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:27:04,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149590719] [2022-04-15 16:27:04,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:27:04,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:04,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:04,038 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 16:27:04,038 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 16:27:04,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:27:04,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:27:04,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 16:27:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:04,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:27:05,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-15 16:27:05,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#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(13, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-15 16:27:05,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:05,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-15 16:27:05,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-15 16:27:05,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {922#true} is VALID [2022-04-15 16:27:05,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:05,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {922#true} is VALID [2022-04-15 16:27:05,085 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:05,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:05,086 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-15 16:27:05,086 INFO L272 TraceCheckUtils]: 17: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:05,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:05,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:05,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:05,086 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-15 16:27:05,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:05,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:05,087 INFO L272 TraceCheckUtils]: 24: Hoare triple {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:05,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:05,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:05,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:05,088 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {922#true} {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:05,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {993#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1015#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:05,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {1015#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1019#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 16:27:05,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {1019#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1023#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:27:05,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {1023#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1023#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:27:05,436 INFO L272 TraceCheckUtils]: 33: Hoare triple {1023#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:05,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:05,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {1034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-15 16:27:05,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-15 16:27:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:27:05,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:27:26,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-15 16:27:26,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {1034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-15 16:27:26,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:26,101 INFO L272 TraceCheckUtils]: 33: Hoare triple {1050#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:26,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {1050#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1050#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:27:26,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {1057#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1050#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:27:26,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1057#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:27:26,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:27:26,110 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {922#true} {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #67#return; {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:27:26,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:26,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:26,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:26,111 INFO L272 TraceCheckUtils]: 24: Hoare triple {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:26,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:27:28,112 WARN L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1061#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is UNKNOWN [2022-04-15 16:27:28,113 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-15 16:27:28,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:28,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:28,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:28,113 INFO L272 TraceCheckUtils]: 17: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:28,113 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-15 16:27:28,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:28,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {922#true} is VALID [2022-04-15 16:27:28,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {922#true} is VALID [2022-04-15 16:27:28,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-15 16:27:28,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-15 16:27:28,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-15 16:27:28,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#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(13, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-15 16:27:28,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-15 16:27:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:27:28,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:27:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986115254] [2022-04-15 16:27:28,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:27:28,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149590719] [2022-04-15 16:27:28,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149590719] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 16:27:28,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 16:27:28,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2022-04-15 16:27:28,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:27:28,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [97606670] [2022-04-15 16:27:28,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [97606670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:27:28,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:27:28,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 16:27:28,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456417413] [2022-04-15 16:27:28,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:27:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:27:28,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:27:28,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:28,318 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 16:27:28,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 16:27:28,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:28,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 16:27:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-15 16:27:28,319 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:29,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:29,499 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-15 16:27:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 16:27:29,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:27:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:27:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 16:27:29,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 16:27:29,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 16:27:29,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:29,539 INFO L225 Difference]: With dead ends: 47 [2022-04-15 16:27:29,539 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 16:27:29,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 16:27:29,540 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 16:27:29,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 100 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 16:27:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 16:27:29,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-15 16:27:29,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:27:29,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:29,565 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:29,566 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:29,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:29,569 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 16:27:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 16:27:29,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:29,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:29,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-15 16:27:29,570 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 45 states. [2022-04-15 16:27:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:27:29,573 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 16:27:29,573 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 16:27:29,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:27:29,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:27:29,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:27:29,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:27:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 16:27:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-04-15 16:27:29,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 37 [2022-04-15 16:27:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:27:29,578 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-04-15 16:27:29,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:27:29,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 49 transitions. [2022-04-15 16:27:29,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:27:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-04-15 16:27:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 16:27:29,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:27:29,632 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-15 16:27:29,650 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 16:27:29,843 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 16:27:29,843 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:27:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:27:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-15 16:27:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:27:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220554879] [2022-04-15 16:27:29,844 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:27:29,844 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 2 times [2022-04-15 16:27:29,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:27:29,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041213636] [2022-04-15 16:27:29,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:27:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:27:29,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:27:29,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [845477149] [2022-04-15 16:27:29,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:27:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:27:29,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:27:29,859 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 16:27:29,863 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 16:27:29,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:27:29,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:27:29,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 16:27:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:27:29,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:27:31,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#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(13, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #71#return; {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret6 := main(); {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {1428#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2022-04-15 16:27:31,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {1428#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L272 TraceCheckUtils]: 12: Hoare triple {1428#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1428#true} {1428#true} #63#return; {1428#true} is VALID [2022-04-15 16:27:31,083 INFO L272 TraceCheckUtils]: 17: Hoare triple {1428#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:27:31,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {1428#true} ~cond := #in~cond; {1487#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:27:31,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {1487#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1491#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:27:31,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1491#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:27:31,089 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1491#(not (= |assume_abort_if_not_#in~cond| 0))} {1428#true} #65#return; {1498#(<= 1 main_~b~0)} is VALID [2022-04-15 16:27:31,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {1498#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:31,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:31,090 INFO L272 TraceCheckUtils]: 24: Hoare triple {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:27:31,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#true} ~cond := #in~cond; {1512#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:31,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {1512#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:31,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:27:31,091 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:31,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:31,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {1502#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1529#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:27:31,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {1529#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1533#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:27:31,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {1533#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1533#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:27:31,095 INFO L272 TraceCheckUtils]: 33: Hoare triple {1533#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:27:31,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:27:31,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1429#false} is VALID [2022-04-15 16:27:31,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2022-04-15 16:27:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:27:31,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:28:08,332 INFO L290 TraceCheckUtils]: 36: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2022-04-15 16:28:08,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {1544#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1429#false} is VALID [2022-04-15 16:28:08,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1544#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:08,333 INFO L272 TraceCheckUtils]: 33: Hoare triple {1560#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1540#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:08,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {1560#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1560#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:28:08,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {1567#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1560#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:28:08,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1567#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:28:08,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1571#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:28:08,341 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} {1578#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #67#return; {1571#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:28:08,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:08,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {1588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1516#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:08,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#true} ~cond := #in~cond; {1588#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:28:08,342 INFO L272 TraceCheckUtils]: 24: Hoare triple {1578#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:28:08,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {1578#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1578#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:28:08,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {1598#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1578#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:28:08,344 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1491#(not (= |assume_abort_if_not_#in~cond| 0))} {1428#true} #65#return; {1598#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 16:28:08,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {1491#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1491#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:28:08,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {1611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1491#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:28:08,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1428#true} ~cond := #in~cond; {1611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:28:08,345 INFO L272 TraceCheckUtils]: 17: Hoare triple {1428#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1428#true} {1428#true} #63#return; {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L272 TraceCheckUtils]: 12: Hoare triple {1428#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {1428#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1428#true} is VALID [2022-04-15 16:28:08,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} assume !(0 == ~cond); {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} ~cond := #in~cond; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {1428#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret6 := main(); {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #71#return; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#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(13, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2022-04-15 16:28:08,346 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 16:28:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:28:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041213636] [2022-04-15 16:28:08,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:28:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845477149] [2022-04-15 16:28:08,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845477149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:28:08,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:28:08,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-15 16:28:08,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:28:08,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220554879] [2022-04-15 16:28:08,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220554879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:28:08,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:28:08,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 16:28:08,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688699648] [2022-04-15 16:28:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:28:08,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:28:08,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:28:08,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:28:08,371 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 16:28:08,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 16:28:08,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:08,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 16:28:08,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-15 16:28:08,371 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:28:08,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:08,912 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-15 16:28:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 16:28:08,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-15 16:28:08,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:28:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:28:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-15 16:28:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:28:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-15 16:28:08,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-15 16:28:08,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:08,960 INFO L225 Difference]: With dead ends: 61 [2022-04-15 16:28:08,960 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 16:28:08,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-15 16:28:08,961 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 16:28:08,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 131 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 16:28:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 16:28:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-04-15 16:28:08,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:28:08,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:08,989 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:08,989 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:08,992 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 16:28:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 16:28:08,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:08,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:08,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 16:28:08,995 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-15 16:28:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:08,998 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-04-15 16:28:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-04-15 16:28:08,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:08,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:08,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:28:08,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:28:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-15 16:28:09,001 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 37 [2022-04-15 16:28:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:28:09,001 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-15 16:28:09,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 10 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 16:28:09,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-15 16:28:09,066 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 16:28:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-15 16:28:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 16:28:09,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:28:09,067 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:28:09,085 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 16:28:09,267 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 16:28:09,267 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:28:09,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:28:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-15 16:28:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272651559] [2022-04-15 16:28:09,268 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:28:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 2 times [2022-04-15 16:28:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:28:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260395108] [2022-04-15 16:28:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:28:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:28:09,278 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:28:09,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124604201] [2022-04-15 16:28:09,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:28:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:28:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:28:09,279 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 16:28:09,280 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 16:28:09,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:28:09,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:28:09,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 16:28:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:28:09,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:28:17,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2008#true} call ULTIMATE.init(); {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2008#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(13, 2);call #Ultimate.allocInit(12, 3); {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#true} {2008#true} #71#return; {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#true} call #t~ret6 := main(); {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {2008#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:17,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2008#true} {2008#true} #61#return; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {2008#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L272 TraceCheckUtils]: 12: Hoare triple {2008#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2008#true} {2008#true} #63#return; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L272 TraceCheckUtils]: 17: Hoare triple {2008#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:17,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2008#true} {2008#true} #65#return; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#true} assume !false; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2008#true} {2008#true} #67#return; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#true} assume !!(0 != ~y~0); {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 30: Hoare triple {2008#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {2008#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2008#true} is VALID [2022-04-15 16:28:17,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {2008#true} assume !false; {2008#true} is VALID [2022-04-15 16:28:17,487 INFO L272 TraceCheckUtils]: 33: Hoare triple {2008#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:17,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {2008#true} ~cond := #in~cond; {2115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:17,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {2115#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:17,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:19,490 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} {2008#true} #67#return; {2126#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-15 16:28:19,490 INFO L290 TraceCheckUtils]: 38: Hoare triple {2126#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {2130#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:28:19,491 INFO L272 TraceCheckUtils]: 39: Hoare triple {2130#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:19,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2138#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:19,491 INFO L290 TraceCheckUtils]: 41: Hoare triple {2138#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2009#false} is VALID [2022-04-15 16:28:19,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {2009#false} assume !false; {2009#false} is VALID [2022-04-15 16:28:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:28:19,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:28:32,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {2009#false} assume !false; {2009#false} is VALID [2022-04-15 16:28:32,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {2138#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2009#false} is VALID [2022-04-15 16:28:32,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2138#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:32,583 INFO L272 TraceCheckUtils]: 39: Hoare triple {2130#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2134#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:32,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {2157#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {2130#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:28:32,584 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} {2008#true} #67#return; {2157#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:28:32,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:32,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {2170#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2119#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {2008#true} ~cond := #in~cond; {2170#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:28:32,585 INFO L272 TraceCheckUtils]: 33: Hoare triple {2008#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 32: Hoare triple {2008#true} assume !false; {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 31: Hoare triple {2008#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 30: Hoare triple {2008#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 29: Hoare triple {2008#true} assume !!(0 != ~y~0); {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2008#true} {2008#true} #67#return; {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:32,585 INFO L272 TraceCheckUtils]: 24: Hoare triple {2008#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {2008#true} assume !false; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {2008#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2008#true} {2008#true} #65#return; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L272 TraceCheckUtils]: 17: Hoare triple {2008#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2008#true} {2008#true} #63#return; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L272 TraceCheckUtils]: 12: Hoare triple {2008#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {2008#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2008#true} is VALID [2022-04-15 16:28:32,586 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2008#true} {2008#true} #61#return; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {2008#true} assume !(0 == ~cond); {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {2008#true} ~cond := #in~cond; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {2008#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {2008#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {2008#true} call #t~ret6 := main(); {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2008#true} {2008#true} #71#return; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {2008#true} assume true; {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {2008#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(13, 2);call #Ultimate.allocInit(12, 3); {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {2008#true} call ULTIMATE.init(); {2008#true} is VALID [2022-04-15 16:28:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:28:32,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:28:32,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260395108] [2022-04-15 16:28:32,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:28:32,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124604201] [2022-04-15 16:28:32,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124604201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:28:32,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:28:32,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 16:28:32,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:28:32,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272651559] [2022-04-15 16:28:32,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272651559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:28:32,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:28:32,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 16:28:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201399079] [2022-04-15 16:28:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:28:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-15 16:28:32,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:28:32,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:28:34,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:34,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 16:28:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 16:28:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 16:28:34,630 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:28:36,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:28:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:37,079 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-04-15 16:28:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 16:28:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-15 16:28:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:28:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:28:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-15 16:28:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:28:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-15 16:28:37,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-15 16:28:39,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:39,106 INFO L225 Difference]: With dead ends: 59 [2022-04-15 16:28:39,106 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 16:28:39,106 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 16:28:39,106 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 16:28:39,107 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 16:28:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 16:28:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-15 16:28:39,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:28:39,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:39,131 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:39,131 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:39,133 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 16:28:39,133 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 16:28:39,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:39,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:39,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-15 16:28:39,133 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-15 16:28:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:28:39,134 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-15 16:28:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-04-15 16:28:39,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:28:39,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:28:39,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:28:39,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:28:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:28:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-15 16:28:39,136 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-04-15 16:28:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:28:39,136 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-15 16:28:39,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 16:28:39,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-15 16:28:47,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 51 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 16:28:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 16:28:47,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 16:28:47,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:28:47,220 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:28:47,236 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 16:28:47,420 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 16:28:47,420 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:28:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:28:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-15 16:28:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:28:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344806348] [2022-04-15 16:28:47,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:28:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 2 times [2022-04-15 16:28:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:28:47,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053178447] [2022-04-15 16:28:47,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:28:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:28:47,432 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:28:47,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954415607] [2022-04-15 16:28:47,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:28:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:28:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:28:47,439 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 16:28:47,439 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 16:28:47,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:28:47,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:28:47,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 16:28:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:28:47,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:28:54,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {2601#true} call ULTIMATE.init(); {2601#true} is VALID [2022-04-15 16:28:54,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {2601#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(13, 2);call #Ultimate.allocInit(12, 3); {2601#true} is VALID [2022-04-15 16:28:54,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:28:54,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2601#true} {2601#true} #71#return; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {2601#true} call #t~ret6 := main(); {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {2601#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L272 TraceCheckUtils]: 6: Hoare triple {2601#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2601#true} {2601#true} #61#return; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {2601#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L272 TraceCheckUtils]: 12: Hoare triple {2601#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2601#true} {2601#true} #63#return; {2601#true} is VALID [2022-04-15 16:28:54,506 INFO L272 TraceCheckUtils]: 17: Hoare triple {2601#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:28:54,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:28:54,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:28:54,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:28:54,507 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2601#true} {2601#true} #65#return; {2601#true} is VALID [2022-04-15 16:28:54,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {2601#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:28:54,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:28:54,507 INFO L272 TraceCheckUtils]: 24: Hoare triple {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:28:54,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:28:54,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:28:54,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:28:54,508 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2601#true} {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:28:54,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {2672#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2694#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:28:54,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {2694#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2698#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:28:54,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2698#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2702#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:28:54,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {2702#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {2702#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:28:54,510 INFO L272 TraceCheckUtils]: 33: Hoare triple {2702#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:28:54,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {2601#true} ~cond := #in~cond; {2712#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:54,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {2712#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:54,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:28:54,512 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} {2702#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {2723#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:28:54,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {2723#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {2723#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:28:54,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {2723#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2730#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 16:28:54,517 INFO L290 TraceCheckUtils]: 40: Hoare triple {2730#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2734#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2))) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-15 16:28:54,518 INFO L290 TraceCheckUtils]: 41: Hoare triple {2734#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2))) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !false; {2734#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2))) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-15 16:28:54,529 INFO L272 TraceCheckUtils]: 42: Hoare triple {2734#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (* main_~a~0 2))) (* main_~b~0 main_~a~0)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:28:54,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {2741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:28:54,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {2745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2602#false} is VALID [2022-04-15 16:28:54,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {2602#false} assume !false; {2602#false} is VALID [2022-04-15 16:28:54,530 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 16:28:54,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:30:32,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {2602#false} assume !false; {2602#false} is VALID [2022-04-15 16:30:32,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {2745#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2602#false} is VALID [2022-04-15 16:30:32,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {2741#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2745#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:32,298 INFO L272 TraceCheckUtils]: 42: Hoare triple {2761#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2741#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:30:32,298 INFO L290 TraceCheckUtils]: 41: Hoare triple {2761#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2761#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:30:32,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {2768#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2761#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:30:32,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {2772#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2768#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:30:32,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {2772#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {2772#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:30:32,307 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} {2779#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} #67#return; {2772#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:30:32,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:32,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {2789#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2716#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:32,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {2601#true} ~cond := #in~cond; {2789#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:30:32,308 INFO L272 TraceCheckUtils]: 33: Hoare triple {2779#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:30:32,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {2779#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} assume !false; {2779#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 16:30:32,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(and (or (<= 0 (+ (div main_~y~0 2) 1)) (forall ((aux_div_aux_mod_v_main_~y~0_30_22_69 Int) (aux_div_v_main_~y~0_30_22 Int)) (or (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22) 1) 0) (= (+ (* (* aux_div_v_main_~y~0_30_22 main_~x~0) 4) (* 2 (* main_~x~0 (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22) 1)))) (+ (* (* aux_div_aux_mod_v_main_~y~0_30_22_69 main_~x~0) 4) (* main_~x~0 4))) (<= (+ (* aux_div_aux_mod_v_main_~y~0_30_22_69 2) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_30_22 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (<= (+ (* aux_div_v_main_~y~0_30_22 2) 1) (div main_~y~0 2)))) (= (mod main_~y~0 2) 0)) (or (not (= (mod main_~y~0 2) 0)) (forall ((aux_div_aux_mod_v_main_~y~0_30_22_69 Int) (aux_div_v_main_~y~0_30_22 Int)) (or (= (+ (* (* aux_div_aux_mod_v_main_~y~0_30_22_69 main_~x~0) 4) (* main_~x~0 4)) (+ (* (* aux_div_v_main_~y~0_30_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22)) main_~x~0) 2))) (<= (+ (* aux_div_v_main_~y~0_30_22 2) 2) (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_30_22 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22)) 0) (<= (+ 2 (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (div main_~y~0 2)))) (<= 0 (div main_~y~0 2))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2779#(or (<= 0 main_~y~0) (= (+ (* (* main_~x~0 2) (+ (div main_~y~0 2) 1)) (* main_~b~0 main_~a~0) (* (- 1) main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {2601#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2799#(and (or (<= 0 (+ (div main_~y~0 2) 1)) (forall ((aux_div_aux_mod_v_main_~y~0_30_22_69 Int) (aux_div_v_main_~y~0_30_22 Int)) (or (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22) 1) 0) (= (+ (* (* aux_div_v_main_~y~0_30_22 main_~x~0) 4) (* 2 (* main_~x~0 (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22) 1)))) (+ (* (* aux_div_aux_mod_v_main_~y~0_30_22_69 main_~x~0) 4) (* main_~x~0 4))) (<= (+ (* aux_div_aux_mod_v_main_~y~0_30_22_69 2) 1) (div main_~y~0 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_30_22 2)) (< (+ (div main_~y~0 2) 1) (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (<= (+ (* aux_div_v_main_~y~0_30_22 2) 1) (div main_~y~0 2)))) (= (mod main_~y~0 2) 0)) (or (not (= (mod main_~y~0 2) 0)) (forall ((aux_div_aux_mod_v_main_~y~0_30_22_69 Int) (aux_div_v_main_~y~0_30_22 Int)) (or (= (+ (* (* aux_div_aux_mod_v_main_~y~0_30_22_69 main_~x~0) 4) (* main_~x~0 4)) (+ (* (* aux_div_v_main_~y~0_30_22 main_~x~0) 4) (* (* (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22)) main_~x~0) 2))) (<= (+ (* aux_div_v_main_~y~0_30_22 2) 2) (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_30_22 2)) (= (+ (div main_~y~0 2) (* (- 2) aux_div_v_main_~y~0_30_22)) 0) (<= (+ 2 (* aux_div_aux_mod_v_main_~y~0_30_22_69 2)) (div main_~y~0 2)))) (<= 0 (div main_~y~0 2))))} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {2601#true} assume !!(0 != ~y~0); {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2601#true} {2601#true} #67#return; {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L272 TraceCheckUtils]: 24: Hoare triple {2601#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {2601#true} assume !false; {2601#true} is VALID [2022-04-15 16:30:32,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {2601#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2601#true} {2601#true} #65#return; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L272 TraceCheckUtils]: 17: Hoare triple {2601#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2601#true} {2601#true} #63#return; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L272 TraceCheckUtils]: 12: Hoare triple {2601#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2601#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2601#true} {2601#true} #61#return; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {2601#true} assume !(0 == ~cond); {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {2601#true} ~cond := #in~cond; {2601#true} is VALID [2022-04-15 16:30:32,340 INFO L272 TraceCheckUtils]: 6: Hoare triple {2601#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {2601#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {2601#true} call #t~ret6 := main(); {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2601#true} {2601#true} #71#return; {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2601#true} assume true; {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2601#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(13, 2);call #Ultimate.allocInit(12, 3); {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {2601#true} call ULTIMATE.init(); {2601#true} is VALID [2022-04-15 16:30:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 16:30:32,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:30:32,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053178447] [2022-04-15 16:30:32,341 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:30:32,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954415607] [2022-04-15 16:30:32,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954415607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:30:32,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:30:32,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-15 16:30:32,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:30:32,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344806348] [2022-04-15 16:30:32,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344806348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:30:32,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:30:32,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 16:30:32,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496817062] [2022-04-15 16:30:32,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:30:32,342 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-15 16:30:32,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:30:32,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:30:32,379 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 16:30:32,379 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 16:30:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:30:32,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 16:30:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-15 16:30:32,379 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:30:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:30:33,806 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-04-15 16:30:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 16:30:33,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-15 16:30:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:30:33,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:30:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 16:30:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:30:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 16:30:33,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-15 16:30:33,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:30:33,867 INFO L225 Difference]: With dead ends: 67 [2022-04-15 16:30:33,867 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 16:30:33,867 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-15 16:30:33,868 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 16:30:33,868 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 235 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 16:30:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 16:30:33,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-04-15 16:30:33,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:30:33,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:30:33,913 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:30:33,913 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:30:33,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:30:33,915 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-15 16:30:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-15 16:30:33,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:30:33,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:30:33,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 16:30:33,915 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 65 states. [2022-04-15 16:30:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:30:33,917 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-04-15 16:30:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-04-15 16:30:33,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:30:33,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:30:33,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:30:33,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:30:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 16:30:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-15 16:30:33,918 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 46 [2022-04-15 16:30:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:30:33,919 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-15 16:30:33,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:30:33,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 62 transitions. [2022-04-15 16:30:44,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 57 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 16:30:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-15 16:30:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 16:30:44,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:30:44,052 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:30:44,068 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 16:30:44,263 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 16:30:44,263 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:30:44,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:30:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 3 times [2022-04-15 16:30:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:30:44,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734684485] [2022-04-15 16:30:44,264 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:30:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 4 times [2022-04-15 16:30:44,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:30:44,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767488156] [2022-04-15 16:30:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:30:44,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:30:44,279 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:30:44,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521859112] [2022-04-15 16:30:44,279 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 16:30:44,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:30:44,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:30:44,280 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 16:30:44,281 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 16:30:44,314 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 16:30:44,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:30:44,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 16:30:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:30:44,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:30:46,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2022-04-15 16:30:46,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {3273#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(13, 2);call #Ultimate.allocInit(12, 3); {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #71#return; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret6 := main(); {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {3273#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {3273#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3273#true} {3273#true} #61#return; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {3273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3273#true} is VALID [2022-04-15 16:30:46,730 INFO L272 TraceCheckUtils]: 12: Hoare triple {3273#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:30:46,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {3273#true} ~cond := #in~cond; {3317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:30:46,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:46,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {3321#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3321#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:30:46,732 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3321#(not (= |assume_abort_if_not_#in~cond| 0))} {3273#true} #63#return; {3328#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-15 16:30:46,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {3328#(and (<= main_~b~0 5) (<= 0 main_~b~0))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:30:46,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:30:46,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:30:46,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:30:46,732 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3273#true} {3328#(and (<= main_~b~0 5) (<= 0 main_~b~0))} #65#return; {3328#(and (<= main_~b~0 5) (<= 0 main_~b~0))} is VALID [2022-04-15 16:30:46,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {3328#(and (<= main_~b~0 5) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3347#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:30:46,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {3347#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {3347#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:30:46,733 INFO L272 TraceCheckUtils]: 24: Hoare triple {3347#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:30:46,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {3273#true} ~cond := #in~cond; {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:46,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:46,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:46,734 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} {3347#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:30:46,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:30:46,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {3368#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3375#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:30:46,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {3375#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:30:46,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !false; {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:30:46,736 INFO L272 TraceCheckUtils]: 33: Hoare triple {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:30:46,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {3273#true} ~cond := #in~cond; {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:46,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {3357#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:46,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:30:46,739 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} #67#return; {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:30:46,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {3379#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !!(0 != ~y~0); {3401#(and (not (= main_~y~0 0)) (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 16:30:46,740 INFO L290 TraceCheckUtils]: 39: Hoare triple {3401#(and (not (= main_~y~0 0)) (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3405#(and (= main_~z~0 main_~x~0) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 16:30:46,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {3405#(and (= main_~z~0 main_~x~0) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3409#(and (= (* main_~a~0 4) main_~x~0) (<= main_~b~0 5) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 16:30:46,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {3409#(and (= (* main_~a~0 4) main_~x~0) (<= main_~b~0 5) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !false; {3409#(and (= (* main_~a~0 4) main_~x~0) (<= main_~b~0 5) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 16:30:46,746 INFO L272 TraceCheckUtils]: 42: Hoare triple {3409#(and (= (* main_~a~0 4) main_~x~0) (<= main_~b~0 5) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:30:46,746 INFO L290 TraceCheckUtils]: 43: Hoare triple {3416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:30:46,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {3420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3274#false} is VALID [2022-04-15 16:30:46,747 INFO L290 TraceCheckUtils]: 45: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2022-04-15 16:30:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 16:30:46,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:31:37,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {3274#false} assume !false; {3274#false} is VALID [2022-04-15 16:31:37,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {3420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3274#false} is VALID [2022-04-15 16:31:37,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {3416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:37,185 INFO L272 TraceCheckUtils]: 42: Hoare triple {3436#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:31:37,186 INFO L290 TraceCheckUtils]: 41: Hoare triple {3436#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3436#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:31:37,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {3443#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3436#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:31:37,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {3447#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3443#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:31:37,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {3447#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {3447#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:31:37,758 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} {3273#true} #67#return; {3447#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:31:37,758 INFO L290 TraceCheckUtils]: 36: Hoare triple {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {3463#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {3273#true} ~cond := #in~cond; {3463#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:31:37,759 INFO L272 TraceCheckUtils]: 33: Hoare triple {3273#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {3273#true} assume !false; {3273#true} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {3273#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3273#true} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3273#true} is VALID [2022-04-15 16:31:37,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {3273#true} assume !!(0 != ~y~0); {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3273#true} {3273#true} #67#return; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L272 TraceCheckUtils]: 24: Hoare triple {3273#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {3273#true} assume !false; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {3273#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3273#true} {3273#true} #65#return; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L272 TraceCheckUtils]: 17: Hoare triple {3273#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3273#true} {3273#true} #63#return; {3273#true} is VALID [2022-04-15 16:31:37,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L272 TraceCheckUtils]: 12: Hoare triple {3273#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {3273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3273#true} {3273#true} #61#return; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {3273#true} assume !(0 == ~cond); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {3273#true} ~cond := #in~cond; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {3273#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {3273#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {3273#true} call #t~ret6 := main(); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3273#true} {3273#true} #71#return; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3273#true} assume true; {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3273#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(13, 2);call #Ultimate.allocInit(12, 3); {3273#true} is VALID [2022-04-15 16:31:37,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {3273#true} call ULTIMATE.init(); {3273#true} is VALID [2022-04-15 16:31:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 16:31:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:31:37,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767488156] [2022-04-15 16:31:37,762 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:31:37,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521859112] [2022-04-15 16:31:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521859112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:31:37,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:31:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2022-04-15 16:31:37,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:31:37,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734684485] [2022-04-15 16:31:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734684485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:31:37,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:31:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 16:31:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118932771] [2022-04-15 16:31:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:31:37,763 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-04-15 16:31:37,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:31:37,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:31:37,807 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 16:31:37,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 16:31:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 16:31:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-04-15 16:31:37,808 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:31:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:38,585 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-04-15 16:31:38,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 16:31:38,585 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-04-15 16:31:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:31:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:31:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-15 16:31:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:31:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-15 16:31:38,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-15 16:31:38,649 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 16:31:38,650 INFO L225 Difference]: With dead ends: 84 [2022-04-15 16:31:38,650 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 16:31:38,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-04-15 16:31:38,651 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 16:31:38,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 16:31:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 16:31:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-04-15 16:31:38,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:31:38,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:38,711 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:38,712 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:38,714 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 16:31:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-15 16:31:38,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:38,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:38,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 65 states. [2022-04-15 16:31:38,714 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 65 states. [2022-04-15 16:31:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:31:38,716 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 16:31:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-04-15 16:31:38,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:31:38,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:31:38,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:31:38,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:31:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:31:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-15 16:31:38,717 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 46 [2022-04-15 16:31:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:31:38,717 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-15 16:31:38,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 14 states have internal predecessors, (26), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 16:31:38,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 71 transitions. [2022-04-15 16:31:46,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 16:31:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-15 16:31:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 16:31:46,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:31:46,513 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:31:46,531 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 16:31:46,713 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 16:31:46,714 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:31:46,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:31:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 3 times [2022-04-15 16:31:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:31:46,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402447467] [2022-04-15 16:31:46,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:31:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 4 times [2022-04-15 16:31:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:31:46,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253212938] [2022-04-15 16:31:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:31:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:31:46,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:31:46,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [717108888] [2022-04-15 16:31:46,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 16:31:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:31:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:31:46,737 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 16:31:46,737 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 16:31:46,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 16:31:46,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:31:46,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 16:31:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:31:46,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:31:49,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {4000#true} call ULTIMATE.init(); {4000#true} is VALID [2022-04-15 16:31:49,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {4000#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(13, 2);call #Ultimate.allocInit(12, 3); {4000#true} is VALID [2022-04-15 16:31:49,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4000#true} {4000#true} #71#return; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {4000#true} call #t~ret6 := main(); {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {4000#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {4000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4000#true} {4000#true} #61#return; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {4000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {4000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4000#true} {4000#true} #63#return; {4000#true} is VALID [2022-04-15 16:31:49,829 INFO L272 TraceCheckUtils]: 17: Hoare triple {4000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:31:49,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {4000#true} ~cond := #in~cond; {4059#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:31:49,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {4059#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4063#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:49,830 INFO L290 TraceCheckUtils]: 20: Hoare triple {4063#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4063#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:31:49,831 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4063#(not (= |assume_abort_if_not_#in~cond| 0))} {4000#true} #65#return; {4070#(<= 1 main_~b~0)} is VALID [2022-04-15 16:31:49,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {4070#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:31:49,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:31:49,832 INFO L272 TraceCheckUtils]: 24: Hoare triple {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:31:49,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {4000#true} ~cond := #in~cond; {4084#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:49,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {4084#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:49,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:31:49,833 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:31:49,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:31:49,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {4074#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4101#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:31:49,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {4101#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,835 INFO L272 TraceCheckUtils]: 33: Hoare triple {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:31:49,835 INFO L290 TraceCheckUtils]: 34: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:31:49,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:31:49,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:31:49,835 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4000#true} {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #67#return; {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {4105#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4130#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {4130#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4134#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {4134#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {4134#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 16:31:49,840 INFO L272 TraceCheckUtils]: 42: Hoare triple {4134#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4141#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:31:49,840 INFO L290 TraceCheckUtils]: 43: Hoare triple {4141#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4145#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:31:49,840 INFO L290 TraceCheckUtils]: 44: Hoare triple {4145#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4001#false} is VALID [2022-04-15 16:31:49,840 INFO L290 TraceCheckUtils]: 45: Hoare triple {4001#false} assume !false; {4001#false} is VALID [2022-04-15 16:31:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 16:31:49,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:32:42,287 INFO L290 TraceCheckUtils]: 45: Hoare triple {4001#false} assume !false; {4001#false} is VALID [2022-04-15 16:32:42,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {4145#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4001#false} is VALID [2022-04-15 16:32:42,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {4141#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4145#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:32:42,289 INFO L272 TraceCheckUtils]: 42: Hoare triple {4161#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4141#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:32:42,289 INFO L290 TraceCheckUtils]: 41: Hoare triple {4161#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4161#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:32:42,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {4168#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4161#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:32:42,294 INFO L290 TraceCheckUtils]: 39: Hoare triple {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4168#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:32:42,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:32:42,295 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4000#true} {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #67#return; {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:32:42,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:32:42,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:32:42,296 INFO L290 TraceCheckUtils]: 34: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:32:42,296 INFO L272 TraceCheckUtils]: 33: Hoare triple {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:32:42,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:32:42,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {4197#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4172#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:32:42,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {4201#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4197#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} is VALID [2022-04-15 16:32:42,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {4205#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} assume !!(0 != ~y~0); {4201#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-15 16:32:42,349 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} {4209#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} #67#return; {4205#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (= main_~y~0 0))} is VALID [2022-04-15 16:32:42,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:32:42,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {4219#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4088#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:32:42,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {4000#true} ~cond := #in~cond; {4219#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:32:42,350 INFO L272 TraceCheckUtils]: 24: Hoare triple {4209#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:32:42,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {4209#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} assume !false; {4209#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-15 16:32:42,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {4229#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4209#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-15 16:32:42,352 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4063#(not (= |assume_abort_if_not_#in~cond| 0))} {4000#true} #65#return; {4229#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} is VALID [2022-04-15 16:32:42,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {4063#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4063#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {4242#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4063#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {4000#true} ~cond := #in~cond; {4242#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 16:32:42,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {4000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4000#true} {4000#true} #63#return; {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L272 TraceCheckUtils]: 12: Hoare triple {4000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {4000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4000#true} {4000#true} #61#return; {4000#true} is VALID [2022-04-15 16:32:42,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {4000#true} assume !(0 == ~cond); {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {4000#true} ~cond := #in~cond; {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {4000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {4000#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {4000#true} call #t~ret6 := main(); {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4000#true} {4000#true} #71#return; {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {4000#true} assume true; {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {4000#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(13, 2);call #Ultimate.allocInit(12, 3); {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {4000#true} call ULTIMATE.init(); {4000#true} is VALID [2022-04-15 16:32:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 16:32:42,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:32:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253212938] [2022-04-15 16:32:42,354 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:32:42,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717108888] [2022-04-15 16:32:42,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717108888] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:32:42,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:32:42,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 24 [2022-04-15 16:32:42,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:32:42,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402447467] [2022-04-15 16:32:42,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402447467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:32:42,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:32:42,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 16:32:42,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71854692] [2022-04-15 16:32:42,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:32:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-15 16:32:42,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:32:42,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:32:42,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:32:42,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 16:32:42,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:32:42,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 16:32:42,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-15 16:32:42,386 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:32:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:43,515 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-04-15 16:32:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 16:32:43,515 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-15 16:32:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:32:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:32:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2022-04-15 16:32:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:32:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2022-04-15 16:32:43,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 54 transitions. [2022-04-15 16:32:43,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:32:43,572 INFO L225 Difference]: With dead ends: 76 [2022-04-15 16:32:43,572 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 16:32:43,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-04-15 16:32:43,574 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 16:32:43,574 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 167 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 16:32:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 16:32:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2022-04-15 16:32:43,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:32:43,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:32:43,643 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:32:43,648 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:32:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:43,656 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-04-15 16:32:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-04-15 16:32:43,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:32:43,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:32:43,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 74 states. [2022-04-15 16:32:43,657 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 74 states. [2022-04-15 16:32:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:32:43,659 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-04-15 16:32:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-04-15 16:32:43,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:32:43,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:32:43,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:32:43,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:32:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 16:32:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-04-15 16:32:43,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 46 [2022-04-15 16:32:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:32:43,661 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-04-15 16:32:43,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 16:32:43,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 71 transitions. [2022-04-15 16:32:52,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 68 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 16:32:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-04-15 16:32:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 16:32:52,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:32:52,168 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:32:52,183 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 16:32:52,371 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 16:32:52,371 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:32:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:32:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 5 times [2022-04-15 16:32:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:32:52,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028008650] [2022-04-15 16:32:52,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:32:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 6 times [2022-04-15 16:32:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:32:52,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666516433] [2022-04-15 16:32:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:32:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:32:52,394 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:32:52,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003688483] [2022-04-15 16:32:52,394 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 16:32:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:32:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:32:52,395 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 16:32:52,396 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 16:32:52,436 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 16:32:52,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:32:52,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 16:32:52,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:32:52,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:33:23,912 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 16:33:27,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-15 16:33:27,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#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(13, 2);call #Ultimate.allocInit(12, 3); {4733#true} is VALID [2022-04-15 16:33:27,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #71#return; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret6 := main(); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #61#return; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {4733#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {4733#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4733#true} {4733#true} #63#return; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L272 TraceCheckUtils]: 17: Hoare triple {4733#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:27,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4733#true} {4733#true} #65#return; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {4733#true} assume !false; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L272 TraceCheckUtils]: 24: Hoare triple {4733#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4733#true} {4733#true} #67#return; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {4733#true} assume !!(0 != ~y~0); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {4733#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {4733#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {4733#true} assume !false; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L272 TraceCheckUtils]: 33: Hoare triple {4733#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:27,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:27,472 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4733#true} {4733#true} #67#return; {4733#true} is VALID [2022-04-15 16:33:27,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {4733#true} assume !!(0 != ~y~0); {4852#(not (= main_~y~0 0))} is VALID [2022-04-15 16:33:27,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {4852#(not (= main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4856#(< 0 (+ main_~y~0 1))} is VALID [2022-04-15 16:33:27,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {4856#(< 0 (+ main_~y~0 1))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4856#(< 0 (+ main_~y~0 1))} is VALID [2022-04-15 16:33:27,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {4856#(< 0 (+ main_~y~0 1))} assume !false; {4856#(< 0 (+ main_~y~0 1))} is VALID [2022-04-15 16:33:27,473 INFO L272 TraceCheckUtils]: 42: Hoare triple {4856#(< 0 (+ main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:27,474 INFO L290 TraceCheckUtils]: 43: Hoare triple {4733#true} ~cond := #in~cond; {4869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:33:27,474 INFO L290 TraceCheckUtils]: 44: Hoare triple {4869#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:27,474 INFO L290 TraceCheckUtils]: 45: Hoare triple {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:27,477 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} {4856#(< 0 (+ main_~y~0 1))} #67#return; {4880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 16:33:27,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {4880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {4880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 16:33:27,478 INFO L290 TraceCheckUtils]: 48: Hoare triple {4880#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4887#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 16:33:27,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {4887#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4891#(and (exists ((aux_div_v_main_~y~0_50_22 Int) (aux_mod_v_main_~y~0_50_22 Int)) (and (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22) 2)) (not (= aux_mod_v_main_~y~0_50_22 1)) (<= 0 aux_mod_v_main_~y~0_50_22) (< 0 (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22 1)) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_50_22 2))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 16:33:28,154 INFO L290 TraceCheckUtils]: 50: Hoare triple {4891#(and (exists ((aux_div_v_main_~y~0_50_22 Int) (aux_mod_v_main_~y~0_50_22 Int)) (and (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22) 2)) (not (= aux_mod_v_main_~y~0_50_22 1)) (<= 0 aux_mod_v_main_~y~0_50_22) (< 0 (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22 1)) (= (+ main_~z~0 (* (+ (* aux_div_v_main_~y~0_50_22 2) aux_mod_v_main_~y~0_50_22) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (< aux_mod_v_main_~y~0_50_22 2))) (= (mod main_~x~0 2) 0))} assume !false; {4895#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 16:33:28,536 INFO L272 TraceCheckUtils]: 51: Hoare triple {4895#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:33:28,537 INFO L290 TraceCheckUtils]: 52: Hoare triple {4899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:33:28,537 INFO L290 TraceCheckUtils]: 53: Hoare triple {4903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-15 16:33:28,537 INFO L290 TraceCheckUtils]: 54: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-15 16:33:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 16:33:28,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:33:57,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-04-15 16:33:57,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {4903#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4734#false} is VALID [2022-04-15 16:33:57,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {4899#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4903#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:33:57,462 INFO L272 TraceCheckUtils]: 51: Hoare triple {4919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4899#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:33:57,462 INFO L290 TraceCheckUtils]: 50: Hoare triple {4919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:33:57,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {4926#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4919#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:33:57,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {4930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4926#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:33:57,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {4930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:33:57,485 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} {4937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {4930#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 16:33:57,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:57,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {4947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:33:57,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {4733#true} ~cond := #in~cond; {4947#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:33:57,486 INFO L272 TraceCheckUtils]: 42: Hoare triple {4937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {4937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 16:33:57,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {4957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4937#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {4733#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4957#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {4733#true} assume !!(0 != ~y~0); {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4733#true} {4733#true} #67#return; {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 35: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 34: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L272 TraceCheckUtils]: 33: Hoare triple {4733#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {4733#true} assume !false; {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {4733#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {4733#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4733#true} is VALID [2022-04-15 16:33:57,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {4733#true} assume !!(0 != ~y~0); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4733#true} {4733#true} #67#return; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L272 TraceCheckUtils]: 24: Hoare triple {4733#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {4733#true} assume !false; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {4733#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4733#true} {4733#true} #65#return; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {4733#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4733#true} {4733#true} #63#return; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {4733#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {4733#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4733#true} {4733#true} #61#return; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume !(0 == ~cond); {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} ~cond := #in~cond; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L272 TraceCheckUtils]: 6: Hoare triple {4733#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {4733#true} call #t~ret6 := main(); {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4733#true} {4733#true} #71#return; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume true; {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#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(13, 2);call #Ultimate.allocInit(12, 3); {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {4733#true} call ULTIMATE.init(); {4733#true} is VALID [2022-04-15 16:33:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 16:33:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:33:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666516433] [2022-04-15 16:33:57,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:33:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003688483] [2022-04-15 16:33:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003688483] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:33:57,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:33:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-15 16:33:57,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:33:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028008650] [2022-04-15 16:33:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028008650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:33:57,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:33:57,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 16:33:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126076616] [2022-04-15 16:33:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:33:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-04-15 16:33:57,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:33:57,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:33:58,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:33:58,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 16:33:58,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:33:58,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 16:33:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=2, NotChecked=0, Total=306 [2022-04-15 16:33:58,615 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:34:01,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:34:06,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:34:21,867 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:34:27,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 16:34:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:35,912 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-04-15 16:34:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 16:34:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-04-15 16:34:35,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:34:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:34:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-15 16:34:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:34:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 54 transitions. [2022-04-15 16:34:35,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 54 transitions. [2022-04-15 16:34:39,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 16:34:39,423 INFO L225 Difference]: With dead ends: 96 [2022-04-15 16:34:39,423 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 16:34:39,423 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=126, Invalid=424, Unknown=2, NotChecked=0, Total=552 [2022-04-15 16:34:39,424 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-15 16:34:39,424 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 180 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 153 Invalid, 2 Unknown, 33 Unchecked, 10.4s Time] [2022-04-15 16:34:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 16:34:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 16:34:39,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:34:39,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:34:39,475 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:34:39,475 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:34:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:39,476 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 16:34:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 16:34:39,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:34:39,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:34:39,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 16:34:39,476 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 53 states. [2022-04-15 16:34:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:34:39,477 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 16:34:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 16:34:39,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:34:39,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:34:39,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:34:39,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:34:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 38 states have internal predecessors, (38), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 16:34:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 16:34:39,478 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 55 [2022-04-15 16:34:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:34:39,478 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 16:34:39,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 16:34:39,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 16:34:44,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 54 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 16:34:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 16:34:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 16:34:44,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 16:34:44,239 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 16:34:44,254 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 16:34:44,439 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 16:34:44,439 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 16:34:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 16:34:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 179886322, now seen corresponding path program 7 times [2022-04-15 16:34:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 16:34:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1880541893] [2022-04-15 16:34:44,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 16:34:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 179886322, now seen corresponding path program 8 times [2022-04-15 16:34:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 16:34:44,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448252095] [2022-04-15 16:34:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 16:34:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 16:34:44,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 16:34:44,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220060371] [2022-04-15 16:34:44,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 16:34:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 16:34:44,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 16:34:44,455 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 16:34:44,456 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 16:34:44,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 16:34:44,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 16:34:44,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 16:34:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 16:34:44,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 16:34:48,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {5500#true} call ULTIMATE.init(); {5500#true} is VALID [2022-04-15 16:34:48,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {5500#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(13, 2);call #Ultimate.allocInit(12, 3); {5500#true} is VALID [2022-04-15 16:34:48,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:34:48,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5500#true} {5500#true} #71#return; {5500#true} is VALID [2022-04-15 16:34:48,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {5500#true} call #t~ret6 := main(); {5500#true} is VALID [2022-04-15 16:34:48,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {5500#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5500#true} is VALID [2022-04-15 16:34:48,278 INFO L272 TraceCheckUtils]: 6: Hoare triple {5500#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {5500#true} ~cond := #in~cond; {5526#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:34:48,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {5526#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5530#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:34:48,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {5530#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5530#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:34:48,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5530#(not (= |assume_abort_if_not_#in~cond| 0))} {5500#true} #61#return; {5537#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {5537#(and (<= 0 main_~a~0) (<= main_~a~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5537#(and (<= 0 main_~a~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,279 INFO L272 TraceCheckUtils]: 12: Hoare triple {5537#(and (<= 0 main_~a~0) (<= main_~a~0 5))} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {5500#true} ~cond := #in~cond; {5526#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 16:34:48,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {5526#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {5530#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:34:48,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {5530#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {5530#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 16:34:48,281 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5530#(not (= |assume_abort_if_not_#in~cond| 0))} {5537#(and (<= 0 main_~a~0) (<= main_~a~0 5))} #63#return; {5556#(and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,281 INFO L272 TraceCheckUtils]: 17: Hoare triple {5556#(and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5))} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:34:48,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:34:48,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:34:48,281 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5500#true} {5556#(and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5))} #65#return; {5556#(and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {5556#(and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:34:48,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} assume !false; {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:34:48,282 INFO L272 TraceCheckUtils]: 24: Hoare triple {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:34:48,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:34:48,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:34:48,283 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5500#true} {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} #67#return; {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:34:48,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {5575#(and (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {5597#(and (not (= main_~y~0 0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:34:48,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {5597#(and (not (= main_~y~0 0)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5601#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 16:34:48,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {5601#(and (not (= main_~y~0 0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !false; {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,284 INFO L272 TraceCheckUtils]: 33: Hoare triple {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,284 INFO L290 TraceCheckUtils]: 34: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:34:48,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:34:48,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:34:48,285 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5500#true} {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} #67#return; {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,285 INFO L290 TraceCheckUtils]: 38: Hoare triple {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !!(0 != ~y~0); {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {5605#(and (= main_~y~0 (div main_~b~0 2)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5630#(and (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {5630#(and (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5634#(and (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {5634#(and (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !false; {5634#(and (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,288 INFO L272 TraceCheckUtils]: 42: Hoare triple {5634#(and (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:34:48,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {5500#true} ~cond := #in~cond; {5644#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:34:48,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {5644#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:34:48,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:34:48,289 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} {5634#(and (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} #67#return; {5655#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {5655#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume !!(0 != ~y~0); {5655#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,292 INFO L290 TraceCheckUtils]: 48: Hoare triple {5655#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 main_~b~0) (<= main_~a~0 5))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5662#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (= (+ main_~y~0 1) (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= main_~a~0 5) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 16:34:48,296 INFO L290 TraceCheckUtils]: 49: Hoare triple {5662#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (= (+ main_~y~0 1) (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= main_~a~0 5) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5666#(and (= main_~y~0 (div (+ (- 1) (div (div main_~b~0 2) 2)) 2)) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~x~0 (* main_~a~0 8)) (= (+ (* (* main_~a~0 4) (+ (- 1) (div (div main_~b~0 2) 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 (div (div main_~b~0 2) 2)) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {5666#(and (= main_~y~0 (div (+ (- 1) (div (div main_~b~0 2) 2)) 2)) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~x~0 (* main_~a~0 8)) (= (+ (* (* main_~a~0 4) (+ (- 1) (div (div main_~b~0 2) 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 (div (div main_~b~0 2) 2)) (<= main_~a~0 5))} assume !false; {5666#(and (= main_~y~0 (div (+ (- 1) (div (div main_~b~0 2) 2)) 2)) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~x~0 (* main_~a~0 8)) (= (+ (* (* main_~a~0 4) (+ (- 1) (div (div main_~b~0 2) 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 (div (div main_~b~0 2) 2)) (<= main_~a~0 5))} is VALID [2022-04-15 16:34:48,300 INFO L272 TraceCheckUtils]: 51: Hoare triple {5666#(and (= main_~y~0 (div (+ (- 1) (div (div main_~b~0 2) 2)) 2)) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~x~0 (* main_~a~0 8)) (= (+ (* (* main_~a~0 4) (+ (- 1) (div (div main_~b~0 2) 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= main_~b~0 5) (<= 0 main_~a~0) (not (= main_~b~0 0)) (not (= (mod main_~b~0 2) 1)) (<= 0 (div (div main_~b~0 2) 2)) (<= main_~a~0 5))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:34:48,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {5673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:34:48,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {5677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5501#false} is VALID [2022-04-15 16:34:48,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {5501#false} assume !false; {5501#false} is VALID [2022-04-15 16:34:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 16:34:48,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 16:35:25,481 INFO L290 TraceCheckUtils]: 54: Hoare triple {5501#false} assume !false; {5501#false} is VALID [2022-04-15 16:35:25,482 INFO L290 TraceCheckUtils]: 53: Hoare triple {5677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5501#false} is VALID [2022-04-15 16:35:25,482 INFO L290 TraceCheckUtils]: 52: Hoare triple {5673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 16:35:25,482 INFO L272 TraceCheckUtils]: 51: Hoare triple {5693#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 16:35:25,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {5693#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {5693#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:35:25,487 INFO L290 TraceCheckUtils]: 49: Hoare triple {5700#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5693#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 16:35:25,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {5704#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5700#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 16:35:25,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {5704#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {5704#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:35:25,665 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} {5500#true} #67#return; {5704#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 16:35:25,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:35:25,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {5720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5648#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {5500#true} ~cond := #in~cond; {5720#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 16:35:25,666 INFO L272 TraceCheckUtils]: 42: Hoare triple {5500#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {5500#true} assume !false; {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {5500#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 39: Hoare triple {5500#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 38: Hoare triple {5500#true} assume !!(0 != ~y~0); {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5500#true} {5500#true} #67#return; {5500#true} is VALID [2022-04-15 16:35:25,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L272 TraceCheckUtils]: 33: Hoare triple {5500#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {5500#true} assume !false; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {5500#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {5500#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {5500#true} assume !!(0 != ~y~0); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5500#true} {5500#true} #67#return; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L272 TraceCheckUtils]: 24: Hoare triple {5500#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {5500#true} assume !false; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {5500#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5500#true} {5500#true} #65#return; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L272 TraceCheckUtils]: 17: Hoare triple {5500#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5500#true} {5500#true} #63#return; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L272 TraceCheckUtils]: 12: Hoare triple {5500#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 5 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {5500#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5500#true} {5500#true} #61#return; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {5500#true} assume !(0 == ~cond); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {5500#true} ~cond := #in~cond; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {5500#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 5 then 1 else 0)); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {5500#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {5500#true} call #t~ret6 := main(); {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5500#true} {5500#true} #71#return; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {5500#true} assume true; {5500#true} is VALID [2022-04-15 16:35:25,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {5500#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(13, 2);call #Ultimate.allocInit(12, 3); {5500#true} is VALID [2022-04-15 16:35:25,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {5500#true} call ULTIMATE.init(); {5500#true} is VALID [2022-04-15 16:35:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-15 16:35:25,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 16:35:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448252095] [2022-04-15 16:35:25,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 16:35:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220060371] [2022-04-15 16:35:25,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220060371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 16:35:25,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 16:35:25,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9] total 23 [2022-04-15 16:35:25,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 16:35:25,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1880541893] [2022-04-15 16:35:25,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1880541893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 16:35:25,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 16:35:25,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 16:35:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530263252] [2022-04-15 16:35:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 16:35:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 16:35:25,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 16:35:25,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 16:35:25,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:35:25,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 16:35:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 16:35:25,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 16:35:25,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=1, NotChecked=0, Total=506 [2022-04-15 16:35:25,713 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 16:35:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:35:26,537 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 16:35:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 16:35:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2022-04-15 16:35:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 16:35:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 16:35:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-15 16:35:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 16:35:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 57 transitions. [2022-04-15 16:35:26,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 57 transitions. [2022-04-15 16:35:26,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:35:26,592 INFO L225 Difference]: With dead ends: 62 [2022-04-15 16:35:26,592 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 16:35:26,592 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=98, Invalid=551, Unknown=1, NotChecked=0, Total=650 [2022-04-15 16:35:26,593 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 16:35:26,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 162 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 16:35:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 16:35:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 16:35:26,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 16:35:26,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:35:26,593 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:35:26,593 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:35:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:35:26,594 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:35:26,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:35:26,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:35:26,594 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 16:35:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 16:35:26,594 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:35:26,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 16:35:26,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 16:35:26,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 16:35:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 16:35:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2022-04-15 16:35:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 16:35:26,594 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 16:35:26,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 16:35:26,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 16:35:26,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 16:35:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 16:35:26,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 16:35:26,596 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 16:35:26,617 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 16:35:26,817 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 16:35:26,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 16:35:43,668 WARN L232 SmtUtils]: Spent 16.22s on a formula simplification. DAG size of input: 85 DAG size of output: 25 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 16:36:17,380 WARN L232 SmtUtils]: Spent 33.71s on a formula simplification. DAG size of input: 150 DAG size of output: 22 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 16:36:46,369 WARN L232 SmtUtils]: Spent 23.05s on a formula simplification. DAG size of input: 97 DAG size of output: 26 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 16:36:46,392 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 6) no Hoare annotation was computed. [2022-04-15 16:36:46,392 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 6) no Hoare annotation was computed. [2022-04-15 16:36:46,392 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 6) no Hoare annotation was computed. [2022-04-15 16:36:46,392 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 9 11) the Hoare annotation is: true [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point L10-2(lines 9 11) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 9 11) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~a~0) (<= main_~a~0 5)) [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 0 main_~b~0) (<= main_~a~0 5)) [2022-04-15 16:36:46,392 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-15 16:36:46,392 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 20 49) the Hoare annotation is: true [2022-04-15 16:36:46,392 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~a~0) (<= main_~a~0 5)) [2022-04-15 16:36:46,392 INFO L885 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 20 49) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0)) (.cse1 (<= main_~b~0 5))) (or (and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse0) .cse1 (<= 1 main_~b~0) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0)) (and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) .cse1 (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 1 main_~y~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0)))) [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= main_~z~0 .cse0) (<= 1 main_~b~0) (or (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0) (= .cse0 (+ (* main_~x~0 2) (* 2 (* (div main_~y~0 2) main_~x~0)) main_~z~0))))) [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 20 49) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (and (<= main_~b~0 5) (<= 0 main_~a~0) (<= 1 main_~b~0) (<= main_~a~0 5)) [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 42) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= main_~b~0 5) (= (mod (+ (* (- 1) main_~z~0) .cse0) main_~y~0) 0) (<= 1 main_~b~0) (< 0 (+ main_~y~0 1)))) [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L39-2(lines 39 42) the Hoare annotation is: (and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 5) (<= 1 main_~b~0) (< 0 (+ main_~y~0 1))) [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0)) (.cse1 (<= main_~b~0 5))) (or (and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) .cse0) .cse1 (<= 1 main_~b~0) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0)) (and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) .cse1 (= main_~b~0 main_~y~0) (<= 0 main_~a~0) (<= 1 main_~y~0) (<= main_~a~0 5) (= main_~a~0 main_~x~0)))) [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 45) the Hoare annotation is: (let ((.cse0 (* main_~b~0 main_~a~0))) (and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) .cse0) (<= main_~b~0 5) (or (= main_~z~0 .cse0) (= (mod (+ (* (- 1) main_~z~0) .cse0) main_~y~0) 0)) (<= 1 main_~b~0) (< 0 (+ main_~y~0 1)))) [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2022-04-15 16:36:46,393 INFO L878 garLoopResultBuilder]: At program point L14(lines 14 15) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 16:36:46,394 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 16) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 16:36:46,394 INFO L878 garLoopResultBuilder]: At program point L13-2(lines 12 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 16:36:46,394 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 12 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 16:36:46,394 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 16:36:46,396 INFO L719 BasicCegarLoop]: Path program histogram: [8, 4, 2, 2, 2, 2, 2] [2022-04-15 16:36:46,396 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 16:36:46,398 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 16:36:46,401 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 16:36:49,799 INFO L163 areAnnotationChecker]: CFG has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 16:36:49,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 04:36:49 BoogieIcfgContainer [2022-04-15 16:36:49,807 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 16:36:49,807 INFO L158 Benchmark]: Toolchain (without parser) took 588166.41ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 162.9MB in the beginning and 220.3MB in the end (delta: -57.3MB). Peak memory consumption was 126.4MB. Max. memory is 8.0GB. [2022-04-15 16:36:49,808 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 179.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 16:36:49,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.00ms. Allocated memory is still 210.8MB. Free memory was 162.8MB in the beginning and 188.9MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 16:36:49,808 INFO L158 Benchmark]: Boogie Preprocessor took 17.16ms. Allocated memory is still 210.8MB. Free memory was 188.9MB in the beginning and 187.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 16:36:49,808 INFO L158 Benchmark]: RCFGBuilder took 209.67ms. Allocated memory is still 210.8MB. Free memory was 187.4MB in the beginning and 176.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 16:36:49,808 INFO L158 Benchmark]: TraceAbstraction took 587771.61ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 175.7MB in the beginning and 220.3MB in the end (delta: -44.6MB). Peak memory consumption was 140.0MB. Max. memory is 8.0GB. [2022-04-15 16:36:49,809 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 179.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 163.00ms. Allocated memory is still 210.8MB. Free memory was 162.8MB in the beginning and 188.9MB in the end (delta: -26.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.16ms. Allocated memory is still 210.8MB. Free memory was 188.9MB in the beginning and 187.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.67ms. Allocated memory is still 210.8MB. Free memory was 187.4MB in the beginning and 176.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 587771.61ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 175.7MB in the beginning and 220.3MB in the end (delta: -44.6MB). Peak memory consumption was 140.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 584.3s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 52.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 79.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 15.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 1461 SdHoareTripleChecker+Invalid, 15.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 33 IncrementalHoareTripleChecker+Unchecked, 1189 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1740 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 272 mSDtfsCounter, 1740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 826 GetRequests, 645 SyntacticMatches, 18 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=8, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 33 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 150 PreInvPairs, 246 NumberOfFragments, 369 HoareAnnotationTreeSize, 150 FomulaSimplifications, 745 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 32 FomulaSimplificationsInter, 22463 FormulaSimplificationTreeSizeReductionInter, 78.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((z + 2 * (-1 * x / -2 * y) == b * a && b <= 5) && 1 <= b) && 0 < y + 1) && x % 2 == 0) || ((((((z + y * x == b * a && b <= 5) && b == y) && 0 <= a) && 1 <= y) && a <= 5) && a == x) - ProcedureContractResult [Line: 9]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 16:36:49,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...