/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_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:08:08,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:08:08,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:08:08,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:08:08,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:08:08,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:08:08,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:08:08,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:08:08,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:08:08,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:08:08,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:08:08,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:08:08,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:08:08,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:08:08,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:08:08,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:08:08,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:08:08,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:08:08,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:08:08,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:08:08,677 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:08:08,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:08:08,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:08:08,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:08:08,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:08:08,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:08:08,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:08:08,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:08:08,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:08:08,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:08:08,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:08:08,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:08:08,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:08:08,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:08:08,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:08:08,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:08:08,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:08:08,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:08:08,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:08:08,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:08:08,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:08:08,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:08:08,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:08:08,719 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:08:08,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:08:08,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:08:08,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:08:08,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:08:08,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:08:08,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:08:08,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:08:08,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:08:08,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:08:08,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:08:08,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:08:08,723 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:08:08,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:08:08,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:08:08,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:08:08,937 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:08:08,938 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:08:08,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-08 14:08:08,994 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19504e596/e764b0376e1e4f0c85100f3b678059bd/FLAG4262aebd7 [2022-04-08 14:08:09,387 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:08:09,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-08 14:08:09,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19504e596/e764b0376e1e4f0c85100f3b678059bd/FLAG4262aebd7 [2022-04-08 14:08:09,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19504e596/e764b0376e1e4f0c85100f3b678059bd [2022-04-08 14:08:09,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:08:09,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:08:09,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:08:09,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:08:09,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:08:09,420 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337d490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09, skipping insertion in model container [2022-04-08 14:08:09,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:08:09,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:08:09,583 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_valuebound100.c[537,550] [2022-04-08 14:08:09,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:08:09,609 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:08:09,619 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_valuebound100.c[537,550] [2022-04-08 14:08:09,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:08:09,634 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:08:09,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09 WrapperNode [2022-04-08 14:08:09,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:08:09,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:08:09,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:08:09,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:08:09,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:08:09,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:08:09,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:08:09,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:08:09,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (1/1) ... [2022-04-08 14:08:09,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:08:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:09,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:08:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:08:09,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:08:09,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:08:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:08:09,780 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:08:09,781 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:08:09,965 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:08:09,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:08:09,979 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:08:09,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:08:09 BoogieIcfgContainer [2022-04-08 14:08:09,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:08:09,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:08:09,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:08:10,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:08:10,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:08:09" (1/3) ... [2022-04-08 14:08:10,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f4a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:08:10, skipping insertion in model container [2022-04-08 14:08:10,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:08:09" (2/3) ... [2022-04-08 14:08:10,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0f4a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:08:10, skipping insertion in model container [2022-04-08 14:08:10,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:08:09" (3/3) ... [2022-04-08 14:08:10,008 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2022-04-08 14:08:10,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:08:10,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:08:10,068 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:08:10,080 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:08:10,080 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:08:10,108 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-08 14:08:10,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:08:10,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:10,115 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-08 14:08:10,116 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-08 14:08:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:10,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1601494717] [2022-04-08 14:08:10,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:08:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 2 times [2022-04-08 14:08:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:10,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933502291] [2022-04-08 14:08:10,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:08:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:10,364 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-08 14:08:10,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 14:08:10,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-08 14:08:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:08:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:10,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 14:08:10,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 14:08:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:10,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 14:08:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 14:08:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:10,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 14:08:10,422 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-08 14:08:10,423 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-08 14:08:10,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 14:08:10,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-08 14:08:10,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-08 14:08:10,424 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-08 14:08:10,425 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 14:08:10,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 14:08:10,426 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-08 14:08:10,427 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 14:08:10,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 14:08:10,428 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-08 14:08:10,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 14:08:10,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 14:08:10,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 14:08:10,429 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 14:08:10,430 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-08 14:08:10,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-08 14:08:10,431 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-08 14:08:10,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 14:08:10,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 14:08:10,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 14:08:10,432 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-08 14:08:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:10,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933502291] [2022-04-08 14:08:10,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933502291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:10,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:10,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:08:10,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1601494717] [2022-04-08 14:08:10,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1601494717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:10,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:10,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:08:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42490434] [2022-04-08 14:08:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:10,447 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-08 14:08:10,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:10,451 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-08 14:08:10,487 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-08 14:08:10,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:08:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:10,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:08:10,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:08:10,514 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-08 14:08:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:10,677 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-08 14:08:10,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:08:10,677 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-08 14:08:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:10,679 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-08 14:08:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 14:08:10,692 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-08 14:08:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 14:08:10,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-08 14:08:10,791 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-08 14:08:10,803 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:08:10,803 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 14:08:10,810 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-08 14:08:10,813 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-08 14:08:10,815 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-08 14:08:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 14:08:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 14:08:10,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:10,843 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-08 14:08:10,844 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-08 14:08:10,844 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-08 14:08:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:10,848 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 14:08:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 14:08:10,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:10,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:10,851 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-08 14:08:10,852 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-08 14:08:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:10,854 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 14:08:10,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 14:08:10,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:10,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:10,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:10,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:10,856 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-08 14:08:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 14:08:10,859 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-08 14:08:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:10,859 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 14:08:10,859 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-08 14:08:10,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 14:08:10,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 14:08:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:08:10,902 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:10,902 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-08 14:08:10,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:08:10,903 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-08 14:08:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-08 14:08:10,904 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:08:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 2 times [2022-04-08 14:08:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:10,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317817491] [2022-04-08 14:08:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:10,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:10,950 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:10,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [852804851] [2022-04-08 14:08:10,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:08:10,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:10,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:10,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:08:10,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:08:10,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:08:10,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:10,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:08:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:11,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:11,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {277#true} is VALID [2022-04-08 14:08:11,182 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-08 14:08:11,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 14:08:11,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#true} {277#true} #71#return; {277#true} is VALID [2022-04-08 14:08:11,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#true} call #t~ret6 := main(); {277#true} is VALID [2022-04-08 14:08:11,183 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-08 14:08:11,183 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {277#true} is VALID [2022-04-08 14:08:11,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 14:08:11,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 14:08:11,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 14:08:11,184 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#true} {277#true} #61#return; {277#true} is VALID [2022-04-08 14:08:11,184 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-08 14:08:11,184 INFO L272 TraceCheckUtils]: 12: Hoare triple {277#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {277#true} is VALID [2022-04-08 14:08:11,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 14:08:11,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 14:08:11,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 14:08:11,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {277#true} {277#true} #63#return; {277#true} is VALID [2022-04-08 14:08:11,185 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-08 14:08:11,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 14:08:11,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 14:08:11,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 14:08:11,186 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {277#true} {277#true} #65#return; {277#true} is VALID [2022-04-08 14:08:11,193 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-08 14:08:11,193 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-08 14:08:11,194 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-08 14:08:11,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:11,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {278#false} is VALID [2022-04-08 14:08:11,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-04-08 14:08:11,196 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-08 14:08:11,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:08:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317817491] [2022-04-08 14:08:11,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:11,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852804851] [2022-04-08 14:08:11,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852804851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:11,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:11,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:08:11,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:11,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1372632294] [2022-04-08 14:08:11,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1372632294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:11,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:11,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:08:11,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278714386] [2022-04-08 14:08:11,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:11,200 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-08 14:08:11,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:11,200 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-08 14:08:11,219 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-08 14:08:11,219 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:08:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:08:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:08:11,221 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-08 14:08:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:11,407 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 14:08:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:08:11,408 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-08 14:08:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:11,408 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-08 14:08:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 14:08:11,411 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-08 14:08:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 14:08:11,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-08 14:08:11,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:11,460 INFO L225 Difference]: With dead ends: 39 [2022-04-08 14:08:11,460 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 14:08:11,460 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-08 14:08:11,461 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-08 14:08:11,462 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-08 14:08:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 14:08:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-08 14:08:11,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:11,473 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-08 14:08:11,473 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-08 14:08:11,473 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-08 14:08:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:11,476 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 14:08:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 14:08:11,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:11,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:11,477 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-08 14:08:11,477 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-08 14:08:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:11,480 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 14:08:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 14:08:11,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:11,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:11,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:11,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:11,481 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-08 14:08:11,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 14:08:11,483 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-08 14:08:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:11,483 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 14:08:11,484 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-08 14:08:11,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 14:08:11,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 14:08:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:08:11,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:11,522 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-08 14:08:11,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:08:11,749 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:11,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:11,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-08 14:08:11,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:11,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961362439] [2022-04-08 14:08:11,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:08:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 2 times [2022-04-08 14:08:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:11,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37486517] [2022-04-08 14:08:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:11,777 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:11,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139517184] [2022-04-08 14:08:11,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:08:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:11,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:11,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:08:11,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:08:11,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:08:11,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:11,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:08:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:11,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:11,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-08 14:08:11,954 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-08 14:08:11,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 14:08:11,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #71#return; {585#true} is VALID [2022-04-08 14:08:11,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret6 := main(); {585#true} is VALID [2022-04-08 14:08:11,955 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-08 14:08:11,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {585#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {585#true} is VALID [2022-04-08 14:08:11,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 14:08:11,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 14:08:11,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 14:08:11,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-08 14:08:11,956 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-08 14:08:11,956 INFO L272 TraceCheckUtils]: 12: Hoare triple {585#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {585#true} is VALID [2022-04-08 14:08:11,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 14:08:11,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 14:08:11,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 14:08:11,957 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {585#true} {585#true} #63#return; {585#true} is VALID [2022-04-08 14:08:11,957 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-08 14:08:11,959 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-08 14:08:11,960 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-08 14:08:11,960 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-08 14:08:11,961 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-08 14:08:11,961 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-08 14:08:11,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {659#(<= 1 main_~y~0)} assume !false; {659#(<= 1 main_~y~0)} is VALID [2022-04-08 14:08:11,962 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-08 14:08:11,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 14:08:11,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 14:08:11,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 14:08:11,963 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {585#true} {659#(<= 1 main_~y~0)} #67#return; {659#(<= 1 main_~y~0)} is VALID [2022-04-08 14:08:11,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {659#(<= 1 main_~y~0)} assume !(0 != ~y~0); {586#false} is VALID [2022-04-08 14:08:11,964 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-08 14:08:11,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-08 14:08:11,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-08 14:08:11,964 INFO L290 TraceCheckUtils]: 33: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-08 14:08:11,964 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-08 14:08:11,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:08:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37486517] [2022-04-08 14:08:11,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139517184] [2022-04-08 14:08:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139517184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:11,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:11,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:08:11,966 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:11,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961362439] [2022-04-08 14:08:11,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961362439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:11,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:11,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:08:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425765073] [2022-04-08 14:08:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:11,967 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-08 14:08:11,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:11,967 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-08 14:08:11,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:11,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:08:11,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:08:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:08:11,998 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-08 14:08:12,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:12,205 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 14:08:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:08:12,206 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-08 14:08:12,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:12,206 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-08 14:08:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 14:08:12,209 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-08 14:08:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 14:08:12,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-08 14:08:12,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:12,249 INFO L225 Difference]: With dead ends: 43 [2022-04-08 14:08:12,249 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:08:12,249 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-08 14:08:12,251 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:08:12,251 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.1s Time] [2022-04-08 14:08:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:08:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-08 14:08:12,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:12,270 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-08 14:08:12,271 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-08 14:08:12,271 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-08 14:08:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:12,273 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:08:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 14:08:12,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:12,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:12,274 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-08 14:08:12,274 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-08 14:08:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:12,276 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:08:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 14:08:12,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:12,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:12,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:12,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:12,277 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-08 14:08:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 14:08:12,279 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-08 14:08:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:12,279 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 14:08:12,279 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-08 14:08:12,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 14:08:12,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 14:08:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:08:12,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:12,323 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-08 14:08:12,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:08:12,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:08:12,544 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-08 14:08:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798675159] [2022-04-08 14:08:12,545 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:08:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 2 times [2022-04-08 14:08:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:12,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917354986] [2022-04-08 14:08:12,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:12,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:12,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498355358] [2022-04-08 14:08:12,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:08:12,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:12,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:12,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:08:12,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 14:08:12,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:08:12,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:12,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 14:08:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:12,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:14,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-08 14:08:14,948 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-08 14:08:14,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:08:14,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-08 14:08:14,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-08 14:08:14,949 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-08 14:08:14,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 14:08:14,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:08:14,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:08:14,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:08:14,952 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-08 14:08:14,952 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-08 14:08:14,954 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 14:08:14,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:08:14,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:08:14,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:08:14,964 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-08 14:08:14,964 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-08 14:08:14,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:08:14,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:08:14,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:08:14,964 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-08 14:08:14,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:08:14,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:08:14,968 INFO L272 TraceCheckUtils]: 24: Hoare triple {993#(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)); {922#true} is VALID [2022-04-08 14:08:14,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {1003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:14,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:14,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:14,970 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {1014#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:08:14,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {1014#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1018#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:08:14,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {1018#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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; {1022#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 14:08:14,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {1022#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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); {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:08:14,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:08:15,763 INFO L272 TraceCheckUtils]: 33: Hoare triple {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~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)); {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:08:15,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:15,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-08 14:08:15,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-08 14:08:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:08:15,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:09:09,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-08 14:09:09,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-08 14:09:09,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:09,242 INFO L272 TraceCheckUtils]: 33: Hoare triple {1053#(= (+ 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)); {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:09:09,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:09,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(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); {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:09,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {1064#(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; {1060#(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-08 14:09:09,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {1064#(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); {1064#(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-08 14:09:10,485 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} {922#true} #67#return; {1064#(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-08 14:09:10,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:09:10,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {1080#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:09:10,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {1080#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:09:10,487 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {922#true} is VALID [2022-04-08 14:09:10,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#true} assume !false; {922#true} is VALID [2022-04-08 14:09:10,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#true} is VALID [2022-04-08 14:09:10,487 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-08 14:09:10,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:09:10,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:09:10,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:09:10,488 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-08 14:09:10,488 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-08 14:09:10,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:09:10,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:09:10,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:09:10,488 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 14:09:10,488 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-08 14:09:10,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-08 14:09:10,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:09:10,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 14:09:10,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 14:09:10,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 14:09:10,489 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-08 14:09:10,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-08 14:09:10,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-08 14:09:10,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 14:09:10,489 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-08 14:09:10,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-08 14:09:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:09:10,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:09:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917354986] [2022-04-08 14:09:10,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:09:10,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498355358] [2022-04-08 14:09:10,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498355358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:09:10,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:09:10,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-08 14:09:10,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:09:10,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798675159] [2022-04-08 14:09:10,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798675159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:09:10,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:09:10,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:09:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362028435] [2022-04-08 14:09:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:09:10,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 14:09:10,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:09:10,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:09:10,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:10,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:09:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:09:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:09:10,830 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:09:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:16,550 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-08 14:09:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:09:16,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 14:09:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:09:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:09:16,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-08 14:09:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:09:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-08 14:09:16,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-08 14:09:16,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:16,737 INFO L225 Difference]: With dead ends: 49 [2022-04-08 14:09:16,737 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:09:16,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:09:16,741 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:09:16,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 149 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 14:09:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:09:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-04-08 14:09:16,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:09:16,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:16,777 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:16,778 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:16,780 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 14:09:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 14:09:16,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:16,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:16,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-08 14:09:16,781 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-08 14:09:16,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:16,783 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 14:09:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 14:09:16,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:16,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:16,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:09:16,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:09:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 14:09:16,786 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 37 [2022-04-08 14:09:16,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:09:16,786 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 14:09:16,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 14:09:16,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 14:09:17,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 14:09:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 14:09:17,461 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:09:17,462 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-08 14:09:17,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 14:09:17,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:17,667 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:09:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:09:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-08 14:09:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [720290138] [2022-04-08 14:09:17,668 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:09:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 2 times [2022-04-08 14:09:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:09:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367105569] [2022-04-08 14:09:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:09:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:09:17,683 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:09:17,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042603963] [2022-04-08 14:09:17,683 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:09:17,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:17,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:09:17,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:09:17,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:09:17,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:09:17,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:09:17,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:09:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:09:17,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:09:19,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#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); {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #71#return; {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret6 := main(); {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#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; {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {1438#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:19,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1438#true} {1438#true} #61#return; {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1438#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L272 TraceCheckUtils]: 12: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:19,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:19,713 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1438#true} {1438#true} #63#return; {1438#true} is VALID [2022-04-08 14:09:19,713 INFO L272 TraceCheckUtils]: 17: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:19,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {1438#true} ~cond := #in~cond; {1497#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:09:19,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {1497#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:19,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:19,715 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} {1438#true} #65#return; {1508#(<= 1 main_~b~0)} is VALID [2022-04-08 14:09:19,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {1508#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1512#(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-08 14:09:19,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1512#(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-08 14:09:19,716 INFO L272 TraceCheckUtils]: 24: Hoare triple {1512#(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)); {1438#true} is VALID [2022-04-08 14:09:19,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:19,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:19,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:19,717 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1438#true} {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1512#(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-08 14:09:19,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {1512#(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); {1512#(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-08 14:09:19,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {1512#(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)); {1537#(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-08 14:09:19,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {1537#(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); {1541#(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-08 14:09:19,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(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; {1541#(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-08 14:09:19,723 INFO L272 TraceCheckUtils]: 33: Hoare triple {1541#(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)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:09:19,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:19,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1439#false} is VALID [2022-04-08 14:09:19,724 INFO L290 TraceCheckUtils]: 36: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2022-04-08 14:09:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:09:19,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:09:54,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2022-04-08 14:09:54,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1439#false} is VALID [2022-04-08 14:09:54,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:54,978 INFO L272 TraceCheckUtils]: 33: Hoare triple {1568#(= (+ 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)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:09:54,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:54,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {1575#(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); {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:54,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {1579#(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)); {1575#(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-08 14:09:54,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {1579#(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); {1579#(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-08 14:09:54,986 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1438#true} {1579#(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; {1579#(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-08 14:09:54,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:54,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:54,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:54,987 INFO L272 TraceCheckUtils]: 24: Hoare triple {1579#(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)); {1438#true} is VALID [2022-04-08 14:09:54,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {1579#(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; {1579#(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-08 14:09:54,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {1604#(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; {1579#(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-08 14:09:54,991 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} {1438#true} #65#return; {1604#(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-08 14:09:54,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:54,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:54,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {1438#true} ~cond := #in~cond; {1617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 14:09:54,993 INFO L272 TraceCheckUtils]: 17: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:54,993 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1438#true} {1438#true} #63#return; {1438#true} is VALID [2022-04-08 14:09:54,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:54,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:54,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:54,993 INFO L272 TraceCheckUtils]: 12: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1438#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1438#true} {1438#true} #61#return; {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {1438#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#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; {1438#true} is VALID [2022-04-08 14:09:54,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret6 := main(); {1438#true} is VALID [2022-04-08 14:09:54,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #71#return; {1438#true} is VALID [2022-04-08 14:09:54,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 14:09:54,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#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); {1438#true} is VALID [2022-04-08 14:09:54,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2022-04-08 14:09:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:09:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:09:54,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367105569] [2022-04-08 14:09:54,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:09:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042603963] [2022-04-08 14:09:54,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042603963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:09:54,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:09:54,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-08 14:09:54,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:09:54,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [720290138] [2022-04-08 14:09:54,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [720290138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:09:54,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:09:54,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:09:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985401273] [2022-04-08 14:09:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:09:54,997 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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 37 [2022-04-08 14:09:54,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:09:54,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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-08 14:09:55,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:55,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:09:55,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:55,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:09:55,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:09:55,028 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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-08 14:09:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:55,614 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 14:09:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:09:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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 37 [2022-04-08 14:09:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:09:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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-08 14:09:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 14:09:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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-08 14:09:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 14:09:55,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-08 14:09:55,669 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-08 14:09:55,670 INFO L225 Difference]: With dead ends: 59 [2022-04-08 14:09:55,670 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:09:55,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:09:55,671 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:09:55,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 129 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 14:09:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:09:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-08 14:09:55,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:09:55,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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-08 14:09:55,717 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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-08 14:09:55,718 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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-08 14:09:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:55,722 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-08 14:09:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-08 14:09:55,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:55,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:55,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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 52 states. [2022-04-08 14:09:55,723 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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 52 states. [2022-04-08 14:09:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:55,729 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-08 14:09:55,729 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-08 14:09:55,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:55,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:55,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:09:55,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:09:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 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-08 14:09:55,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 14:09:55,733 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2022-04-08 14:09:55,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:09:55,733 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 14:09:55,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 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-08 14:09:55,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 14:09:56,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 14:09:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 14:09:56,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:09:56,331 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-08 14:09:56,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 14:09:56,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:56,532 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:09:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:09:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-08 14:09:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:56,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870199606] [2022-04-08 14:09:56,533 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:09:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 2 times [2022-04-08 14:09:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:09:56,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640488077] [2022-04-08 14:09:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:09:56,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:09:56,559 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:09:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451731365] [2022-04-08 14:09:56,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:09:56,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:56,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:09:56,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:09:56,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 14:09:56,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:09:56,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:09:56,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 14:09:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:09:56,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:10:03,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-08 14:10:03,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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); {2000#true} is VALID [2022-04-08 14:10:03,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2000#true} {2000#true} #71#return; {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {2000#true} call #t~ret6 := main(); {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {2000#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; {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {2000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:03,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2000#true} {2000#true} #61#return; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L272 TraceCheckUtils]: 12: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2000#true} {2000#true} #63#return; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:03,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2000#true} {2000#true} #65#return; {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {2000#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L272 TraceCheckUtils]: 24: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:03,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2000#true} {2000#true} #67#return; {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} assume !!(0 != ~y~0); {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#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; {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#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); {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L272 TraceCheckUtils]: 33: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:03,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {2000#true} ~cond := #in~cond; {2107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:03,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {2107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:03,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:05,880 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} {2000#true} #67#return; {2118#(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-08 14:10:05,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {2118#(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); {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:10:05,908 INFO L272 TraceCheckUtils]: 39: Hoare triple {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:10:05,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:05,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {2130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2001#false} is VALID [2022-04-08 14:10:05,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-08 14:10:05,909 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-08 14:10:05,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:10:16,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-08 14:10:16,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {2130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2001#false} is VALID [2022-04-08 14:10:16,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:16,208 INFO L272 TraceCheckUtils]: 39: Hoare triple {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:10:16,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {2149#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:10:16,209 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} {2000#true} #67#return; {2149#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:10:16,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:16,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {2162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:16,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {2000#true} ~cond := #in~cond; {2162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:10:16,210 INFO L272 TraceCheckUtils]: 33: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:16,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 14:10:16,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#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); {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#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; {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} assume !!(0 != ~y~0); {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2000#true} {2000#true} #67#return; {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L272 TraceCheckUtils]: 24: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 14:10:16,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {2000#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2000#true} is VALID [2022-04-08 14:10:16,212 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2000#true} {2000#true} #65#return; {2000#true} is VALID [2022-04-08 14:10:16,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:16,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:16,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:16,213 INFO L272 TraceCheckUtils]: 17: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2000#true} {2000#true} #63#return; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2000#true} {2000#true} #61#return; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:16,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {2000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {2000#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; {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {2000#true} call #t~ret6 := main(); {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2000#true} {2000#true} #71#return; {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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); {2000#true} is VALID [2022-04-08 14:10:16,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-08 14:10:16,216 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-08 14:10:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:10:16,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640488077] [2022-04-08 14:10:16,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:10:16,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451731365] [2022-04-08 14:10:16,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451731365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:10:16,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:10:16,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:10:16,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:10:16,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870199606] [2022-04-08 14:10:16,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870199606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:10:16,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:10:16,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:10:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287231610] [2022-04-08 14:10:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:10:16,218 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-08 14:10:16,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:10:16,219 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-08 14:10:18,428 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-08 14:10:18,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:10:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:18,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:10:18,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:10:18,429 INFO L87 Difference]: Start difference. First operand 50 states and 55 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-08 14:10:20,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:10:20,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:20,849 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-08 14:10:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:10:20,850 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-08 14:10:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:10:20,850 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-08 14:10:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 14:10:20,851 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-08 14:10:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 14:10:20,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-08 14:10:22,885 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-08 14:10:22,887 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:10:22,887 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 14:10:22,888 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-08 14:10:22,889 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:10:22,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 14:10:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 14:10:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-08 14:10:22,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:10:22,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:22,924 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:22,924 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:22,926 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 14:10:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 14:10:22,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:22,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:22,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 14:10:22,926 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 14:10:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:22,932 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 14:10:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 14:10:22,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:22,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:22,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:10:22,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:10:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-08 14:10:22,934 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 43 [2022-04-08 14:10:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:10:22,934 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-08 14:10:22,934 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-08 14:10:22,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-08 14:10:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 14:10:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-08 14:10:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 14:10:29,145 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:10:29,145 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-08 14:10:29,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 14:10:29,345 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:10:29,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:10:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:10:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1025268728, now seen corresponding path program 3 times [2022-04-08 14:10:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:29,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352574402] [2022-04-08 14:10:29,346 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:10:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1025268728, now seen corresponding path program 4 times [2022-04-08 14:10:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:10:29,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859029248] [2022-04-08 14:10:29,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:10:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:10:29,364 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:10:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056484232] [2022-04-08 14:10:29,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:10:29,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:10:29,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:10:29,372 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:10:29,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 14:10:29,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:10:29,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:10:29,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 14:10:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:10:29,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:10:52,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2567#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); {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #71#return; {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret6 := main(); {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {2567#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; {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {2567#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:10:52,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2567#true} {2567#true} #61#return; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {2567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L272 TraceCheckUtils]: 12: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:10:52,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:10:52,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:10:52,614 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2567#true} {2567#true} #65#return; {2567#true} is VALID [2022-04-08 14:10:52,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {2567#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:52,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:52,615 INFO L272 TraceCheckUtils]: 24: Hoare triple {2638#(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)); {2567#true} is VALID [2022-04-08 14:10:52,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {2567#true} ~cond := #in~cond; {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:52,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:52,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:52,616 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:52,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2662#(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-08 14:10:52,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {2662#(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; {2666#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:52,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {2666#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~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); {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:52,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:52,620 INFO L272 TraceCheckUtils]: 33: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 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)); {2567#true} is VALID [2022-04-08 14:10:52,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {2567#true} ~cond := #in~cond; {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:52,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:52,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:52,631 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:52,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {2692#(and (not (= main_~y~0 0)) (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:52,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {2692#(and (not (= main_~y~0 0)) (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2696#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 14:10:52,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {2696#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 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); {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} is VALID [2022-04-08 14:10:52,636 INFO L290 TraceCheckUtils]: 41: Hoare triple {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} assume !false; {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} is VALID [2022-04-08 14:10:53,373 INFO L272 TraceCheckUtils]: 42: Hoare triple {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:10:53,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:53,374 INFO L290 TraceCheckUtils]: 44: Hoare triple {2711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2022-04-08 14:10:53,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2022-04-08 14:10:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:10:53,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:12:02,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2022-04-08 14:12:02,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {2711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2022-04-08 14:12:02,750 INFO L290 TraceCheckUtils]: 43: Hoare triple {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:12:02,750 INFO L272 TraceCheckUtils]: 42: Hoare triple {2727#(= (+ 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)); {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:12:02,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:12:02,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {2734#(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); {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:12:02,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {2738#(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; {2734#(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-08 14:12:02,759 INFO L290 TraceCheckUtils]: 38: Hoare triple {2738#(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); {2738#(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-08 14:12:03,120 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2567#true} #67#return; {2738#(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-08 14:12:03,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:12:03,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {2754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {2567#true} ~cond := #in~cond; {2754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:12:03,122 INFO L272 TraceCheckUtils]: 33: Hoare triple {2567#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {2567#true} assume !false; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {2567#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); {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {2567#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; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {2567#true} assume !!(0 != ~y~0); {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2567#true} {2567#true} #67#return; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L272 TraceCheckUtils]: 24: Hoare triple {2567#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {2567#true} assume !false; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {2567#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2567#true} is VALID [2022-04-08 14:12:03,122 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2567#true} {2567#true} #65#return; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L272 TraceCheckUtils]: 17: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L272 TraceCheckUtils]: 12: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {2567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2567#true} {2567#true} #61#return; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 14:12:03,123 INFO L272 TraceCheckUtils]: 6: Hoare triple {2567#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {2567#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; {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret6 := main(); {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #71#return; {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2567#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); {2567#true} is VALID [2022-04-08 14:12:03,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2022-04-08 14:12:03,124 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-08 14:12:03,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:12:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859029248] [2022-04-08 14:12:03,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:12:03,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056484232] [2022-04-08 14:12:03,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056484232] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:12:03,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:12:03,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 14:12:03,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:12:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352574402] [2022-04-08 14:12:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352574402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:12:03,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:12:03,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:12:03,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983190791] [2022-04-08 14:12:03,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:12:03,125 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:03,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:12:03,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:05,161 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-08 14:12:05,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:12:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:12:05,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:12:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=218, Unknown=3, NotChecked=0, Total=272 [2022-04-08 14:12:05,162 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:10,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:13,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:15,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:20,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:23,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:26,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:31,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:34,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:12:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:12:39,481 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-08 14:12:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:12:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:12:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-08 14:12:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 57 transitions. [2022-04-08 14:12:39,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 57 transitions. [2022-04-08 14:12:40,248 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-08 14:12:40,249 INFO L225 Difference]: With dead ends: 63 [2022-04-08 14:12:40,249 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:12:40,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=64, Invalid=275, Unknown=3, NotChecked=0, Total=342 [2022-04-08 14:12:40,250 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:12:40,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 183 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2022-04-08 14:12:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:12:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-04-08 14:12:40,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:12:40,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 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-08 14:12:40,315 INFO L74 IsIncluded]: Start isIncluded. First operand 61 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-08 14:12:40,315 INFO L87 Difference]: Start difference. First operand 61 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-08 14:12:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:12:40,317 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-08 14:12:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-04-08 14:12:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:12:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:12:40,319 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 61 states. [2022-04-08 14:12:40,319 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 61 states. [2022-04-08 14:12:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:12:40,322 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-08 14:12:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-04-08 14:12:40,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:12:40,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:12:40,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:12:40,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:12:40,322 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-08 14:12:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 14:12:40,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2022-04-08 14:12:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:12:40,326 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 14:12:40,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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-08 14:12:40,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 14:12:50,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 50 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:12:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 14:12:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 14:12:50,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:12:50,753 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-08 14:12:50,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 14:12:50,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:12:50,963 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:12:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:12:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-08 14:12:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:12:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1697243574] [2022-04-08 14:12:50,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:12:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 2 times [2022-04-08 14:12:50,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:12:50,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021462766] [2022-04-08 14:12:50,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:12:50,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:12:50,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:12:50,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590630041] [2022-04-08 14:12:50,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:12:50,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:12:50,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:12:50,979 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:12:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 14:12:51,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:12:51,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:12:51,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:12:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:12:51,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:12:53,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {3211#true} call ULTIMATE.init(); {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#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); {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3211#true} {3211#true} #71#return; {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {3211#true} call #t~ret6 := main(); {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {3211#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; {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L272 TraceCheckUtils]: 6: Hoare triple {3211#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:12:53,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {3211#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L272 TraceCheckUtils]: 12: Hoare triple {3211#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3211#true} {3211#true} #63#return; {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L272 TraceCheckUtils]: 17: Hoare triple {3211#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:12:53,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:12:53,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:12:53,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:12:53,544 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3211#true} {3211#true} #65#return; {3211#true} is VALID [2022-04-08 14:12:53,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {3211#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3282#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 14:12:53,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {3282#(= main_~b~0 main_~y~0)} assume !false; {3282#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 14:12:53,545 INFO L272 TraceCheckUtils]: 24: Hoare triple {3282#(= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:12:53,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:12:53,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:12:53,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:12:53,546 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3211#true} {3282#(= main_~b~0 main_~y~0)} #67#return; {3282#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 14:12:53,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {3282#(= main_~b~0 main_~y~0)} assume !!(0 != ~y~0); {3304#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 14:12:53,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {3304#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~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; {3308#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:12:53,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {3308#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 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); {3312#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:12:53,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {3312#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3312#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:12:53,548 INFO L272 TraceCheckUtils]: 33: Hoare triple {3312#(and (<= 1 (mod main_~b~0 2)) (<= 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)); {3211#true} is VALID [2022-04-08 14:12:53,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {3211#true} ~cond := #in~cond; {3322#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:12:53,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {3322#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:12:53,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:12:53,550 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} {3312#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3333#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:12:53,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {3333#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3333#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:12:53,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {3333#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)); {3340#(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)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:12:53,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {3340#(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)) (<= 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); {3344#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:12:53,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {3344#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} assume !false; {3344#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:12:54,266 INFO L272 TraceCheckUtils]: 42: Hoare triple {3344#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 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)); {3351#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:12:54,266 INFO L290 TraceCheckUtils]: 43: Hoare triple {3351#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3355#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:12:54,267 INFO L290 TraceCheckUtils]: 44: Hoare triple {3355#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3212#false} is VALID [2022-04-08 14:12:54,267 INFO L290 TraceCheckUtils]: 45: Hoare triple {3212#false} assume !false; {3212#false} is VALID [2022-04-08 14:12:54,267 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-08 14:12:54,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:13:28,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {3212#false} assume !false; {3212#false} is VALID [2022-04-08 14:13:28,536 INFO L290 TraceCheckUtils]: 44: Hoare triple {3355#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3212#false} is VALID [2022-04-08 14:13:28,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {3351#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3355#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:13:28,538 INFO L272 TraceCheckUtils]: 42: Hoare triple {3371#(= (+ 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)); {3351#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:13:28,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {3371#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3371#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:13:28,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {3378#(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); {3371#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:13:28,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {3382#(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)); {3378#(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-08 14:13:28,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {3382#(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); {3382#(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-08 14:13:28,549 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} {3389#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3382#(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-08 14:13:28,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:13:28,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {3399#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3326#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:13:28,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {3211#true} ~cond := #in~cond; {3399#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:13:28,550 INFO L272 TraceCheckUtils]: 33: Hoare triple {3389#(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)); {3211#true} is VALID [2022-04-08 14:13:28,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {3389#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3389#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 14:13:28,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {3409#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (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); {3389#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 14:13:28,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {3211#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; {3409#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {3211#true} assume !!(0 != ~y~0); {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3211#true} {3211#true} #67#return; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L272 TraceCheckUtils]: 24: Hoare triple {3211#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {3211#true} assume !false; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {3211#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3211#true} {3211#true} #65#return; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:13:28,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L272 TraceCheckUtils]: 17: Hoare triple {3211#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3211#true} {3211#true} #63#return; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L272 TraceCheckUtils]: 12: Hoare triple {3211#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {3211#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3211#true} {3211#true} #61#return; {3211#true} is VALID [2022-04-08 14:13:28,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {3211#true} assume !(0 == ~cond); {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {3211#true} ~cond := #in~cond; {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {3211#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {3211#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; {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {3211#true} call #t~ret6 := main(); {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3211#true} {3211#true} #71#return; {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {3211#true} assume true; {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {3211#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); {3211#true} is VALID [2022-04-08 14:13:28,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {3211#true} call ULTIMATE.init(); {3211#true} is VALID [2022-04-08 14:13:28,558 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-08 14:13:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:13:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021462766] [2022-04-08 14:13:28,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:13:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590630041] [2022-04-08 14:13:28,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590630041] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:13:28,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:13:28,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-08 14:13:28,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:13:28,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1697243574] [2022-04-08 14:13:28,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1697243574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:13:28,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:13:28,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:13:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709421111] [2022-04-08 14:13:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:13:28,559 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-08 14:13:28,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:13:28,560 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-08 14:13:29,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:13:29,360 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:13:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:13:29,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:13:29,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:13:29,361 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-08 14:13:35,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:13:40,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:13:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:45,827 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-08 14:13:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:13:45,827 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-08 14:13:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:13:45,827 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-08 14:13:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 14:13:45,829 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-08 14:13:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 14:13:45,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-08 14:13:48,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:13:48,348 INFO L225 Difference]: With dead ends: 63 [2022-04-08 14:13:48,348 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 14:13:48,348 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:13:48,349 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:13:48,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 203 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-08 14:13:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 14:13:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-04-08 14:13:48,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:13:48,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 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-08 14:13:48,396 INFO L74 IsIncluded]: Start isIncluded. First operand 61 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-08 14:13:48,396 INFO L87 Difference]: Start difference. First operand 61 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-08 14:13:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:48,398 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-08 14:13:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-04-08 14:13:48,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:13:48,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:13:48,399 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 61 states. [2022-04-08 14:13:48,399 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 61 states. [2022-04-08 14:13:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:48,401 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-04-08 14:13:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-04-08 14:13:48,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:13:48,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:13:48,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:13:48,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:13:48,401 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-08 14:13:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 14:13:48,403 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2022-04-08 14:13:48,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:13:48,403 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 14:13:48,404 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-08 14:13:48,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 14:13:59,218 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-08 14:13:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 14:13:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 14:13:59,218 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:13:59,219 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-08 14:13:59,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 14:13:59,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:13:59,427 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:13:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:13:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 3 times [2022-04-08 14:13:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:13:59,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228804282] [2022-04-08 14:13:59,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:13:59,429 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 4 times [2022-04-08 14:13:59,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:13:59,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474767943] [2022-04-08 14:13:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:13:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:13:59,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:13:59,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049118974] [2022-04-08 14:13:59,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:13:59,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:13:59,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:13:59,443 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:13:59,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 14:13:59,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:13:59,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:13:59,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 14:13:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:13:59,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:14:01,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#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); {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #71#return; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret6 := main(); {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#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; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L272 TraceCheckUtils]: 6: Hoare triple {3857#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3857#true} {3857#true} #61#return; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {3857#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3857#true} is VALID [2022-04-08 14:14:01,705 INFO L272 TraceCheckUtils]: 12: Hoare triple {3857#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3857#true} {3857#true} #63#return; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L272 TraceCheckUtils]: 17: Hoare triple {3857#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3857#true} {3857#true} #65#return; {3857#true} is VALID [2022-04-08 14:14:01,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {3857#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:01,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:01,707 INFO L272 TraceCheckUtils]: 24: Hoare triple {3928#(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)); {3857#true} is VALID [2022-04-08 14:14:01,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:01,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:01,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:01,708 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3857#true} {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:01,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3928#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:01,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {3928#(and (= main_~z~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)); {3953#(and (= main_~z~0 0) (or (not (= (mod main_~y~0 2) 1)) (< main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:01,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {3953#(and (= main_~z~0 0) (or (not (= (mod main_~y~0 2) 1)) (< main_~y~0 0)) (= main_~b~0 main_~y~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); {3957#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 14:14:01,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {3957#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} assume !false; {3957#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 14:14:01,711 INFO L272 TraceCheckUtils]: 33: Hoare triple {3957#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:01,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {3857#true} ~cond := #in~cond; {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:14:01,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {3967#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:01,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:01,713 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {3957#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} #67#return; {3978#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 14:14:01,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {3978#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} assume !!(0 != ~y~0); {3982#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 14:14:01,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {3982#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~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; {3986#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 14:14:01,720 INFO L290 TraceCheckUtils]: 40: Hoare triple {3986#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 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); {3990#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (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-08 14:14:01,721 INFO L290 TraceCheckUtils]: 41: Hoare triple {3990#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !false; {3990#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (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-08 14:14:01,920 INFO L272 TraceCheckUtils]: 42: Hoare triple {3990#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (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)); {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:14:01,921 INFO L290 TraceCheckUtils]: 43: Hoare triple {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:14:01,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {4001#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3858#false} is VALID [2022-04-08 14:14:01,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-08 14:14:01,921 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-08 14:14:01,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:14:50,696 INFO L290 TraceCheckUtils]: 45: Hoare triple {3858#false} assume !false; {3858#false} is VALID [2022-04-08 14:14:50,697 INFO L290 TraceCheckUtils]: 44: Hoare triple {4001#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3858#false} is VALID [2022-04-08 14:14:50,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4001#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:14:50,698 INFO L272 TraceCheckUtils]: 42: Hoare triple {4017#(= (+ 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)); {3997#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:14:50,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:14:50,702 INFO L290 TraceCheckUtils]: 40: Hoare triple {4024#(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); {4017#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:14:50,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {4028#(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; {4024#(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-08 14:14:50,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {4028#(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); {4028#(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-08 14:14:52,713 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} {3857#true} #67#return; {4028#(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-08 14:14:52,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {4044#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3971#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {3857#true} ~cond := #in~cond; {4044#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:14:52,714 INFO L272 TraceCheckUtils]: 33: Hoare triple {3857#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {3857#true} assume !false; {3857#true} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {3857#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); {3857#true} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {3857#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3857#true} is VALID [2022-04-08 14:14:52,714 INFO L290 TraceCheckUtils]: 29: Hoare triple {3857#true} assume !!(0 != ~y~0); {3857#true} is VALID [2022-04-08 14:14:52,714 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3857#true} {3857#true} #67#return; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L272 TraceCheckUtils]: 24: Hoare triple {3857#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {3857#true} assume !false; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {3857#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3857#true} {3857#true} #65#return; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L272 TraceCheckUtils]: 17: Hoare triple {3857#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3857#true} {3857#true} #63#return; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L272 TraceCheckUtils]: 12: Hoare triple {3857#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:52,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {3857#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3857#true} {3857#true} #61#return; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#true} assume !(0 == ~cond); {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {3857#true} ~cond := #in~cond; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {3857#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {3857#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; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {3857#true} call #t~ret6 := main(); {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3857#true} {3857#true} #71#return; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {3857#true} assume true; {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {3857#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); {3857#true} is VALID [2022-04-08 14:14:52,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {3857#true} call ULTIMATE.init(); {3857#true} is VALID [2022-04-08 14:14:52,716 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-08 14:14:52,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:14:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474767943] [2022-04-08 14:14:52,717 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:14:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049118974] [2022-04-08 14:14:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049118974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:14:52,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:14:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 14:14:52,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:14:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228804282] [2022-04-08 14:14:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228804282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:14:52,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:14:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:14:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112755670] [2022-04-08 14:14:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:14:52,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 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-08 14:14:52,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:14:52,718 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), 11 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-08 14:14:53,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:14:53,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:14:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:14:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:14:53,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:14:53,338 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), 11 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-08 14:14:58,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:15:04,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:15:06,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:15:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:06,576 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-08 14:15:06,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:15:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 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-08 14:15:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:15:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 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-08 14:15:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 14:15:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 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-08 14:15:06,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 14:15:06,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-08 14:15:06,992 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-08 14:15:06,993 INFO L225 Difference]: With dead ends: 68 [2022-04-08 14:15:06,993 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 14:15:06,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:15:06,994 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-04-08 14:15:06,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2022-04-08 14:15:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 14:15:07,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-04-08 14:15:07,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:15:07,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:15:07,095 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:15:07,096 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:15:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:07,098 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-08 14:15:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-08 14:15:07,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:15:07,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:15:07,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-08 14:15:07,100 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 66 states. [2022-04-08 14:15:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:07,102 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-08 14:15:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-08 14:15:07,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:15:07,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:15:07,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:15:07,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:15:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:15:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-04-08 14:15:07,106 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 46 [2022-04-08 14:15:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:15:07,106 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-04-08 14:15:07,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 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-08 14:15:07,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 69 transitions. [2022-04-08 14:15:21,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 63 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 14:15:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-04-08 14:15:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 14:15:21,897 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:15:21,897 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-08 14:15:21,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 14:15:22,097 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-08 14:15:22,098 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:15:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:15:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 3 times [2022-04-08 14:15:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:15:22,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805896889] [2022-04-08 14:15:22,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:15:22,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 4 times [2022-04-08 14:15:22,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:15:22,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101326157] [2022-04-08 14:15:22,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:15:22,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:15:22,111 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:15:22,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [600995767] [2022-04-08 14:15:22,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:15:22,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:15:22,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:15:22,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:15:22,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 14:15:22,146 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:15:22,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:15:22,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 14:15:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:15:22,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:15:27,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {4545#true} call ULTIMATE.init(); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {4545#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); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4545#true} {4545#true} #71#return; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {4545#true} call #t~ret6 := main(); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {4545#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; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {4545#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4545#true} {4545#true} #61#return; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {4545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L272 TraceCheckUtils]: 12: Hoare triple {4545#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:15:27,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:15:27,210 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4545#true} {4545#true} #63#return; {4545#true} is VALID [2022-04-08 14:15:27,210 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:15:27,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#true} ~cond := #in~cond; {4604#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:15:27,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {4604#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4608#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:15:27,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {4608#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4608#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:15:27,211 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4608#(not (= |assume_abort_if_not_#in~cond| 0))} {4545#true} #65#return; {4615#(<= 1 main_~b~0)} is VALID [2022-04-08 14:15:27,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {4615#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4619#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:15:27,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {4619#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {4619#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:15:27,212 INFO L272 TraceCheckUtils]: 24: Hoare triple {4619#(and (= 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)); {4545#true} is VALID [2022-04-08 14:15:27,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {4545#true} ~cond := #in~cond; {4629#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:15:27,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {4629#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:15:27,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:15:27,213 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} {4619#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {4640#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:15:27,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {4640#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {4640#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:15:27,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {4640#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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)); {4647#(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 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:15:27,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {4647#(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 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); {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:15:27,215 INFO L290 TraceCheckUtils]: 32: Hoare triple {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !false; {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:15:27,215 INFO L272 TraceCheckUtils]: 33: Hoare triple {4651#(and (= 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) (= (+ 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)); {4545#true} is VALID [2022-04-08 14:15:27,216 INFO L290 TraceCheckUtils]: 34: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:15:27,216 INFO L290 TraceCheckUtils]: 35: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:15:27,216 INFO L290 TraceCheckUtils]: 36: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:15:27,216 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4545#true} {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} #67#return; {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:15:27,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !!(0 != ~y~0); {4651#(and (= 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) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:15:27,217 INFO L290 TraceCheckUtils]: 39: Hoare triple {4651#(and (= 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) (= (+ 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)); {4676#(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-08 14:15:27,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {4676#(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); {4680#(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-08 14:15:27,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {4680#(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; {4680#(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-08 14:15:27,221 INFO L272 TraceCheckUtils]: 42: Hoare triple {4680#(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)); {4687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:15:27,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {4687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:15:27,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4546#false} is VALID [2022-04-08 14:15:27,222 INFO L290 TraceCheckUtils]: 45: Hoare triple {4546#false} assume !false; {4546#false} is VALID [2022-04-08 14:15:27,222 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-08 14:15:27,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:00,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {4546#false} assume !false; {4546#false} is VALID [2022-04-08 14:16:00,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4546#false} is VALID [2022-04-08 14:16:00,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {4687#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4691#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:00,644 INFO L272 TraceCheckUtils]: 42: Hoare triple {4707#(= (+ 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)); {4687#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:00,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {4707#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4707#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:16:00,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {4714#(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); {4707#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:16:00,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {4718#(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)); {4714#(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-08 14:16:00,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {4718#(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); {4718#(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-08 14:16:00,652 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4545#true} {4718#(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; {4718#(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-08 14:16:00,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:16:00,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:16:00,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:16:00,652 INFO L272 TraceCheckUtils]: 33: Hoare triple {4718#(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)); {4545#true} is VALID [2022-04-08 14:16:00,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {4718#(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; {4718#(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-08 14:16:00,668 INFO L290 TraceCheckUtils]: 31: Hoare triple {4743#(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); {4718#(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-08 14:16:00,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {4747#(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)); {4743#(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-08 14:16:00,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {4747#(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 !!(0 != ~y~0); {4747#(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-08 14:16:00,675 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} {4754#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} #67#return; {4747#(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-08 14:16:00,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:16:00,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {4764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4633#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:16:00,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {4545#true} ~cond := #in~cond; {4764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:16:00,676 INFO L272 TraceCheckUtils]: 24: Hoare triple {4754#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:16:00,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {4754#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} assume !false; {4754#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} is VALID [2022-04-08 14:16:00,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {4774#(or (and (= (mod main_~b~0 2) 0) (= (mod (div main_~b~0 2) 2) 0)) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4754#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} is VALID [2022-04-08 14:16:00,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4608#(not (= |assume_abort_if_not_#in~cond| 0))} {4545#true} #65#return; {4774#(or (and (= (mod main_~b~0 2) 0) (= (mod (div main_~b~0 2) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:16:00,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {4608#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4608#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:16:00,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {4787#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4608#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:16:00,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {4545#true} ~cond := #in~cond; {4787#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 14:16:00,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {4545#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4545#true} {4545#true} #63#return; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {4545#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {4545#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4545#true} {4545#true} #61#return; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {4545#true} assume !(0 == ~cond); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {4545#true} ~cond := #in~cond; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {4545#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4545#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; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {4545#true} call #t~ret6 := main(); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4545#true} {4545#true} #71#return; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {4545#true} assume true; {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {4545#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); {4545#true} is VALID [2022-04-08 14:16:00,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {4545#true} call ULTIMATE.init(); {4545#true} is VALID [2022-04-08 14:16:00,681 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-08 14:16:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101326157] [2022-04-08 14:16:00,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:00,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600995767] [2022-04-08 14:16:00,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600995767] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:00,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 14:16:00,682 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:00,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805896889] [2022-04-08 14:16:00,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805896889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:00,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:00,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:16:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645763885] [2022-04-08 14:16:00,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:00,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:00,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:00,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:00,719 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:16:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:16:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:16:00,720 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:01,877 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-04-08 14:16:01,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:16:01,877 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:01,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-08 14:16:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:01,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-08 14:16:01,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-08 14:16:01,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:01,928 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:16:01,928 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:16:01,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-04-08 14:16:01,929 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:01,929 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 138 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:16:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:16:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 50. [2022-04-08 14:16:01,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:01,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 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-08 14:16:01,988 INFO L74 IsIncluded]: Start isIncluded. First operand 76 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-08 14:16:01,988 INFO L87 Difference]: Start difference. First operand 76 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-08 14:16:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:01,989 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-08 14:16:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-08 14:16:01,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:01,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:01,990 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 76 states. [2022-04-08 14:16:01,990 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 76 states. [2022-04-08 14:16:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:01,992 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-08 14:16:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-04-08 14:16:01,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:01,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:01,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:01,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:01,992 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-08 14:16:01,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 14:16:01,993 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2022-04-08 14:16:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:01,994 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 14:16:01,994 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 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-08 14:16:01,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 14:16:14,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 49 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:14,314 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 14:16:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:16:14,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:14,314 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:14,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:14,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 14:16:14,515 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:14,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1060406066, now seen corresponding path program 5 times [2022-04-08 14:16:14,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:14,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [524248307] [2022-04-08 14:16:14,515 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:16:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1060406066, now seen corresponding path program 6 times [2022-04-08 14:16:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103656305] [2022-04-08 14:16:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:14,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:14,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365374219] [2022-04-08 14:16:14,530 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:14,532 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:14,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 14:16:14,577 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 14:16:14,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 14:16:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:14,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:40,504 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 14:16:46,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-08 14:16:46,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #71#return; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret6 := main(); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {5258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {5258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L272 TraceCheckUtils]: 12: Hoare triple {5258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5258#true} {5258#true} #63#return; {5258#true} is VALID [2022-04-08 14:16:46,217 INFO L272 TraceCheckUtils]: 17: Hoare triple {5258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5258#true} {5258#true} #65#return; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {5258#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L272 TraceCheckUtils]: 24: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5258#true} {5258#true} #67#return; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {5258#true} assume !!(0 != ~y~0); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 32: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L272 TraceCheckUtils]: 33: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5258#true} {5258#true} #67#return; {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {5258#true} assume !!(0 != ~y~0); {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L272 TraceCheckUtils]: 42: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:16:46,219 INFO L290 TraceCheckUtils]: 43: Hoare triple {5258#true} ~cond := #in~cond; {5392#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:46,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {5392#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:16:46,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:16:46,221 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#true} #67#return; {5403#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:16:46,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {5403#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(0 != ~y~0); {5407#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:16:46,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {5407#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~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; {5411#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 14:16:46,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {5411#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~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); {5415#(and (exists ((aux_div_v_main_~y~0_56_28 Int) (aux_mod_v_main_~y~0_56_28 Int)) (and (= (+ (* (div (* (- 1) main_~x~0) (- 2)) aux_mod_v_main_~y~0_56_28) main_~z~0 (* (* (div (* (- 1) main_~x~0) (- 2)) aux_div_v_main_~y~0_56_28) 2)) (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0))) (<= 0 (+ (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28)) (<= 1 aux_mod_v_main_~y~0_56_28) (< aux_mod_v_main_~y~0_56_28 2) (= (div (+ (- 1) (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28) 2) main_~y~0))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:16:47,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {5415#(and (exists ((aux_div_v_main_~y~0_56_28 Int) (aux_mod_v_main_~y~0_56_28 Int)) (and (= (+ (* (div (* (- 1) main_~x~0) (- 2)) aux_mod_v_main_~y~0_56_28) main_~z~0 (* (* (div (* (- 1) main_~x~0) (- 2)) aux_div_v_main_~y~0_56_28) 2)) (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0))) (<= 0 (+ (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28)) (<= 1 aux_mod_v_main_~y~0_56_28) (< aux_mod_v_main_~y~0_56_28 2) (= (div (+ (- 1) (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28) 2) main_~y~0))) (= (mod main_~x~0 2) 0))} assume !false; {5419#(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-08 14:16:47,354 INFO L272 TraceCheckUtils]: 51: Hoare triple {5419#(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)); {5423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:16:47,354 INFO L290 TraceCheckUtils]: 52: Hoare triple {5423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:16:47,355 INFO L290 TraceCheckUtils]: 53: Hoare triple {5427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5259#false} is VALID [2022-04-08 14:16:47,355 INFO L290 TraceCheckUtils]: 54: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-08 14:16:47,355 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-08 14:16:47,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:18:00,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-08 14:18:00,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {5427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5259#false} is VALID [2022-04-08 14:18:00,781 INFO L290 TraceCheckUtils]: 52: Hoare triple {5423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:18:00,782 INFO L272 TraceCheckUtils]: 51: Hoare triple {5403#(= (+ 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)); {5423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:18:00,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {5403#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {5403#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:18:00,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {5449#(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); {5403#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:18:00,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {5453#(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; {5449#(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-08 14:18:00,789 INFO L290 TraceCheckUtils]: 47: Hoare triple {5453#(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); {5453#(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-08 14:18:01,265 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} {5258#true} #67#return; {5453#(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-08 14:18:01,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:18:01,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {5469#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5396#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {5258#true} ~cond := #in~cond; {5469#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:18:01,267 INFO L272 TraceCheckUtils]: 42: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {5258#true} assume !!(0 != ~y~0); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5258#true} {5258#true} #67#return; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L272 TraceCheckUtils]: 33: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:18:01,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {5258#true} assume !!(0 != ~y~0); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5258#true} {5258#true} #67#return; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L272 TraceCheckUtils]: 24: Hoare triple {5258#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {5258#true} assume !false; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {5258#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5258#true} {5258#true} #65#return; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L272 TraceCheckUtils]: 17: Hoare triple {5258#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5258#true} {5258#true} #63#return; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:18:01,268 INFO L272 TraceCheckUtils]: 12: Hoare triple {5258#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {5258#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {5258#true} assume !(0 == ~cond); {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {5258#true} ~cond := #in~cond; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {5258#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#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; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret6 := main(); {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #71#return; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#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); {5258#true} is VALID [2022-04-08 14:18:01,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-08 14:18:01,270 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-08 14:18:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:18:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103656305] [2022-04-08 14:18:01,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:18:01,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365374219] [2022-04-08 14:18:01,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365374219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:18:01,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:18:01,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-08 14:18:01,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:18:01,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [524248307] [2022-04-08 14:18:01,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [524248307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:18:01,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:18:01,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:18:01,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012600505] [2022-04-08 14:18:01,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:18:01,271 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 55 [2022-04-08 14:18:01,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:18:01,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-08 14:18:06,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:18:06,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:18:06,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:18:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:18:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=140, Unknown=2, NotChecked=0, Total=182 [2022-04-08 14:18:06,441 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-08 14:18:11,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:18:14,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:18:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:18:16,132 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-08 14:18:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:18:16,132 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 55 [2022-04-08 14:18:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:18:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-08 14:18:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-08 14:18:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-08 14:18:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-08 14:18:16,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2022-04-08 14:18:19,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:18:19,048 INFO L225 Difference]: With dead ends: 73 [2022-04-08 14:18:19,048 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 14:18:19,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=53, Invalid=185, Unknown=2, NotChecked=0, Total=240 [2022-04-08 14:18:19,049 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-04-08 14:18:19,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 18 Unchecked, 5.8s Time] [2022-04-08 14:18:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 14:18:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-04-08 14:18:19,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:18:19,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 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-08 14:18:19,109 INFO L74 IsIncluded]: Start isIncluded. First operand 71 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-08 14:18:19,109 INFO L87 Difference]: Start difference. First operand 71 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-08 14:18:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:18:19,111 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-08 14:18:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-08 14:18:19,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:18:19,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:18:19,111 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 71 states. [2022-04-08 14:18:19,112 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 71 states. [2022-04-08 14:18:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:18:19,113 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-08 14:18:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-08 14:18:19,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:18:19,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:18:19,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:18:19,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:18:19,114 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-08 14:18:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 14:18:19,115 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 55 [2022-04-08 14:18:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:18:19,115 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 14:18:19,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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-08 14:18:19,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 14:18:33,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 48 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-08 14:18:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 14:18:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:18:33,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:18:33,473 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-08 14:18:33,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 14:18:33,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 14:18:33,673 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:18:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:18:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 5 times [2022-04-08 14:18:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:18:33,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836436278] [2022-04-08 14:18:33,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:18:33,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 6 times [2022-04-08 14:18:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:18:33,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971117707] [2022-04-08 14:18:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:18:33,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:18:33,685 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:18:33,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931522907] [2022-04-08 14:18:33,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:18:33,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:18:33,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:18:33,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:18:33,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 14:18:33,738 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:18:33,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:18:33,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:18:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:18:33,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:19:01,764 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 14:19:05,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {5993#true} call ULTIMATE.init(); {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#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); {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5993#true} {5993#true} #71#return; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {5993#true} call #t~ret6 := main(); {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {5993#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; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L272 TraceCheckUtils]: 6: Hoare triple {5993#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5993#true} {5993#true} #61#return; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5993#true} is VALID [2022-04-08 14:19:05,286 INFO L272 TraceCheckUtils]: 12: Hoare triple {5993#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5993#true} {5993#true} #63#return; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L272 TraceCheckUtils]: 17: Hoare triple {5993#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5993#true} {5993#true} #65#return; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {5993#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {5993#true} assume !false; {5993#true} is VALID [2022-04-08 14:19:05,287 INFO L272 TraceCheckUtils]: 24: Hoare triple {5993#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5993#true} {5993#true} #67#return; {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {5993#true} assume !!(0 != ~y~0); {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {5993#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; {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {5993#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); {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {5993#true} assume !false; {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L272 TraceCheckUtils]: 33: Hoare triple {5993#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:05,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:05,289 INFO L290 TraceCheckUtils]: 36: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:05,289 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5993#true} {5993#true} #67#return; {5993#true} is VALID [2022-04-08 14:19:05,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {5993#true} assume !!(0 != ~y~0); {6112#(not (= main_~y~0 0))} is VALID [2022-04-08 14:19:05,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {6112#(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; {6116#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 14:19:05,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {6116#(< 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); {6116#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 14:19:05,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {6116#(< 0 (+ main_~y~0 1))} assume !false; {6116#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 14:19:05,298 INFO L272 TraceCheckUtils]: 42: Hoare triple {6116#(< 0 (+ main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:05,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {5993#true} ~cond := #in~cond; {6129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:19:05,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {6129#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:19:05,299 INFO L290 TraceCheckUtils]: 45: Hoare triple {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:19:05,299 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} {6116#(< 0 (+ main_~y~0 1))} #67#return; {6140#(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-08 14:19:05,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {6140#(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); {6140#(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-08 14:19:05,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {6140#(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)); {6147#(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-08 14:19:05,533 INFO L290 TraceCheckUtils]: 49: Hoare triple {6147#(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); {6151#(and (exists ((aux_div_v_main_~y~0_63_22 Int) (aux_mod_v_main_~y~0_63_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_63_22) (< 0 (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2) 1)) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)) 2)) (< aux_mod_v_main_~y~0_63_22 2) (not (= aux_mod_v_main_~y~0_63_22 1)))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:19:05,810 INFO L290 TraceCheckUtils]: 50: Hoare triple {6151#(and (exists ((aux_div_v_main_~y~0_63_22 Int) (aux_mod_v_main_~y~0_63_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_63_22) (< 0 (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2) 1)) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)) 2)) (< aux_mod_v_main_~y~0_63_22 2) (not (= aux_mod_v_main_~y~0_63_22 1)))) (= (mod main_~x~0 2) 0))} assume !false; {6155#(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-08 14:19:06,286 INFO L272 TraceCheckUtils]: 51: Hoare triple {6155#(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)); {6159#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:19:06,287 INFO L290 TraceCheckUtils]: 52: Hoare triple {6159#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6163#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:19:06,287 INFO L290 TraceCheckUtils]: 53: Hoare triple {6163#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5994#false} is VALID [2022-04-08 14:19:06,287 INFO L290 TraceCheckUtils]: 54: Hoare triple {5994#false} assume !false; {5994#false} is VALID [2022-04-08 14:19:06,288 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-08 14:19:06,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:19:37,441 INFO L290 TraceCheckUtils]: 54: Hoare triple {5994#false} assume !false; {5994#false} is VALID [2022-04-08 14:19:37,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {6163#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5994#false} is VALID [2022-04-08 14:19:37,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {6159#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6163#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:19:37,442 INFO L272 TraceCheckUtils]: 51: Hoare triple {6179#(= (+ 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)); {6159#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:19:37,443 INFO L290 TraceCheckUtils]: 50: Hoare triple {6179#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {6179#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:19:37,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {6186#(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); {6179#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:19:37,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {6190#(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)); {6186#(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-08 14:19:37,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {6190#(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); {6190#(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-08 14:19:37,452 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} {6197#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {6190#(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-08 14:19:37,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:19:37,453 INFO L290 TraceCheckUtils]: 44: Hoare triple {6207#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:19:37,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {5993#true} ~cond := #in~cond; {6207#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:19:37,453 INFO L272 TraceCheckUtils]: 42: Hoare triple {6197#(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)); {5993#true} is VALID [2022-04-08 14:19:37,454 INFO L290 TraceCheckUtils]: 41: Hoare triple {6197#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {6197#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 14:19:37,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {6217#(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); {6197#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 14:19:37,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {5993#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; {6217#(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-08 14:19:37,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {5993#true} assume !!(0 != ~y~0); {5993#true} is VALID [2022-04-08 14:19:37,456 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5993#true} {5993#true} #67#return; {5993#true} is VALID [2022-04-08 14:19:37,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L272 TraceCheckUtils]: 33: Hoare triple {5993#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {5993#true} assume !false; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {5993#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); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {5993#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; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {5993#true} assume !!(0 != ~y~0); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5993#true} {5993#true} #67#return; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L272 TraceCheckUtils]: 24: Hoare triple {5993#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:37,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {5993#true} assume !false; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {5993#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5993#true} {5993#true} #65#return; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L272 TraceCheckUtils]: 17: Hoare triple {5993#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5993#true} {5993#true} #63#return; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L272 TraceCheckUtils]: 12: Hoare triple {5993#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {5993#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5993#true} {5993#true} #61#return; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {5993#true} assume !(0 == ~cond); {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {5993#true} ~cond := #in~cond; {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {5993#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {5993#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; {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {5993#true} call #t~ret6 := main(); {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5993#true} {5993#true} #71#return; {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {5993#true} assume true; {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#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); {5993#true} is VALID [2022-04-08 14:19:37,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {5993#true} call ULTIMATE.init(); {5993#true} is VALID [2022-04-08 14:19:37,459 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-08 14:19:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:19:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971117707] [2022-04-08 14:19:37,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:19:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931522907] [2022-04-08 14:19:37,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931522907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:19:37,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:19:37,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-08 14:19:37,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:19:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836436278] [2022-04-08 14:19:37,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836436278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:19:37,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:19:37,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:19:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379779110] [2022-04-08 14:19:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:19:37,461 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-08 14:19:37,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:19:37,462 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-08 14:19:39,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:19:39,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:19:39,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:19:39,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:19:39,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:19:39,127 INFO L87 Difference]: Start difference. First operand 50 states and 55 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-08 14:19:41,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:19:47,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:19:51,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:19:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:19:52,036 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-04-08 14:19:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:19:52,037 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-08 14:19:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:19:52,037 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-08 14:19:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-08 14:19:52,038 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-08 14:19:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-08 14:19:52,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-08 14:19:55,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:19:55,546 INFO L225 Difference]: With dead ends: 79 [2022-04-08 14:19:55,546 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 14:19:55,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:19:55,547 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:19:55,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 178 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 23 Unchecked, 6.1s Time] [2022-04-08 14:19:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 14:19:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 14:19:55,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:19:55,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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-08 14:19:55,625 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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-08 14:19:55,625 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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-08 14:19:55,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:19:55,626 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-08 14:19:55,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 14:19:55,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:19:55,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:19:55,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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 50 states. [2022-04-08 14:19:55,627 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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 50 states. [2022-04-08 14:19:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:19:55,628 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-08 14:19:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 14:19:55,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:19:55,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:19:55,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:19:55,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:19:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 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-08 14:19:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-08 14:19:55,630 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 55 [2022-04-08 14:19:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:19:55,630 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-08 14:19:55,634 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-08 14:19:55,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2022-04-08 14:20:08,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 46 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 14:20:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 14:20:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 14:20:08,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:20:08,288 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:20:08,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 14:20:08,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 14:20:08,489 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:20:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:20:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1954893684, now seen corresponding path program 5 times [2022-04-08 14:20:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:20:08,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64795372] [2022-04-08 14:20:08,490 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:20:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1954893684, now seen corresponding path program 6 times [2022-04-08 14:20:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:20:08,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670224995] [2022-04-08 14:20:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:20:08,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:20:08,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:20:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485846407] [2022-04-08 14:20:08,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:20:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:20:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:20:08,503 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:20:08,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 14:20:08,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:20:08,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:20:08,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 14:20:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:20:08,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:20:28,939 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 14:21:11,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {6711#true} call ULTIMATE.init(); {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {6711#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); {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {6711#true} assume true; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6711#true} {6711#true} #71#return; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {6711#true} call #t~ret6 := main(); {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {6711#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; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {6711#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {6711#true} ~cond := #in~cond; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {6711#true} assume !(0 == ~cond); {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {6711#true} assume true; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6711#true} {6711#true} #61#return; {6711#true} is VALID [2022-04-08 14:21:11,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {6711#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L272 TraceCheckUtils]: 12: Hoare triple {6711#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {6711#true} ~cond := #in~cond; {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {6711#true} assume !(0 == ~cond); {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {6711#true} assume true; {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6711#true} {6711#true} #63#return; {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L272 TraceCheckUtils]: 17: Hoare triple {6711#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6711#true} is VALID [2022-04-08 14:21:11,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {6711#true} ~cond := #in~cond; {6770#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:21:11,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {6770#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6774#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:21:11,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {6774#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6774#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:21:11,093 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6774#(not (= |assume_abort_if_not_#in~cond| 0))} {6711#true} #65#return; {6781#(<= 1 main_~b~0)} is VALID [2022-04-08 14:21:11,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {6781#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !false; {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,094 INFO L272 TraceCheckUtils]: 24: Hoare triple {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6711#true} is VALID [2022-04-08 14:21:11,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {6711#true} ~cond := #in~cond; {6711#true} is VALID [2022-04-08 14:21:11,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {6711#true} assume !(0 == ~cond); {6711#true} is VALID [2022-04-08 14:21:11,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {6711#true} assume true; {6711#true} is VALID [2022-04-08 14:21:11,094 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6711#true} {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} #67#return; {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {6785#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6810#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {6810#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 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); {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,097 INFO L272 TraceCheckUtils]: 33: Hoare triple {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 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)); {6711#true} is VALID [2022-04-08 14:21:11,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {6711#true} ~cond := #in~cond; {6711#true} is VALID [2022-04-08 14:21:11,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {6711#true} assume !(0 == ~cond); {6711#true} is VALID [2022-04-08 14:21:11,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {6711#true} assume true; {6711#true} is VALID [2022-04-08 14:21:11,097 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6711#true} {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #67#return; {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {6814#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (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)); {6839#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:21:11,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {6839#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (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); {6843#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 14:21:11,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {6843#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !false; {6843#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 14:21:11,100 INFO L272 TraceCheckUtils]: 42: Hoare triple {6843#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6711#true} is VALID [2022-04-08 14:21:11,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {6711#true} ~cond := #in~cond; {6853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:11,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {6853#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:11,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {6857#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6857#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:21:11,102 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6857#(not (= |__VERIFIER_assert_#in~cond| 0))} {6843#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} #67#return; {6864#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 14:21:11,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {6864#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !!(0 != ~y~0); {6864#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 14:21:11,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {6864#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6871#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 14:21:11,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {6871#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 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); {6875#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (exists ((aux_div_v_main_~y~0_71_22 Int) (aux_mod_v_main_~y~0_71_22 Int)) (and (= (+ (* (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) (div (- main_~x~0) (- 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= (div (div main_~b~0 2) 2) (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22)) (<= 0 aux_mod_v_main_~y~0_71_22) (not (= aux_mod_v_main_~y~0_71_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) 2)) (< aux_mod_v_main_~y~0_71_22 2))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:21:11,382 INFO L290 TraceCheckUtils]: 50: Hoare triple {6875#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (exists ((aux_div_v_main_~y~0_71_22 Int) (aux_mod_v_main_~y~0_71_22 Int)) (and (= (+ (* (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) (div (- main_~x~0) (- 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= (div (div main_~b~0 2) 2) (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22)) (<= 0 aux_mod_v_main_~y~0_71_22) (not (= aux_mod_v_main_~y~0_71_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) 2)) (< aux_mod_v_main_~y~0_71_22 2))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {6879#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (< (div (* (- 1) (div (div main_~b~0 2) 2)) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:21:12,869 INFO L272 TraceCheckUtils]: 51: Hoare triple {6879#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (< (div (* (- 1) (div (div main_~b~0 2) 2)) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:21:12,870 INFO L290 TraceCheckUtils]: 52: Hoare triple {6883#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:21:12,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {6887#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6712#false} is VALID [2022-04-08 14:21:12,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {6712#false} assume !false; {6712#false} is VALID [2022-04-08 14:21:12,871 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:21:12,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:21:56,461 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful