/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_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:05:22,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:05:22,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:05:22,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:05:22,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:05:22,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:05:22,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:05:22,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:05:22,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:05:22,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:05:22,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:05:22,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:05:22,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:05:22,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:05:22,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:05:22,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:05:22,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:05:22,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:05:22,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:05:22,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:05:22,748 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:05:22,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:05:22,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:05:22,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:05:22,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:05:22,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:05:22,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:05:22,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:05:22,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:05:22,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:05:22,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:05:22,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:05:22,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:05:22,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:05:22,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:05:22,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:05:22,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:05:22,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:05:22,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:05:22,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:05:22,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:05:22,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:05:22,768 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:05:22,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:05:22,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:05:22,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:05:22,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:05:22,780 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:05:22,780 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:05:22,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:05:22,781 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:05:22,781 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:05:22,781 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:05:22,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:05:22,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:05:22,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:05:22,782 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:05:22,782 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:05:22,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:05:22,782 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:05:22,782 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:05:23,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:05:23,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:05:23,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:05:23,049 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:05:23,050 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:05:23,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound20.c [2022-04-08 14:05:23,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51f94ee/cf89f1ace33e404ca6b54e2e72aaf800/FLAG2b42d8bcd [2022-04-08 14:05:23,472 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:05:23,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound20.c [2022-04-08 14:05:23,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51f94ee/cf89f1ace33e404ca6b54e2e72aaf800/FLAG2b42d8bcd [2022-04-08 14:05:23,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51f94ee/cf89f1ace33e404ca6b54e2e72aaf800 [2022-04-08 14:05:23,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:05:23,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:05:23,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:05:23,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:05:23,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:05:23,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1329df15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23, skipping insertion in model container [2022-04-08 14:05:23,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:05:23,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:05:23,651 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_unwindbound20.c[537,550] [2022-04-08 14:05:23,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:05:23,672 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:05:23,686 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_unwindbound20.c[537,550] [2022-04-08 14:05:23,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:05:23,702 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:05:23,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23 WrapperNode [2022-04-08 14:05:23,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:05:23,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:05:23,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:05:23,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:05:23,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:05:23,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:05:23,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:05:23,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:05:23,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (1/1) ... [2022-04-08 14:05:23,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:05:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:23,768 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:05:23,792 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:05:23,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:05:23,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:05:23,813 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:05:23,813 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:05:23,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:05:23,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:05:23,814 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:05:23,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:05:23,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:05:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:05:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:05:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:05:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:05:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:05:23,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:05:23,874 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:05:23,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:05:23,982 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:05:23,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:05:23,988 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:05:23,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:05:23 BoogieIcfgContainer [2022-04-08 14:05:23,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:05:23,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:05:23,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:05:24,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:05:24,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:05:23" (1/3) ... [2022-04-08 14:05:24,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96136e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:05:24, skipping insertion in model container [2022-04-08 14:05:24,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:05:23" (2/3) ... [2022-04-08 14:05:24,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96136e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:05:24, skipping insertion in model container [2022-04-08 14:05:24,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:05:23" (3/3) ... [2022-04-08 14:05:24,010 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound20.c [2022-04-08 14:05:24,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:05:24,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:05:24,073 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:05:24,079 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:05:24,079 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:05:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:05:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 14:05:24,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:24,100 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:24,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:24,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 1 times [2022-04-08 14:05:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:24,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825876295] [2022-04-08 14:05:24,121 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:05:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 2 times [2022-04-08 14:05:24,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:24,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174422734] [2022-04-08 14:05:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:05:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:24,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {33#true} is VALID [2022-04-08 14:05:24,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 14:05:24,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-08 14:05:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:05:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:24,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 14:05:24,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 14:05:24,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 14:05:24,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-08 14:05:24,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:05:24,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {33#true} is VALID [2022-04-08 14:05:24,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 14:05:24,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-08 14:05:24,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-08 14:05:24,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-08 14:05:24,307 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {33#true} is VALID [2022-04-08 14:05:24,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 14:05:24,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 14:05:24,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 14:05:24,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-08 14:05:24,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {34#false} is VALID [2022-04-08 14:05:24,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 14:05:24,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {34#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {34#false} is VALID [2022-04-08 14:05:24,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 14:05:24,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 14:05:24,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 14:05:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:24,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174422734] [2022-04-08 14:05:24,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174422734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:24,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:24,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:05:24,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:24,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825876295] [2022-04-08 14:05:24,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825876295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:24,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:24,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:05:24,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125993437] [2022-04-08 14:05:24,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:24,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:05:24,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:24,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:24,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:24,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:05:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:24,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:05:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:05:24,376 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:24,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:24,477 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 14:05:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:05:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 14:05:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 14:05:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 14:05:24,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-08 14:05:24,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:24,577 INFO L225 Difference]: With dead ends: 52 [2022-04-08 14:05:24,577 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 14:05:24,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:05:24,582 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:24,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:05:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 14:05:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 14:05:24,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:24,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:24,614 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:24,615 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:24,618 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:05:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:05:24,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:24,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:24,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 14:05:24,620 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 14:05:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:24,622 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 14:05:24,622 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 14:05:24,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:24,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:24,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:24,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 14:05:24,627 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-08 14:05:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:24,627 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 14:05:24,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:24,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 14:05:24,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:24,672 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 14:05:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:05:24,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:24,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:24,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:05:24,673 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 1 times [2022-04-08 14:05:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:24,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [469763915] [2022-04-08 14:05:24,675 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:05:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 2 times [2022-04-08 14:05:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:24,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881167947] [2022-04-08 14:05:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:24,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:24,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:24,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1577448329] [2022-04-08 14:05:24,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:05:24,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:24,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:24,715 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:05:24,746 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:05:24,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:05:24,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:24,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:05:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:24,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:24,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 14:05:24,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#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);~counter~0 := 0; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(<= ~counter~0 0)} {251#true} #65#return; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(<= ~counter~0 0)} call #t~ret7 := main(); {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,966 INFO L272 TraceCheckUtils]: 6: Hoare triple {259#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= ~counter~0 0)} ~cond := #in~cond; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= ~counter~0 0)} assume !(0 == ~cond); {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {259#(<= ~counter~0 0)} {259#(<= ~counter~0 0)} #59#return; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {259#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {259#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:24,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {259#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {293#(<= |main_#t~post6| 0)} is VALID [2022-04-08 14:05:24,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {252#false} is VALID [2022-04-08 14:05:24,970 INFO L272 TraceCheckUtils]: 14: Hoare triple {252#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {252#false} is VALID [2022-04-08 14:05:24,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 14:05:24,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 14:05:24,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 14:05:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:24,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:05:24,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:24,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881167947] [2022-04-08 14:05:24,971 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:05:24,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577448329] [2022-04-08 14:05:24,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577448329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:24,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:24,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:05:24,974 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [469763915] [2022-04-08 14:05:24,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [469763915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:24,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:24,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 14:05:24,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544141334] [2022-04-08 14:05:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 14:05:24,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:24,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:05:24,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:24,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 14:05:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:24,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 14:05:24,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:05:24,998 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:05:25,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,065 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 14:05:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 14:05:25,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 14:05:25,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:05:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 14:05:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:05:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 14:05:25,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 14:05:25,107 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:05:25,109 INFO L225 Difference]: With dead ends: 34 [2022-04-08 14:05:25,109 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 14:05:25,110 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 14:05:25,113 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:25,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:05:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 14:05:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 14:05:25,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:25,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:25,135 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:25,136 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,139 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 14:05:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 14:05:25,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:25,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:25,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 14:05:25,142 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 14:05:25,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,146 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 14:05:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 14:05:25,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:25,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:25,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:25,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:25,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 14:05:25,153 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-04-08 14:05:25,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:25,153 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 14:05:25,153 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 14:05:25,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 14:05:25,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 14:05:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 14:05:25,190 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:25,192 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:25,218 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:05:25,411 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:05:25,412 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 1 times [2022-04-08 14:05:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:25,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176321588] [2022-04-08 14:05:25,413 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:05:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 2 times [2022-04-08 14:05:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:25,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713728303] [2022-04-08 14:05:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:25,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:25,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456072875] [2022-04-08 14:05:25,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:05:25,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:25,432 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:05:25,455 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:05:25,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:05:25,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:25,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:05:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:25,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:25,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {484#true} is VALID [2022-04-08 14:05:25,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#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);~counter~0 := 0; {484#true} is VALID [2022-04-08 14:05:25,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 14:05:25,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #65#return; {484#true} is VALID [2022-04-08 14:05:25,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret7 := main(); {484#true} is VALID [2022-04-08 14:05:25,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {484#true} is VALID [2022-04-08 14:05:25,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {484#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {484#true} is VALID [2022-04-08 14:05:25,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#true} ~cond := #in~cond; {484#true} is VALID [2022-04-08 14:05:25,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 == ~cond); {484#true} is VALID [2022-04-08 14:05:25,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 14:05:25,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {484#true} {484#true} #59#return; {484#true} is VALID [2022-04-08 14:05:25,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:05:25,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:05:25,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {522#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:05:25,669 INFO L272 TraceCheckUtils]: 14: Hoare triple {522#(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)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:05:25,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:05:25,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {485#false} is VALID [2022-04-08 14:05:25,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-08 14:05:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:25,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:05:25,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713728303] [2022-04-08 14:05:25,671 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:05:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456072875] [2022-04-08 14:05:25,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456072875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:25,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:25,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:05:25,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:25,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176321588] [2022-04-08 14:05:25,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176321588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:25,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:25,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:05:25,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222693771] [2022-04-08 14:05:25,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:25,673 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 14:05:25,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:25,673 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:25,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:25,688 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:05:25,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:25,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:05:25,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:05:25,689 INFO L87 Difference]: Start difference. First operand 27 states and 30 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,841 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 14:05:25,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:05:25,842 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 14:05:25,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:25,842 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-08 14:05:25,844 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-08 14:05:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-08 14:05:25,879 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:05:25,880 INFO L225 Difference]: With dead ends: 38 [2022-04-08 14:05:25,880 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:05:25,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:05:25,881 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:25,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:05:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:05:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-04-08 14:05:25,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:25,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:25,897 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:25,897 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,899 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:05:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 14:05:25,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:25,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:25,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-08 14:05:25,900 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-08 14:05:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:25,902 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 14:05:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 14:05:25,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:25,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:25,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:25,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 14:05:25,905 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 14:05:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:25,905 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 14:05:25,906 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 14:05:25,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 14:05:25,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 14:05:25,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 14:05:25,938 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:25,938 INFO L499 BasicCegarLoop]: trace histogram [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:05:25,960 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:05:26,157 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:05:26,157 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 1 times [2022-04-08 14:05:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:26,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1183434600] [2022-04-08 14:05:26,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:05:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 2 times [2022-04-08 14:05:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:26,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972709394] [2022-04-08 14:05:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:26,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:26,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239748813] [2022-04-08 14:05:26,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:05:26,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:26,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:26,181 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:05:26,206 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:05:26,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:05:26,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:26,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:05:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:26,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:26,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2022-04-08 14:05:26,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#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);~counter~0 := 0; {756#true} is VALID [2022-04-08 14:05:26,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-08 14:05:26,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #65#return; {756#true} is VALID [2022-04-08 14:05:26,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret7 := main(); {756#true} is VALID [2022-04-08 14:05:26,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {756#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {756#true} is VALID [2022-04-08 14:05:26,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {756#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {756#true} is VALID [2022-04-08 14:05:26,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#true} ~cond := #in~cond; {782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:05:26,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:05:26,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {786#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:05:26,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {786#(not (= |assume_abort_if_not_#in~cond| 0))} {756#true} #59#return; {793#(<= 1 main_~b~0)} is VALID [2022-04-08 14:05:26,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {793#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {797#(<= 1 main_~y~0)} is VALID [2022-04-08 14:05:26,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {797#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {797#(<= 1 main_~y~0)} is VALID [2022-04-08 14:05:26,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {797#(<= 1 main_~y~0)} assume !!(#t~post6 < 20);havoc #t~post6; {797#(<= 1 main_~y~0)} is VALID [2022-04-08 14:05:26,328 INFO L272 TraceCheckUtils]: 14: Hoare triple {797#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {756#true} is VALID [2022-04-08 14:05:26,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-04-08 14:05:26,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#true} assume !(0 == ~cond); {756#true} is VALID [2022-04-08 14:05:26,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-08 14:05:26,329 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {756#true} {797#(<= 1 main_~y~0)} #61#return; {797#(<= 1 main_~y~0)} is VALID [2022-04-08 14:05:26,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {797#(<= 1 main_~y~0)} assume !(0 != ~y~0); {757#false} is VALID [2022-04-08 14:05:26,330 INFO L272 TraceCheckUtils]: 20: Hoare triple {757#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {757#false} is VALID [2022-04-08 14:05:26,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2022-04-08 14:05:26,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2022-04-08 14:05:26,330 INFO L290 TraceCheckUtils]: 23: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-04-08 14:05:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:26,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:05:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972709394] [2022-04-08 14:05:26,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:05:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239748813] [2022-04-08 14:05:26,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239748813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:26,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:26,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:05:26,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:26,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1183434600] [2022-04-08 14:05:26,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1183434600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:26,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:26,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:05:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369721097] [2022-04-08 14:05:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:26,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 14:05:26,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:26,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:05:26,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:26,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:05:26,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:26,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:05:26,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:05:26,351 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:05:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:26,540 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:05:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:05:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 14:05:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:05:26,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 14:05:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:05:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 14:05:26,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 14:05:26,576 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:05:26,577 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:05:26,577 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 14:05:26,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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:05:26,579 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:26,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:05:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 14:05:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 14:05:26,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:26,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:26,602 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:26,602 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:26,604 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 14:05:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 14:05:26,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:26,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:26,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 14:05:26,605 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 35 states. [2022-04-08 14:05:26,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:26,606 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 14:05:26,606 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 14:05:26,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:26,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:26,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:26,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-08 14:05:26,609 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2022-04-08 14:05:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:26,609 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-08 14:05:26,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:05:26,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-08 14:05:26,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 14:05:26,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:05:26,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:26,643 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:26,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 14:05:26,851 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:05:26,851 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 1 times [2022-04-08 14:05:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171377098] [2022-04-08 14:05:31,001 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:05:31,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:05:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 2 times [2022-04-08 14:05:31,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:31,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744813741] [2022-04-08 14:05:31,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:31,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:31,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:31,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1395663595] [2022-04-08 14:05:31,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:05:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:31,035 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:05:31,091 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:05:31,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:05:31,133 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:31,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:05:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:31,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:31,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-08 14:05:31,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#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);~counter~0 := 0; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {1065#(<= ~counter~0 0)} assume true; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1065#(<= ~counter~0 0)} {1057#true} #65#return; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {1065#(<= ~counter~0 0)} call #t~ret7 := main(); {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {1065#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {1065#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(<= ~counter~0 0)} ~cond := #in~cond; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1065#(<= ~counter~0 0)} assume !(0 == ~cond); {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(<= ~counter~0 0)} assume true; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1065#(<= ~counter~0 0)} {1065#(<= ~counter~0 0)} #59#return; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1065#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:31,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1065#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,296 INFO L272 TraceCheckUtils]: 14: Hoare triple {1099#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#(<= ~counter~0 1)} ~cond := #in~cond; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 1)} assume !(0 == ~cond); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 1)} assume true; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,301 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1099#(<= ~counter~0 1)} {1099#(<= ~counter~0 1)} #61#return; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#(<= ~counter~0 1)} assume !!(0 != ~y~0); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {1099#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {1099#(<= ~counter~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); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:31,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {1099#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1130#(<= |main_#t~post6| 1)} is VALID [2022-04-08 14:05:31,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {1130#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1058#false} is VALID [2022-04-08 14:05:31,304 INFO L272 TraceCheckUtils]: 24: Hoare triple {1058#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1058#false} is VALID [2022-04-08 14:05:31,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-08 14:05:31,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-08 14:05:31,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-08 14:05:31,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:31,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:05:31,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-08 14:05:31,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-08 14:05:31,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-08 14:05:31,462 INFO L272 TraceCheckUtils]: 24: Hoare triple {1058#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1058#false} is VALID [2022-04-08 14:05:31,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {1158#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1058#false} is VALID [2022-04-08 14:05:31,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {1162#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1158#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:05:31,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(< ~counter~0 20)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {1162#(< ~counter~0 20)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(< ~counter~0 20)} assume !!(0 != ~y~0); {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,479 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1057#true} {1162#(< ~counter~0 20)} #61#return; {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-08 14:05:31,479 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#true} assume !(0 == ~cond); {1057#true} is VALID [2022-04-08 14:05:31,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#true} ~cond := #in~cond; {1057#true} is VALID [2022-04-08 14:05:31,480 INFO L272 TraceCheckUtils]: 14: Hoare triple {1162#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1057#true} is VALID [2022-04-08 14:05:31,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1162#(< ~counter~0 20)} is VALID [2022-04-08 14:05:31,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#(< ~counter~0 19)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,485 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1057#true} {1193#(< ~counter~0 19)} #59#return; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-08 14:05:31,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#true} assume !(0 == ~cond); {1057#true} is VALID [2022-04-08 14:05:31,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {1057#true} ~cond := #in~cond; {1057#true} is VALID [2022-04-08 14:05:31,485 INFO L272 TraceCheckUtils]: 6: Hoare triple {1193#(< ~counter~0 19)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1057#true} is VALID [2022-04-08 14:05:31,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(< ~counter~0 19)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {1193#(< ~counter~0 19)} call #t~ret7 := main(); {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1193#(< ~counter~0 19)} {1057#true} #65#return; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#(< ~counter~0 19)} assume true; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1057#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);~counter~0 := 0; {1193#(< ~counter~0 19)} is VALID [2022-04-08 14:05:31,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-08 14:05:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:31,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:31,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744813741] [2022-04-08 14:05:31,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:05:31,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395663595] [2022-04-08 14:05:31,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395663595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:05:31,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:05:31,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 14:05:31,491 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:31,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171377098] [2022-04-08 14:05:31,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171377098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:31,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:31,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:05:31,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375659351] [2022-04-08 14:05:31,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:31,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 14:05:31,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:31,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:31,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:31,511 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:05:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:31,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:05:31,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:05:31,512 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:31,609 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 14:05:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:05:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-04-08 14:05:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 14:05:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 14:05:31,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-04-08 14:05:31,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:31,649 INFO L225 Difference]: With dead ends: 44 [2022-04-08 14:05:31,649 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 14:05:31,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 14:05:31,650 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:31,651 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:05:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 14:05:31,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 14:05:31,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:31,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:31,681 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:31,681 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:31,683 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 14:05:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 14:05:31,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:31,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:31,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 14:05:31,684 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 14:05:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:31,688 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 14:05:31,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 14:05:31,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:31,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:31,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:31,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:05:31,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-08 14:05:31,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2022-04-08 14:05:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:31,693 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-08 14:05:31,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 14:05:31,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-08 14:05:31,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 14:05:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:05:31,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:31,731 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:31,756 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:05:31,948 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:05:31,949 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:31,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 586406521, now seen corresponding path program 1 times [2022-04-08 14:05:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:31,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1906824526] [2022-04-08 14:05:34,838 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:05:34,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:05:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash 586406521, now seen corresponding path program 2 times [2022-04-08 14:05:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498177337] [2022-04-08 14:05:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:34,851 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:34,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769913943] [2022-04-08 14:05:34,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:05:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:34,856 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:05:34,865 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:05:34,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:05:34,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:34,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 14:05:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:34,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:36,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {1470#true} call ULTIMATE.init(); {1470#true} is VALID [2022-04-08 14:05:36,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#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);~counter~0 := 0; {1470#true} is VALID [2022-04-08 14:05:36,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume true; {1470#true} is VALID [2022-04-08 14:05:36,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#true} {1470#true} #65#return; {1470#true} is VALID [2022-04-08 14:05:36,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#true} call #t~ret7 := main(); {1470#true} is VALID [2022-04-08 14:05:36,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {1470#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1470#true} is VALID [2022-04-08 14:05:36,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {1470#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1470#true} is VALID [2022-04-08 14:05:36,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {1470#true} ~cond := #in~cond; {1496#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:05:36,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {1496#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1500#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:05:36,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {1500#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1500#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:05:36,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1500#(not (= |assume_abort_if_not_#in~cond| 0))} {1470#true} #59#return; {1507#(<= 1 main_~b~0)} is VALID [2022-04-08 14:05:36,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1511#(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:05:36,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {1511#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1511#(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:05:36,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {1511#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {1511#(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:05:36,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {1511#(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)); {1470#true} is VALID [2022-04-08 14:05:36,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {1470#true} ~cond := #in~cond; {1524#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:05:36,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1524#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:05:36,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:05:36,653 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} {1511#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {1511#(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:05:36,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {1511#(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); {1511#(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:05:36,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {1511#(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)); {1541#(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:05:36,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {1541#(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); {1545#(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:05:36,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {1545#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1545#(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:05:36,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {1545#(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 !!(#t~post6 < 20);havoc #t~post6; {1545#(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:05:36,658 INFO L272 TraceCheckUtils]: 24: Hoare triple {1545#(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)); {1555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:05:36,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:05:36,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {1559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1471#false} is VALID [2022-04-08 14:05:36,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#false} assume !false; {1471#false} is VALID [2022-04-08 14:05:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:36,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:06:13,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#false} assume !false; {1471#false} is VALID [2022-04-08 14:06:13,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {1559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1471#false} is VALID [2022-04-08 14:06:13,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {1555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:06:13,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {1575#(= (+ 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)); {1555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:06:13,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:06:13,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:06:13,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {1585#(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); {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:06:13,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {1589#(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)); {1585#(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:06:13,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {1589#(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); {1589#(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:06:13,150 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #61#return; {1589#(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:06:13,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:06:13,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {1606#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1528#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:06:13,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {1470#true} ~cond := #in~cond; {1606#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:06:13,152 INFO L272 TraceCheckUtils]: 14: Hoare triple {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1470#true} is VALID [2022-04-08 14:06:13,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:06:13,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:06:13,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(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; {1596#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:06:13,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1500#(not (= |assume_abort_if_not_#in~cond| 0))} {1470#true} #59#return; {1619#(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:06:13,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1500#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1500#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:06:13,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {1632#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1500#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:06:13,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {1470#true} ~cond := #in~cond; {1632#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 14:06:13,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {1470#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1470#true} is VALID [2022-04-08 14:06:13,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {1470#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1470#true} is VALID [2022-04-08 14:06:13,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#true} call #t~ret7 := main(); {1470#true} is VALID [2022-04-08 14:06:13,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#true} {1470#true} #65#return; {1470#true} is VALID [2022-04-08 14:06:13,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume true; {1470#true} is VALID [2022-04-08 14:06:13,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#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);~counter~0 := 0; {1470#true} is VALID [2022-04-08 14:06:13,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {1470#true} call ULTIMATE.init(); {1470#true} is VALID [2022-04-08 14:06:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:06:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:06:13,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498177337] [2022-04-08 14:06:13,158 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:06:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769913943] [2022-04-08 14:06:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769913943] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:06:13,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:06:13,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-08 14:06:13,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:06:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1906824526] [2022-04-08 14:06:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1906824526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:06:13,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:06:13,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:06:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338704383] [2022-04-08 14:06:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:06:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 14:06:13,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:06:13,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:06:13,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:13,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:06:13,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:06:13,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:06:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:06:13,183 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:06:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:13,755 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 14:06:13,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:06:13,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 14:06:13,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:06:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:06:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 14:06:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:06:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 14:06:13,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-08 14:06:13,813 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:06:13,814 INFO L225 Difference]: With dead ends: 55 [2022-04-08 14:06:13,815 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 14:06:13,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:06:13,816 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:06:13,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 114 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 14:06:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 14:06:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-08 14:06:13,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:06:13,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:06:13,870 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:06:13,870 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:06:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:13,872 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-08 14:06:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-08 14:06:13,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:13,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:13,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-04-08 14:06:13,873 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-04-08 14:06:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:13,876 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-08 14:06:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-08 14:06:13,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:13,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:13,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:06:13,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:06:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:06:13,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-08 14:06:13,878 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 28 [2022-04-08 14:06:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:06:13,879 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-08 14:06:13,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 10 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:06:13,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-08 14:06:13,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-08 14:06:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 14:06:13,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:06:13,929 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:06:13,949 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:06:14,129 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:06:14,130 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:06:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:06:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1395753147, now seen corresponding path program 1 times [2022-04-08 14:06:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:06:14,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1393534632] [2022-04-08 14:06:16,702 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:06:16,702 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:06:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1395753147, now seen corresponding path program 2 times [2022-04-08 14:06:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:06:16,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923817409] [2022-04-08 14:06:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:06:16,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:06:16,728 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:06:16,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [540544256] [2022-04-08 14:06:16,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:06:16,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:06:16,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:06:16,731 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:06:16,732 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:06:16,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:06:16,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:06:16,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 14:06:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:06:16,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:06:19,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2022-04-08 14:06:19,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#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);~counter~0 := 0; {1960#true} is VALID [2022-04-08 14:06:19,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 14:06:19,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #65#return; {1960#true} is VALID [2022-04-08 14:06:19,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret7 := main(); {1960#true} is VALID [2022-04-08 14:06:19,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1960#true} is VALID [2022-04-08 14:06:19,580 INFO L272 TraceCheckUtils]: 6: Hoare triple {1960#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1960#true} is VALID [2022-04-08 14:06:19,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1960#true} ~cond := #in~cond; {1986#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:06:19,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {1986#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1990#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:06:19,584 INFO L290 TraceCheckUtils]: 9: Hoare triple {1990#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1990#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:06:19,584 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1990#(not (= |assume_abort_if_not_#in~cond| 0))} {1960#true} #59#return; {1997#(<= 1 main_~b~0)} is VALID [2022-04-08 14:06:19,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1997#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:06:19,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:06:19,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:06:19,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {2001#(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)); {1960#true} is VALID [2022-04-08 14:06:19,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {1960#true} ~cond := #in~cond; {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:06:19,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:06:19,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:06:19,587 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2001#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {2025#(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:06:19,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {2025#(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); {2025#(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:06:19,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {2025#(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);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2032#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~b~0 main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:06:19,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {2032#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~b~0 main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~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); {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:06:19,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:06:19,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:06:20,104 INFO L272 TraceCheckUtils]: 24: Hoare triple {2036#(and (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (+ main_~a~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 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)); {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:06:20,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:06:20,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {2050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1961#false} is VALID [2022-04-08 14:06:20,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2022-04-08 14:06:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:06:20,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:07:42,270 INFO L290 TraceCheckUtils]: 27: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2022-04-08 14:07:42,271 INFO L290 TraceCheckUtils]: 26: Hoare triple {2050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1961#false} is VALID [2022-04-08 14:07:42,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:07:42,272 INFO L272 TraceCheckUtils]: 24: Hoare triple {2066#(= (+ 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)); {2046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:07:42,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:07:42,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:07:42,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {2076#(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); {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:07:42,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {2080#(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; {2076#(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:07:42,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {2080#(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); {2080#(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:07:42,479 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {1960#true} #61#return; {2080#(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:07:42,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:07:42,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {2096#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {1960#true} ~cond := #in~cond; {2096#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:07:42,481 INFO L272 TraceCheckUtils]: 14: Hoare triple {1960#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {1960#true} assume !!(#t~post6 < 20);havoc #t~post6; {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {1960#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {1960#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1960#true} {1960#true} #59#return; {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 14:07:42,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {1960#true} assume !(0 == ~cond); {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {1960#true} ~cond := #in~cond; {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L272 TraceCheckUtils]: 6: Hoare triple {1960#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {1960#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret7 := main(); {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #65#return; {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 14:07:42,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1960#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);~counter~0 := 0; {1960#true} is VALID [2022-04-08 14:07:42,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2022-04-08 14:07:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:07:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:07:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923817409] [2022-04-08 14:07:42,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:07:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540544256] [2022-04-08 14:07:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540544256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:07:42,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:07:42,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 14:07:42,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:07:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1393534632] [2022-04-08 14:07:42,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1393534632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:07:42,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:07:42,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:07:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608059146] [2022-04-08 14:07:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:07:42,491 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 14:07:42,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:07:42,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:07:42,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:42,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:07:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:07:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:07:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 14:07:42,976 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:07:45,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:07:47,454 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:07:51,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:07:53,366 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:07:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:54,364 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-08 14:07:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:07:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 14:07:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:07:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:07:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 14:07:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:07:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 14:07:54,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-08 14:07:54,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:54,804 INFO L225 Difference]: With dead ends: 57 [2022-04-08 14:07:54,805 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 14:07:54,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:07:54,806 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:07:54,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-04-08 14:07:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 14:07:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-08 14:07:54,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:07:54,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:07:54,858 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:07:54,858 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:07:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:54,860 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 14:07:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-08 14:07:54,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:07:54,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:07:54,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 55 states. [2022-04-08 14:07:54,861 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 55 states. [2022-04-08 14:07:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:54,862 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 14:07:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-08 14:07:54,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:07:54,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:07:54,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:07:54,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:07:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:07:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-08 14:07:54,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 28 [2022-04-08 14:07:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:07:54,865 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-08 14:07:54,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:07:54,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2022-04-08 14:07:55,131 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:07:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-08 14:07:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 14:07:55,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:07:55,132 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:07:55,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 14:07:55,337 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:07:55,337 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:07:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:07:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1513703477, now seen corresponding path program 1 times [2022-04-08 14:07:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:07:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [550622226] [2022-04-08 14:07:58,930 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:07:58,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:07:58,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1513703477, now seen corresponding path program 2 times [2022-04-08 14:07:58,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:07:58,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721882099] [2022-04-08 14:07:58,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:07:58,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:07:58,943 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:07:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86547931] [2022-04-08 14:07:58,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:07:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:07:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:07:58,951 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:07:58,963 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:07:58,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:07:58,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:07:58,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 14:07:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:07:59,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:06,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {2476#true} call ULTIMATE.init(); {2476#true} is VALID [2022-04-08 14:08:06,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2476#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);~counter~0 := 0; {2476#true} is VALID [2022-04-08 14:08:06,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:06,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#true} {2476#true} #65#return; {2476#true} is VALID [2022-04-08 14:08:06,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#true} call #t~ret7 := main(); {2476#true} is VALID [2022-04-08 14:08:06,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {2476#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2476#true} {2476#true} #59#return; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#true} assume !!(#t~post6 < 20);havoc #t~post6; {2476#true} is VALID [2022-04-08 14:08:06,893 INFO L272 TraceCheckUtils]: 14: Hoare triple {2476#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2476#true} {2476#true} #61#return; {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#true} assume !!(0 != ~y~0); {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {2476#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; {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {2476#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); {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 14:08:06,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {2476#true} assume !!(#t~post6 < 20);havoc #t~post6; {2476#true} is VALID [2022-04-08 14:08:06,895 INFO L272 TraceCheckUtils]: 24: Hoare triple {2476#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:06,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {2476#true} ~cond := #in~cond; {2556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:06,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {2556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:06,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:08,899 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} {2476#true} #61#return; {2567#(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:08:08,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {2567#(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); {2571#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:08:08,901 INFO L272 TraceCheckUtils]: 30: Hoare triple {2571#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:08:08,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:08,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2477#false} is VALID [2022-04-08 14:08:08,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {2477#false} assume !false; {2477#false} is VALID [2022-04-08 14:08:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:08:08,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:08:11,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {2477#false} assume !false; {2477#false} is VALID [2022-04-08 14:08:11,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2477#false} is VALID [2022-04-08 14:08:11,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2579#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:11,151 INFO L272 TraceCheckUtils]: 30: Hoare triple {2571#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2575#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:08:11,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {2598#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {2571#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:08:11,168 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} {2476#true} #61#return; {2598#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:08:11,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:11,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {2611#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2560#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:08:11,169 INFO L290 TraceCheckUtils]: 25: Hoare triple {2476#true} ~cond := #in~cond; {2611#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:08:11,169 INFO L272 TraceCheckUtils]: 24: Hoare triple {2476#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {2476#true} assume !!(#t~post6 < 20);havoc #t~post6; {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {2476#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); {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {2476#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; {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#true} assume !!(0 != ~y~0); {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2476#true} {2476#true} #61#return; {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:11,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L272 TraceCheckUtils]: 14: Hoare triple {2476#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#true} assume !!(#t~post6 < 20);havoc #t~post6; {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2476#true} {2476#true} #59#return; {2476#true} is VALID [2022-04-08 14:08:11,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {2476#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {2476#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#true} call #t~ret7 := main(); {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#true} {2476#true} #65#return; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {2476#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);~counter~0 := 0; {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {2476#true} call ULTIMATE.init(); {2476#true} is VALID [2022-04-08 14:08:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:08:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:11,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721882099] [2022-04-08 14:08:11,173 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:11,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86547931] [2022-04-08 14:08:11,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86547931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:08:11,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:08:11,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:08:11,173 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:11,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [550622226] [2022-04-08 14:08:11,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [550622226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:11,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:11,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:08:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125421539] [2022-04-08 14:08:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:11,174 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2022-04-08 14:08:11,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:11,174 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:08:13,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:13,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:08:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:08:13,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:08:13,203 INFO L87 Difference]: Start difference. First operand 51 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:08:15,238 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:08:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:15,873 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-08 14:08:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:08:15,874 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 34 [2022-04-08 14:08:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:15,874 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:08:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:08:15,875 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:08:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 14:08:15,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 14:08:17,914 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:08:17,915 INFO L225 Difference]: With dead ends: 59 [2022-04-08 14:08:17,915 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 14:08:17,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 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:08:17,916 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 14:08:17,916 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 14:08:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 14:08:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-08 14:08:17,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:17,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:17,958 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:17,958 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:17,959 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-08 14:08:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-08 14:08:17,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:17,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:17,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-08 14:08:17,960 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 52 states. [2022-04-08 14:08:17,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:17,962 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-08 14:08:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-08 14:08:17,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:17,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:17,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:17,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-08 14:08:17,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 34 [2022-04-08 14:08:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:17,964 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-08 14:08:17,964 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:08:17,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-08 14:08:24,075 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:08:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-08 14:08:24,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:08:24,076 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:24,076 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:08:24,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 14:08:24,279 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:08:24,280 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887472, now seen corresponding path program 3 times [2022-04-08 14:08:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:24,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215553316] [2022-04-08 14:08:27,229 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:08:27,230 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:08:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887472, now seen corresponding path program 4 times [2022-04-08 14:08:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:27,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594880779] [2022-04-08 14:08:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:27,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:27,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858424301] [2022-04-08 14:08:27,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:08:27,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:27,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:27,247 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:08:27,275 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:08:27,306 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:08:27,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:27,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:08:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:27,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:27,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-08 14:08:27,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2999#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);~counter~0 := 0; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3007#(<= ~counter~0 0)} assume true; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3007#(<= ~counter~0 0)} {2999#true} #65#return; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {3007#(<= ~counter~0 0)} call #t~ret7 := main(); {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3007#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {3007#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {3007#(<= ~counter~0 0)} ~cond := #in~cond; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#(<= ~counter~0 0)} assume !(0 == ~cond); {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#(<= ~counter~0 0)} assume true; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,500 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3007#(<= ~counter~0 0)} {3007#(<= ~counter~0 0)} #59#return; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {3007#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:27,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {3007#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {3041#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,503 INFO L272 TraceCheckUtils]: 14: Hoare triple {3041#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {3041#(<= ~counter~0 1)} ~cond := #in~cond; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {3041#(<= ~counter~0 1)} assume !(0 == ~cond); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {3041#(<= ~counter~0 1)} assume true; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,505 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3041#(<= ~counter~0 1)} {3041#(<= ~counter~0 1)} #61#return; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {3041#(<= ~counter~0 1)} assume !!(0 != ~y~0); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {3041#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {3041#(<= ~counter~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); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:27,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {3041#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {3072#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,507 INFO L272 TraceCheckUtils]: 24: Hoare triple {3072#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {3072#(<= ~counter~0 2)} ~cond := #in~cond; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {3072#(<= ~counter~0 2)} assume !(0 == ~cond); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {3072#(<= ~counter~0 2)} assume true; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,508 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3072#(<= ~counter~0 2)} {3072#(<= ~counter~0 2)} #61#return; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {3072#(<= ~counter~0 2)} assume !!(0 != ~y~0); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {3072#(<= ~counter~0 2)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {3072#(<= ~counter~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); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:27,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {3072#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3103#(<= |main_#t~post6| 2)} is VALID [2022-04-08 14:08:27,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {3103#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {3000#false} is VALID [2022-04-08 14:08:27,510 INFO L272 TraceCheckUtils]: 34: Hoare triple {3000#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {3000#false} is VALID [2022-04-08 14:08:27,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#false} ~cond := #in~cond; {3000#false} is VALID [2022-04-08 14:08:27,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {3000#false} assume 0 == ~cond; {3000#false} is VALID [2022-04-08 14:08:27,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-08 14:08:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:08:27,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:08:27,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-08 14:08:27,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {3000#false} assume 0 == ~cond; {3000#false} is VALID [2022-04-08 14:08:27,684 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#false} ~cond := #in~cond; {3000#false} is VALID [2022-04-08 14:08:27,684 INFO L272 TraceCheckUtils]: 34: Hoare triple {3000#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {3000#false} is VALID [2022-04-08 14:08:27,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {3131#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3000#false} is VALID [2022-04-08 14:08:27,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {3135#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3131#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:08:27,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {3135#(< ~counter~0 20)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,686 INFO L290 TraceCheckUtils]: 30: Hoare triple {3135#(< ~counter~0 20)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {3135#(< ~counter~0 20)} assume !!(0 != ~y~0); {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,687 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2999#true} {3135#(< ~counter~0 20)} #61#return; {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 14:08:27,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 14:08:27,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 14:08:27,688 INFO L272 TraceCheckUtils]: 24: Hoare triple {3135#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2999#true} is VALID [2022-04-08 14:08:27,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {3135#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {3166#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3135#(< ~counter~0 20)} is VALID [2022-04-08 14:08:27,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {3166#(< ~counter~0 19)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {3166#(< ~counter~0 19)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {3166#(< ~counter~0 19)} assume !!(0 != ~y~0); {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,691 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2999#true} {3166#(< ~counter~0 19)} #61#return; {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 14:08:27,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 14:08:27,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 14:08:27,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {3166#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2999#true} is VALID [2022-04-08 14:08:27,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {3166#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {3197#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3166#(< ~counter~0 19)} is VALID [2022-04-08 14:08:27,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {3197#(< ~counter~0 18)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2999#true} {3197#(< ~counter~0 18)} #59#return; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 14:08:27,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 14:08:27,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 14:08:27,694 INFO L272 TraceCheckUtils]: 6: Hoare triple {3197#(< ~counter~0 18)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2999#true} is VALID [2022-04-08 14:08:27,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {3197#(< ~counter~0 18)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {3197#(< ~counter~0 18)} call #t~ret7 := main(); {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3197#(< ~counter~0 18)} {2999#true} #65#return; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {3197#(< ~counter~0 18)} assume true; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {2999#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);~counter~0 := 0; {3197#(< ~counter~0 18)} is VALID [2022-04-08 14:08:27,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-08 14:08:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:08:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594880779] [2022-04-08 14:08:27,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858424301] [2022-04-08 14:08:27,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858424301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:08:27,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:08:27,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:08:27,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:27,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215553316] [2022-04-08 14:08:27,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215553316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:27,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:27,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:08:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952832972] [2022-04-08 14:08:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:27,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2022-04-08 14:08:27,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:27,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:08:27,736 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:27,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:08:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:08:27,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:08:27,737 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:08:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:27,892 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-08 14:08:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:08:27,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2022-04-08 14:08:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:08:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 14:08:27,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:08:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 14:08:27,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-08 14:08:27,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:27,957 INFO L225 Difference]: With dead ends: 54 [2022-04-08 14:08:27,957 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 14:08:27,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:08:27,959 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:08:27,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:08:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 14:08:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 14:08:28,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:28,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:28,028 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:28,029 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:28,031 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:08:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:08:28,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:28,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:28,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-04-08 14:08:28,033 INFO L87 Difference]: Start difference. First operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-04-08 14:08:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:28,034 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 14:08:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:08:28,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:28,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:28,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:28,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:08:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 14:08:28,036 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2022-04-08 14:08:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:28,036 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 14:08:28,036 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:08:28,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-08 14:08:34,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 48 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:34,177 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 14:08:34,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:08:34,178 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:34,178 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:08:34,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 14:08:34,378 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:08:34,379 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:34,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:34,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1455100012, now seen corresponding path program 3 times [2022-04-08 14:08:34,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:34,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257982979] [2022-04-08 14:08:34,806 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:08:34,806 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:08:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1455100012, now seen corresponding path program 4 times [2022-04-08 14:08:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:34,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623312258] [2022-04-08 14:08:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:34,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:34,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:34,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745474314] [2022-04-08 14:08:34,819 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:08:34,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:34,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:34,827 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:08:34,830 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:08:34,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:08:34,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:34,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 14:08:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:34,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:40,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {3536#true} call ULTIMATE.init(); {3536#true} is VALID [2022-04-08 14:08:40,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {3536#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);~counter~0 := 0; {3536#true} is VALID [2022-04-08 14:08:40,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:08:40,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3536#true} {3536#true} #65#return; {3536#true} is VALID [2022-04-08 14:08:40,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {3536#true} call #t~ret7 := main(); {3536#true} is VALID [2022-04-08 14:08:40,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3536#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3536#true} is VALID [2022-04-08 14:08:40,430 INFO L272 TraceCheckUtils]: 6: Hoare triple {3536#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3536#true} is VALID [2022-04-08 14:08:40,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {3536#true} ~cond := #in~cond; {3562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:08:40,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {3562#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:08:40,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {3566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:08:40,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3566#(not (= |assume_abort_if_not_#in~cond| 0))} {3536#true} #59#return; {3573#(<= 1 main_~b~0)} is VALID [2022-04-08 14:08:40,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {3573#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3577#(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:08:40,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {3577#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3577#(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:08:40,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {3577#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {3577#(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:08:40,435 INFO L272 TraceCheckUtils]: 14: Hoare triple {3577#(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)); {3536#true} is VALID [2022-04-08 14:08:40,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 14:08:40,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 14:08:40,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:08:40,436 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3536#true} {3577#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {3577#(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:08:40,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {3577#(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); {3577#(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:08:40,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {3577#(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)); {3605#(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:08:40,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {3605#(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); {3609#(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:08:40,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {3609#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3609#(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:08:40,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {3609#(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 !!(#t~post6 < 20);havoc #t~post6; {3609#(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:08:40,439 INFO L272 TraceCheckUtils]: 24: Hoare triple {3609#(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)); {3536#true} is VALID [2022-04-08 14:08:40,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 14:08:40,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 14:08:40,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:08:40,439 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3536#true} {3609#(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))} #61#return; {3609#(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:08:40,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {3609#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {3609#(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:08:40,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {3609#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3637#(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:08:40,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {3637#(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); {3641#(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:08:40,442 INFO L290 TraceCheckUtils]: 32: Hoare triple {3641#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3641#(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:08:40,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {3641#(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 !!(#t~post6 < 20);havoc #t~post6; {3641#(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:08:40,444 INFO L272 TraceCheckUtils]: 34: Hoare triple {3641#(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)); {3651#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:08:40,445 INFO L290 TraceCheckUtils]: 35: Hoare triple {3651#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3655#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:08:40,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {3655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3537#false} is VALID [2022-04-08 14:08:40,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {3537#false} assume !false; {3537#false} is VALID [2022-04-08 14:08:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:08:40,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:09:02,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {3537#false} assume !false; {3537#false} is VALID [2022-04-08 14:09:02,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {3655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3537#false} is VALID [2022-04-08 14:09:02,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {3651#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3655#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:02,199 INFO L272 TraceCheckUtils]: 34: Hoare triple {3671#(= (+ 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)); {3651#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:09:02,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:02,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:02,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {3681#(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); {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:09:02,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {3685#(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)); {3681#(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:02,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {3685#(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); {3685#(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:02,207 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3536#true} {3685#(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)))))} #61#return; {3685#(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:02,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:09:02,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 14:09:02,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 14:09:02,207 INFO L272 TraceCheckUtils]: 24: Hoare triple {3685#(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)); {3536#true} is VALID [2022-04-08 14:09:02,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {3685#(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 !!(#t~post6 < 20);havoc #t~post6; {3685#(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:02,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {3685#(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)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3685#(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:02,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {3713#(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); {3685#(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:02,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {3717#(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)); {3713#(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:09:02,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {3717#(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); {3717#(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:09:02,223 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3536#true} {3717#(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)))} #61#return; {3717#(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:09:02,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:09:02,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 14:09:02,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 14:09:02,223 INFO L272 TraceCheckUtils]: 14: Hoare triple {3717#(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)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3536#true} is VALID [2022-04-08 14:09:02,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {3717#(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 !!(#t~post6 < 20);havoc #t~post6; {3717#(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:09:02,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {3717#(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)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3717#(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:09:02,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {3745#(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; {3717#(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:09:02,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3566#(not (= |assume_abort_if_not_#in~cond| 0))} {3536#true} #59#return; {3745#(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:09:02,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {3566#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:02,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {3758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {3566#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:02,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {3536#true} ~cond := #in~cond; {3758#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 14:09:02,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {3536#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3536#true} is VALID [2022-04-08 14:09:02,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {3536#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3536#true} is VALID [2022-04-08 14:09:02,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {3536#true} call #t~ret7 := main(); {3536#true} is VALID [2022-04-08 14:09:02,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3536#true} {3536#true} #65#return; {3536#true} is VALID [2022-04-08 14:09:02,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 14:09:02,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {3536#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);~counter~0 := 0; {3536#true} is VALID [2022-04-08 14:09:02,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {3536#true} call ULTIMATE.init(); {3536#true} is VALID [2022-04-08 14:09:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:09:02,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:09:02,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623312258] [2022-04-08 14:09:02,231 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:09:02,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745474314] [2022-04-08 14:09:02,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745474314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:09:02,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:09:02,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 14:09:02,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:09:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257982979] [2022-04-08 14:09:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257982979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:09:02,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:09:02,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:09:02,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803972810] [2022-04-08 14:09:02,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:09:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:09:02,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:09:02,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:09:02,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:02,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:09:02,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:02,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:09:02,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-04-08 14:09:02,270 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:09:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:03,249 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-08 14:09:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:09:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:09:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:09:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:09:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 14:09:03,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:09:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 14:09:03,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 14:09:03,314 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:03,315 INFO L225 Difference]: With dead ends: 70 [2022-04-08 14:09:03,315 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 14:09:03,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:09:03,316 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 14:09:03,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 167 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 14:09:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 14:09:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-04-08 14:09:03,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:09:03,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:03,421 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:03,422 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:03,431 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-04-08 14:09:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-08 14:09:03,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:03,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:03,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 68 states. [2022-04-08 14:09:03,434 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 68 states. [2022-04-08 14:09:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:03,436 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-04-08 14:09:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-08 14:09:03,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:03,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:03,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:09:03,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:09:03,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:09:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 14:09:03,438 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 14:09:03,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:09:03,438 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 14:09:03,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:09:03,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 14:09:13,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 65 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 14:09:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:09:13,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:09:13,710 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] [2022-04-08 14:09:13,726 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:09:13,910 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:09:13,911 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:09:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:09:13,911 INFO L85 PathProgramCache]: Analyzing trace with hash -645753386, now seen corresponding path program 1 times [2022-04-08 14:09:13,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:13,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1234395671] [2022-04-08 14:09:18,093 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:09:18,093 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:09:18,093 INFO L85 PathProgramCache]: Analyzing trace with hash -645753386, now seen corresponding path program 2 times [2022-04-08 14:09:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:09:18,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711548136] [2022-04-08 14:09:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:09:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:09:18,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:09:18,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1746880903] [2022-04-08 14:09:18,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:09:18,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:18,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:09:18,107 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:09:18,108 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:09:18,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:09:18,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:09:18,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 14:09:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:09:18,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:09:28,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-08 14:09:28,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {4192#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);~counter~0 := 0; {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #65#return; {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {4192#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {4192#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4192#true} is VALID [2022-04-08 14:09:28,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {4192#true} ~cond := #in~cond; {4218#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:09:28,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {4218#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4222#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:28,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {4222#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4222#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:09:28,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4222#(not (= |assume_abort_if_not_#in~cond| 0))} {4192#true} #59#return; {4229#(<= 1 main_~b~0)} is VALID [2022-04-08 14:09:28,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4233#(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:28,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {4233#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4233#(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:28,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {4233#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4233#(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:28,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {4233#(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)); {4192#true} is VALID [2022-04-08 14:09:28,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 14:09:28,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 14:09:28,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 14:09:28,772 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4192#true} {4233#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {4233#(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:28,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {4233#(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); {4233#(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:28,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {4233#(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)); {4261#(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:28,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {4261#(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); {4265#(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:28,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {4265#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4265#(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:28,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {4265#(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 !!(#t~post6 < 20);havoc #t~post6; {4265#(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:28,775 INFO L272 TraceCheckUtils]: 24: Hoare triple {4265#(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)); {4192#true} is VALID [2022-04-08 14:09:28,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {4192#true} ~cond := #in~cond; {4278#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:28,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {4278#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:09:28,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:09:28,776 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} {4265#(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))} #61#return; {4265#(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:28,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {4265#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4265#(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:28,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {4265#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4295#(and (= main_~z~0 main_~x~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 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 14:09:28,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {4295#(and (= main_~z~0 main_~x~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 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 14:09:28,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 14:09:28,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !!(#t~post6 < 20);havoc #t~post6; {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 14:09:28,907 INFO L272 TraceCheckUtils]: 34: Hoare triple {4299#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 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)); {4309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:09:28,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:09:28,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {4313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4193#false} is VALID [2022-04-08 14:09:28,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-08 14:09:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 14:09:28,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:10:31,119 INFO L290 TraceCheckUtils]: 37: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-08 14:10:31,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {4313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4193#false} is VALID [2022-04-08 14:10:31,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {4309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:31,124 INFO L272 TraceCheckUtils]: 34: Hoare triple {4329#(= (+ 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)); {4309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:10:31,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:10:31,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:10:31,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {4339#(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); {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:10:31,135 INFO L290 TraceCheckUtils]: 30: Hoare triple {4343#(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; {4339#(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:10:31,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {4343#(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); {4343#(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:10:31,329 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} {4192#true} #61#return; {4343#(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:10:31,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:31,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {4359#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:31,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {4192#true} ~cond := #in~cond; {4359#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:10:31,331 INFO L272 TraceCheckUtils]: 24: Hoare triple {4192#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {4192#true} assume !!(#t~post6 < 20);havoc #t~post6; {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {4192#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {4192#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); {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {4192#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {4192#true} assume !!(0 != ~y~0); {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4192#true} {4192#true} #61#return; {4192#true} is VALID [2022-04-08 14:10:31,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L272 TraceCheckUtils]: 14: Hoare triple {4192#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {4192#true} assume !!(#t~post6 < 20);havoc #t~post6; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {4192#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4192#true} {4192#true} #59#return; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 14:10:31,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {4192#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {4192#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #65#return; {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {4192#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);~counter~0 := 0; {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-08 14:10:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:10:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:10:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711548136] [2022-04-08 14:10:31,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:10:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746880903] [2022-04-08 14:10:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746880903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:10:31,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:10:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 14:10:31,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:10:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1234395671] [2022-04-08 14:10:31,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1234395671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:10:31,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:10:31,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:10:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473777950] [2022-04-08 14:10:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:10:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:10:31,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:10:31,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:10:31,477 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:10:31,477 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:10:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:10:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:10:31,478 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:10:37,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:37,083 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-04-08 14:10:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:10:37,084 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:10:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:10:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:10:37,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-08 14:10:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:10:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-08 14:10:37,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2022-04-08 14:10:37,318 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:10:37,319 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:10:37,319 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:10:37,319 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:10:37,320 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-08 14:10:37,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 164 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-08 14:10:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:10:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-04-08 14:10:37,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:10:37,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:37,393 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:37,394 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:37,395 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 14:10:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 14:10:37,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:37,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:37,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-08 14:10:37,396 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-08 14:10:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:37,397 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 14:10:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 14:10:37,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:37,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:37,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:10:37,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:10:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:10:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 14:10:37,399 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 14:10:37,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:10:37,400 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 14:10:37,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:10:37,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 14:10:48,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 65 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:10:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 14:10:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:10:48,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:10:48,124 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] [2022-04-08 14:10:48,140 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:10:48,327 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:10:48,327 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:10:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:10:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 539044694, now seen corresponding path program 3 times [2022-04-08 14:10:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [837298844] [2022-04-08 14:10:52,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:10:52,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:10:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 539044694, now seen corresponding path program 4 times [2022-04-08 14:10:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:10:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659685172] [2022-04-08 14:10:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:10:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:10:52,854 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:10:52,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1325336838] [2022-04-08 14:10:52,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:10:52,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:10:52,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:10:52,861 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:10:52,884 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:10:52,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:10:52,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:10:52,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 14:10:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:10:52,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:10:59,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {4881#true} call ULTIMATE.init(); {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {4881#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);~counter~0 := 0; {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4881#true} {4881#true} #65#return; {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {4881#true} call #t~ret7 := main(); {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {4881#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {4881#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 14:10:59,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:10:59,066 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4881#true} {4881#true} #59#return; {4881#true} is VALID [2022-04-08 14:10:59,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {4881#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:59,066 INFO L290 TraceCheckUtils]: 12: Hoare triple {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:59,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:59,067 INFO L272 TraceCheckUtils]: 14: Hoare triple {4919#(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)); {4881#true} is VALID [2022-04-08 14:10:59,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 14:10:59,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 14:10:59,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:10:59,068 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4881#true} {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #61#return; {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:10:59,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {4919#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {4944#(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:59,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {4944#(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; {4948#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 14:10:59,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {4948#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,072 INFO L272 TraceCheckUtils]: 24: Hoare triple {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4881#true} is VALID [2022-04-08 14:10:59,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {4881#true} ~cond := #in~cond; {4965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:10:59,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {4965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:59,073 INFO L290 TraceCheckUtils]: 27: Hoare triple {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:10:59,074 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #61#return; {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {4952#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4982#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 14:10:59,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {4982#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-08 14:10:59,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-08 14:10:59,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !!(#t~post6 < 20);havoc #t~post6; {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-08 14:11:01,081 WARN L272 TraceCheckUtils]: 34: Hoare triple {4986#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4996#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 14:11:01,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {4996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:11:01,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {5000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4882#false} is VALID [2022-04-08 14:11:01,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {4882#false} assume !false; {4882#false} is VALID [2022-04-08 14:11:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 14:11:01,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:13:10,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {4882#false} assume !false; {4882#false} is VALID [2022-04-08 14:13:10,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {5000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4882#false} is VALID [2022-04-08 14:13:10,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {4996#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5000#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:13:10,709 INFO L272 TraceCheckUtils]: 34: Hoare triple {5016#(= (+ 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)); {4996#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:13:10,709 INFO L290 TraceCheckUtils]: 33: Hoare triple {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:13:10,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:13:10,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {5026#(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); {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:13:10,715 INFO L290 TraceCheckUtils]: 30: Hoare triple {5030#(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)); {5026#(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:10,716 INFO L290 TraceCheckUtils]: 29: Hoare triple {5030#(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); {5030#(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:10,718 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #61#return; {5030#(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:10,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:13:10,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4969#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:13:10,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {4881#true} ~cond := #in~cond; {5047#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:13:10,719 INFO L272 TraceCheckUtils]: 24: Hoare triple {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4881#true} is VALID [2022-04-08 14:13:10,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:13:10,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:13:10,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {5060#(forall ((aux_div_v_main_~y~0_94_22 Int)) (or (and (or (<= (+ (* aux_div_v_main_~y~0_94_22 2) 1) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_94_22 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (not (= (+ 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)) (<= (+ (* aux_div_v_main_~y~0_94_22 2) 2) (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_94_22 2)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (+ (* (* aux_div_v_main_~y~0_94_22 main_~x~0) 4) main_~z~0 (* main_~x~0 4)) (* main_~b~0 main_~a~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); {5037#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 14:13:10,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {4881#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; {5060#(forall ((aux_div_v_main_~y~0_94_22 Int)) (or (and (or (<= (+ (* aux_div_v_main_~y~0_94_22 2) 1) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_94_22 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (not (= (+ 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)) (<= (+ (* aux_div_v_main_~y~0_94_22 2) 2) (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_94_22 2)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (+ (* (* aux_div_v_main_~y~0_94_22 main_~x~0) 4) main_~z~0 (* main_~x~0 4)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-08 14:13:10,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {4881#true} assume !!(0 != ~y~0); {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4881#true} {4881#true} #61#return; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L272 TraceCheckUtils]: 14: Hoare triple {4881#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {4881#true} assume !!(#t~post6 < 20);havoc #t~post6; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {4881#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {4881#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4881#true} {4881#true} #59#return; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L272 TraceCheckUtils]: 6: Hoare triple {4881#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4881#true} is VALID [2022-04-08 14:13:10,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {4881#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {4881#true} call #t~ret7 := main(); {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4881#true} {4881#true} #65#return; {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {4881#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);~counter~0 := 0; {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {4881#true} call ULTIMATE.init(); {4881#true} is VALID [2022-04-08 14:13:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 14:13:10,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:13:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659685172] [2022-04-08 14:13:10,746 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:13:10,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325336838] [2022-04-08 14:13:10,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325336838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:13:10,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:13:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-08 14:13:10,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:13:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [837298844] [2022-04-08 14:13:10,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [837298844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:13:10,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:13:10,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:13:10,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938461189] [2022-04-08 14:13:10,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:13:10,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:13:10,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:13:10,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:13:11,275 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:13:11,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:13:11,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:13:11,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:13:11,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=244, Unknown=1, NotChecked=0, Total=306 [2022-04-08 14:13:11,277 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:13:18,068 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:19,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:13:27,431 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:30,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:13:33,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:13:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:38,330 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-04-08 14:13:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:13:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:13:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:13:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:13:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 14:13:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:13:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 14:13:38,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-08 14:13:40,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:13:40,722 INFO L225 Difference]: With dead ends: 78 [2022-04-08 14:13:40,722 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:13:40,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=74, Invalid=305, Unknown=1, NotChecked=0, Total=380 [2022-04-08 14:13:40,722 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-08 14:13:40,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 175 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 2 Unknown, 0 Unchecked, 12.9s Time] [2022-04-08 14:13:40,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:13:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-04-08 14:13:40,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:13:40,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:13:40,803 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:13:40,803 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:13:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:40,805 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 14:13:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 14:13:40,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:13:40,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:13:40,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-08 14:13:40,806 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 76 states. [2022-04-08 14:13:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:13:40,807 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 14:13:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 14:13:40,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:13:40,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:13:40,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:13:40,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:13:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:13:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 14:13:40,809 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 14:13:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:13:40,809 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 14:13:40,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:13:40,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 14:13:52,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 65 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:13:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 14:13:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 14:13:52,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:13:52,640 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:13:52,656 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:13:52,841 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:13:52,841 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:13:52,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:13:52,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1348391320, now seen corresponding path program 3 times [2022-04-08 14:13:52,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:13:52,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265922106] [2022-04-08 14:13:54,886 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:13:54,886 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:13:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1348391320, now seen corresponding path program 4 times [2022-04-08 14:13:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:13:54,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327537047] [2022-04-08 14:13:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:13:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:13:54,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:13:54,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833349170] [2022-04-08 14:13:54,897 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:13:54,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:13:54,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:13:54,902 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:13:54,902 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:13:54,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:13:54,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:13:54,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 14:13:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:13:54,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:14:06,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {5568#true} call ULTIMATE.init(); {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#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);~counter~0 := 0; {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5568#true} #65#return; {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {5568#true} call #t~ret7 := main(); {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {5568#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {5568#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5568#true} is VALID [2022-04-08 14:14:06,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 14:14:06,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 14:14:06,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:14:06,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5568#true} {5568#true} #59#return; {5568#true} is VALID [2022-04-08 14:14:06,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {5568#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:06,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:06,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:06,142 INFO L272 TraceCheckUtils]: 14: Hoare triple {5606#(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)); {5568#true} is VALID [2022-04-08 14:14:06,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 14:14:06,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 14:14:06,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:14:06,143 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5568#true} {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #61#return; {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 14:14:06,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {5606#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {5631#(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:14:06,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {5631#(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; {5635#(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:14:06,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {5635#(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); {5639#(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:14:06,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {5639#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5639#(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:14:06,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {5639#(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 !!(#t~post6 < 20);havoc #t~post6; {5639#(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:14:06,146 INFO L272 TraceCheckUtils]: 24: Hoare triple {5639#(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)); {5568#true} is VALID [2022-04-08 14:14:06,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {5568#true} ~cond := #in~cond; {5652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:14:06,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {5652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:06,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:14:06,148 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} {5639#(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))} #61#return; {5639#(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:14:06,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {5639#(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); {5666#(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:14:06,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {5666#(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; {5670#(and (<= 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)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:14:06,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {5670#(and (<= 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)) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 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); {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:14:06,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:14:06,152 INFO L290 TraceCheckUtils]: 33: Hoare triple {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} assume !!(#t~post6 < 20);havoc #t~post6; {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:14:06,592 INFO L272 TraceCheckUtils]: 34: Hoare triple {5674#(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)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5684#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:14:06,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {5684#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5688#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:14:06,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {5688#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5569#false} is VALID [2022-04-08 14:14:06,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-04-08 14:14:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 14:14:06,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:15:19,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-04-08 14:15:19,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {5688#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5569#false} is VALID [2022-04-08 14:15:19,464 INFO L290 TraceCheckUtils]: 35: Hoare triple {5684#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5688#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:15:19,464 INFO L272 TraceCheckUtils]: 34: Hoare triple {5704#(= (+ 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)); {5684#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:15:19,465 INFO L290 TraceCheckUtils]: 33: Hoare triple {5704#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 20);havoc #t~post6; {5704#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:15:19,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {5704#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5704#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:15:19,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {5714#(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); {5704#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 14:15:19,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {5718#(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; {5714#(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:15:19,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {5718#(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); {5718#(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:15:21,497 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} {5568#true} #61#return; {5718#(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:15:21,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:15:21,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {5734#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:15:21,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {5568#true} ~cond := #in~cond; {5734#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:15:21,502 INFO L272 TraceCheckUtils]: 24: Hoare triple {5568#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5568#true} is VALID [2022-04-08 14:15:21,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {5568#true} assume !!(#t~post6 < 20);havoc #t~post6; {5568#true} is VALID [2022-04-08 14:15:21,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {5568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5568#true} is VALID [2022-04-08 14:15:21,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {5568#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); {5568#true} is VALID [2022-04-08 14:15:21,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {5568#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; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {5568#true} assume !!(0 != ~y~0); {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5568#true} {5568#true} #61#return; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L272 TraceCheckUtils]: 14: Hoare triple {5568#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#true} assume !!(#t~post6 < 20);havoc #t~post6; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {5568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {5568#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5568#true} is VALID [2022-04-08 14:15:21,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5568#true} {5568#true} #59#return; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L272 TraceCheckUtils]: 6: Hoare triple {5568#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {5568#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {5568#true} call #t~ret7 := main(); {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5568#true} #65#return; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {5568#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);~counter~0 := 0; {5568#true} is VALID [2022-04-08 14:15:21,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {5568#true} call ULTIMATE.init(); {5568#true} is VALID [2022-04-08 14:15:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:15:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:15:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327537047] [2022-04-08 14:15:21,507 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:15:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833349170] [2022-04-08 14:15:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833349170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:15:21,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:15:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 14:15:21,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:15:21,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265922106] [2022-04-08 14:15:21,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265922106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:15:21,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:15:21,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:15:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918627365] [2022-04-08 14:15:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:15:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:15:21,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:15:21,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:15:21,953 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:15:21,953 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:15:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:15:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:15:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=218, Unknown=4, NotChecked=0, Total=272 [2022-04-08 14:15:21,954 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:15:29,736 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:38,161 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:47,239 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:51,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:15:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:53,799 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 14:15:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 14:15:53,799 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-08 14:15:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:15:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:15:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 14:15:53,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:15:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-08 14:15:53,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-08 14:15:55,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:15:55,693 INFO L225 Difference]: With dead ends: 76 [2022-04-08 14:15:55,693 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 14:15:55,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=63, Invalid=275, Unknown=4, NotChecked=0, Total=342 [2022-04-08 14:15:55,694 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-04-08 14:15:55,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 209 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 16.6s Time] [2022-04-08 14:15:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 14:15:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-04-08 14:15:55,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:15:55,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:15:55,770 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:15:55,770 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:15:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:55,772 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-08 14:15:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-04-08 14:15:55,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:15:55,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:15:55,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 74 states. [2022-04-08 14:15:55,773 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 74 states. [2022-04-08 14:15:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:15:55,774 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-08 14:15:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-04-08 14:15:55,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:15:55,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:15:55,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:15:55,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:15:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:15:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-08 14:15:55,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 38 [2022-04-08 14:15:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:15:55,776 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-08 14:15:55,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 14:15:55,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-08 14:16:06,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 51 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-08 14:16:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 14:16:06,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:06,313 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 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:06,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:06,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 14:16:06,514 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:06,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1258071893, now seen corresponding path program 5 times [2022-04-08 14:16:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:06,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423196238] [2022-04-08 14:16:10,566 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:10,566 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:10,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1258071893, now seen corresponding path program 6 times [2022-04-08 14:16:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:10,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600640413] [2022-04-08 14:16:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:10,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:10,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726404299] [2022-04-08 14:16:10,596 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:10,597 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 14:16:10,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:10,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:10,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:16:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:10,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:16:10,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {6220#true} call ULTIMATE.init(); {6220#true} is VALID [2022-04-08 14:16:10,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {6220#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);~counter~0 := 0; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {6228#(<= ~counter~0 0)} assume true; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6228#(<= ~counter~0 0)} {6220#true} #65#return; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {6228#(<= ~counter~0 0)} call #t~ret7 := main(); {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {6228#(<= ~counter~0 0)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {6228#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {6228#(<= ~counter~0 0)} ~cond := #in~cond; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {6228#(<= ~counter~0 0)} assume !(0 == ~cond); {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {6228#(<= ~counter~0 0)} assume true; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6228#(<= ~counter~0 0)} {6228#(<= ~counter~0 0)} #59#return; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {6228#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6228#(<= ~counter~0 0)} is VALID [2022-04-08 14:16:10,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {6228#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {6262#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,859 INFO L272 TraceCheckUtils]: 14: Hoare triple {6262#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {6262#(<= ~counter~0 1)} ~cond := #in~cond; {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {6262#(<= ~counter~0 1)} assume !(0 == ~cond); {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {6262#(<= ~counter~0 1)} assume true; {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,860 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6262#(<= ~counter~0 1)} {6262#(<= ~counter~0 1)} #61#return; {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {6262#(<= ~counter~0 1)} assume !!(0 != ~y~0); {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {6262#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {6262#(<= ~counter~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); {6262#(<= ~counter~0 1)} is VALID [2022-04-08 14:16:10,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {6262#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {6293#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,863 INFO L272 TraceCheckUtils]: 24: Hoare triple {6293#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {6293#(<= ~counter~0 2)} ~cond := #in~cond; {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {6293#(<= ~counter~0 2)} assume !(0 == ~cond); {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {6293#(<= ~counter~0 2)} assume true; {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,866 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6293#(<= ~counter~0 2)} {6293#(<= ~counter~0 2)} #61#return; {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {6293#(<= ~counter~0 2)} assume !!(0 != ~y~0); {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {6293#(<= ~counter~0 2)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {6293#(<= ~counter~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); {6293#(<= ~counter~0 2)} is VALID [2022-04-08 14:16:10,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {6293#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {6324#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,868 INFO L272 TraceCheckUtils]: 34: Hoare triple {6324#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {6324#(<= ~counter~0 3)} ~cond := #in~cond; {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {6324#(<= ~counter~0 3)} assume !(0 == ~cond); {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {6324#(<= ~counter~0 3)} assume true; {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,869 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6324#(<= ~counter~0 3)} {6324#(<= ~counter~0 3)} #61#return; {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {6324#(<= ~counter~0 3)} assume !!(0 != ~y~0); {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {6324#(<= ~counter~0 3)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {6324#(<= ~counter~0 3)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6324#(<= ~counter~0 3)} is VALID [2022-04-08 14:16:10,870 INFO L290 TraceCheckUtils]: 42: Hoare triple {6324#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6355#(<= |main_#t~post6| 3)} is VALID [2022-04-08 14:16:10,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {6355#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {6221#false} is VALID [2022-04-08 14:16:10,871 INFO L272 TraceCheckUtils]: 44: Hoare triple {6221#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {6221#false} is VALID [2022-04-08 14:16:10,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {6221#false} ~cond := #in~cond; {6221#false} is VALID [2022-04-08 14:16:10,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {6221#false} assume 0 == ~cond; {6221#false} is VALID [2022-04-08 14:16:10,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {6221#false} assume !false; {6221#false} is VALID [2022-04-08 14:16:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:16:10,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:16:11,114 INFO L290 TraceCheckUtils]: 47: Hoare triple {6221#false} assume !false; {6221#false} is VALID [2022-04-08 14:16:11,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {6221#false} assume 0 == ~cond; {6221#false} is VALID [2022-04-08 14:16:11,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {6221#false} ~cond := #in~cond; {6221#false} is VALID [2022-04-08 14:16:11,114 INFO L272 TraceCheckUtils]: 44: Hoare triple {6221#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {6221#false} is VALID [2022-04-08 14:16:11,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {6383#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {6221#false} is VALID [2022-04-08 14:16:11,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {6387#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6383#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:16:11,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {6387#(< ~counter~0 20)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,116 INFO L290 TraceCheckUtils]: 40: Hoare triple {6387#(< ~counter~0 20)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {6387#(< ~counter~0 20)} assume !!(0 != ~y~0); {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,116 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6220#true} {6387#(< ~counter~0 20)} #61#return; {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {6220#true} assume true; {6220#true} is VALID [2022-04-08 14:16:11,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {6220#true} assume !(0 == ~cond); {6220#true} is VALID [2022-04-08 14:16:11,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {6220#true} ~cond := #in~cond; {6220#true} is VALID [2022-04-08 14:16:11,117 INFO L272 TraceCheckUtils]: 34: Hoare triple {6387#(< ~counter~0 20)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6220#true} is VALID [2022-04-08 14:16:11,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {6387#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {6418#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6387#(< ~counter~0 20)} is VALID [2022-04-08 14:16:11,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {6418#(< ~counter~0 19)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {6418#(< ~counter~0 19)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {6418#(< ~counter~0 19)} assume !!(0 != ~y~0); {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,134 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6220#true} {6418#(< ~counter~0 19)} #61#return; {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {6220#true} assume true; {6220#true} is VALID [2022-04-08 14:16:11,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {6220#true} assume !(0 == ~cond); {6220#true} is VALID [2022-04-08 14:16:11,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {6220#true} ~cond := #in~cond; {6220#true} is VALID [2022-04-08 14:16:11,134 INFO L272 TraceCheckUtils]: 24: Hoare triple {6418#(< ~counter~0 19)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6220#true} is VALID [2022-04-08 14:16:11,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {6418#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {6449#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6418#(< ~counter~0 19)} is VALID [2022-04-08 14:16:11,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {6449#(< ~counter~0 18)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,136 INFO L290 TraceCheckUtils]: 20: Hoare triple {6449#(< ~counter~0 18)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {6449#(< ~counter~0 18)} assume !!(0 != ~y~0); {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,137 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6220#true} {6449#(< ~counter~0 18)} #61#return; {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {6220#true} assume true; {6220#true} is VALID [2022-04-08 14:16:11,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {6220#true} assume !(0 == ~cond); {6220#true} is VALID [2022-04-08 14:16:11,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {6220#true} ~cond := #in~cond; {6220#true} is VALID [2022-04-08 14:16:11,138 INFO L272 TraceCheckUtils]: 14: Hoare triple {6449#(< ~counter~0 18)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6220#true} is VALID [2022-04-08 14:16:11,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {6449#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {6480#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6449#(< ~counter~0 18)} is VALID [2022-04-08 14:16:11,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {6480#(< ~counter~0 17)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6220#true} {6480#(< ~counter~0 17)} #59#return; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {6220#true} assume true; {6220#true} is VALID [2022-04-08 14:16:11,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {6220#true} assume !(0 == ~cond); {6220#true} is VALID [2022-04-08 14:16:11,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {6220#true} ~cond := #in~cond; {6220#true} is VALID [2022-04-08 14:16:11,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {6480#(< ~counter~0 17)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6220#true} is VALID [2022-04-08 14:16:11,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {6480#(< ~counter~0 17)} 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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {6480#(< ~counter~0 17)} call #t~ret7 := main(); {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6480#(< ~counter~0 17)} {6220#true} #65#return; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {6480#(< ~counter~0 17)} assume true; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {6220#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);~counter~0 := 0; {6480#(< ~counter~0 17)} is VALID [2022-04-08 14:16:11,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {6220#true} call ULTIMATE.init(); {6220#true} is VALID [2022-04-08 14:16:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:16:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:16:11,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600640413] [2022-04-08 14:16:11,142 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:16:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726404299] [2022-04-08 14:16:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726404299] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:16:11,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:16:11,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:16:11,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:16:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423196238] [2022-04-08 14:16:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423196238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:16:11,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:16:11,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:16:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101361059] [2022-04-08 14:16:11,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:16:11,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 48 [2022-04-08 14:16:11,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:16:11,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:11,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:16:11,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:11,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:16:11,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:16:11,180 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:11,351 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-08 14:16:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:16:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 48 [2022-04-08 14:16:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:16:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-08 14:16:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-08 14:16:11,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-08 14:16:11,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:11,407 INFO L225 Difference]: With dead ends: 64 [2022-04-08 14:16:11,408 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 14:16:11,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 14:16:11,409 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:16:11,409 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:16:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 14:16:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 14:16:11,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:16:11,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:11,492 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:11,492 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:11,494 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-08 14:16:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 14:16:11,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:11,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:11,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-08 14:16:11,494 INFO L87 Difference]: Start difference. First operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-08 14:16:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:16:11,496 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-08 14:16:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 14:16:11,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:16:11,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:16:11,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:16:11,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:16:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:16:11,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-08 14:16:11,497 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 48 [2022-04-08 14:16:11,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:16:11,498 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-08 14:16:11,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:16:11,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-08 14:16:21,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 57 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:16:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 14:16:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 14:16:21,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:16:21,696 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:16:21,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 14:16:21,899 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 14:16:21,899 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:16:21,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:16:21,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1256284433, now seen corresponding path program 5 times [2022-04-08 14:16:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:16:21,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2086154214] [2022-04-08 14:16:24,267 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:16:24,267 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:16:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1256284433, now seen corresponding path program 6 times [2022-04-08 14:16:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:16:24,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123185575] [2022-04-08 14:16:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:16:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:16:24,277 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:16:24,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694871961] [2022-04-08 14:16:24,278 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:16:24,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:16:24,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:16:24,283 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:16:24,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 14:16:24,327 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:16:24,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:16:24,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 14:16:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:16:24,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:17:01,604 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 14:18:49,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {6881#true} call ULTIMATE.init(); {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {6881#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);~counter~0 := 0; {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {6881#true} assume true; {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6881#true} {6881#true} #65#return; {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {6881#true} call #t~ret7 := main(); {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {6881#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;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {6881#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6881#true} is VALID [2022-04-08 14:18:49,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {6881#true} ~cond := #in~cond; {6907#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:18:49,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {6907#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6911#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:18:49,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {6911#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6911#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:18:49,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6911#(not (= |assume_abort_if_not_#in~cond| 0))} {6881#true} #59#return; {6918#(<= 1 main_~b~0)} is VALID [2022-04-08 14:18:49,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {6918#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6922#(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:18:49,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {6922#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6922#(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:18:49,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {6922#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {6922#(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:18:49,825 INFO L272 TraceCheckUtils]: 14: Hoare triple {6922#(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)); {6881#true} is VALID [2022-04-08 14:18:49,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {6881#true} ~cond := #in~cond; {6881#true} is VALID [2022-04-08 14:18:49,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {6881#true} assume !(0 == ~cond); {6881#true} is VALID [2022-04-08 14:18:49,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {6881#true} assume true; {6881#true} is VALID [2022-04-08 14:18:49,826 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6881#true} {6922#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #61#return; {6922#(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:18:49,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {6922#(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); {6922#(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:18:49,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {6922#(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)); {6950#(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:18:49,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {6950#(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); {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(#t~post6 < 20);havoc #t~post6; {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,830 INFO L272 TraceCheckUtils]: 24: Hoare triple {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~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)); {6881#true} is VALID [2022-04-08 14:18:49,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {6881#true} ~cond := #in~cond; {6881#true} is VALID [2022-04-08 14:18:49,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {6881#true} assume !(0 == ~cond); {6881#true} is VALID [2022-04-08 14:18:49,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {6881#true} assume true; {6881#true} is VALID [2022-04-08 14:18:49,831 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6881#true} {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #61#return; {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {6954#(and (= main_~z~0 0) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6982#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (<= (div main_~b~0 2) main_~y~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {6982#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (<= (div main_~b~0 2) main_~y~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); {6986#(and (exists ((aux_div_v_main_~y~0_123_23 Int) (aux_mod_v_main_~y~0_123_23 Int)) (and (< aux_mod_v_main_~y~0_123_23 2) (<= 0 aux_mod_v_main_~y~0_123_23) (not (= aux_mod_v_main_~y~0_123_23 1)) (<= (div main_~b~0 2) (+ (* 2 aux_div_v_main_~y~0_123_23) aux_mod_v_main_~y~0_123_23)) (<= (div (+ (* 2 aux_div_v_main_~y~0_123_23) aux_mod_v_main_~y~0_123_23) 2) main_~y~0))) (= main_~z~0 0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {6986#(and (exists ((aux_div_v_main_~y~0_123_23 Int) (aux_mod_v_main_~y~0_123_23 Int)) (and (< aux_mod_v_main_~y~0_123_23 2) (<= 0 aux_mod_v_main_~y~0_123_23) (not (= aux_mod_v_main_~y~0_123_23 1)) (<= (div main_~b~0 2) (+ (* 2 aux_div_v_main_~y~0_123_23) aux_mod_v_main_~y~0_123_23)) (<= (div (+ (* 2 aux_div_v_main_~y~0_123_23) aux_mod_v_main_~y~0_123_23) 2) main_~y~0))) (= main_~z~0 0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6990#(and (= main_~z~0 0) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {6990#(and (= main_~z~0 0) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(#t~post6 < 20);havoc #t~post6; {6990#(and (= main_~z~0 0) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,841 INFO L272 TraceCheckUtils]: 34: Hoare triple {6990#(and (= main_~z~0 0) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (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)); {6881#true} is VALID [2022-04-08 14:18:49,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {6881#true} ~cond := #in~cond; {7000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:18:49,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {7000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {7004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:18:49,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {7004#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {7004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:18:49,843 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7004#(not (= |__VERIFIER_assert_#in~cond| 0))} {6990#(and (= main_~z~0 0) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #61#return; {7011#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {7011#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {7011#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {7011#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (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)); {7018#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~y~0 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 14:18:49,870 INFO L290 TraceCheckUtils]: 41: Hoare triple {7018#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ main_~y~0 1)) (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); {7022#(and (= main_~z~0 0) (exists ((aux_div_v_main_~y~0_124_23 Int) (aux_mod_v_main_~y~0_124_23 Int)) (and (<= 0 aux_mod_v_main_~y~0_124_23) (= (+ main_~z~0 (* (div main_~x~0 2) (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23 1)) (= (div (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23) 2) main_~y~0) (< aux_mod_v_main_~y~0_124_23 2) (not (= aux_mod_v_main_~y~0_124_23 1)))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:18:50,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {7022#(and (= main_~z~0 0) (exists ((aux_div_v_main_~y~0_124_23 Int) (aux_mod_v_main_~y~0_124_23 Int)) (and (<= 0 aux_mod_v_main_~y~0_124_23) (= (+ main_~z~0 (* (div main_~x~0 2) (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div main_~b~0 2)) (- 2)) (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23 1)) (= (div (+ (* 2 aux_div_v_main_~y~0_124_23) aux_mod_v_main_~y~0_124_23) 2) main_~y~0) (< aux_mod_v_main_~y~0_124_23 2) (not (= aux_mod_v_main_~y~0_124_23 1)))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7026#(and (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* 2 (* (div main_~x~0 2) main_~y~0)))) (= main_~z~0 0) (< (div (* (div (* (- 1) (div main_~b~0 2)) (- 2)) (- 1)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:18:50,758 INFO L290 TraceCheckUtils]: 43: Hoare triple {7026#(and (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* 2 (* (div main_~x~0 2) main_~y~0)))) (= main_~z~0 0) (< (div (* (div (* (- 1) (div main_~b~0 2)) (- 2)) (- 1)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {7026#(and (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* 2 (* (div main_~x~0 2) main_~y~0)))) (= main_~z~0 0) (< (div (* (div (* (- 1) (div main_~b~0 2)) (- 2)) (- 1)) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 14:18:50,805 INFO L272 TraceCheckUtils]: 44: Hoare triple {7026#(and (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* 2 (* (div main_~x~0 2) main_~y~0)))) (= main_~z~0 0) (< (div (* (div (* (- 1) (div main_~b~0 2)) (- 2)) (- 1)) (- 2)) (+ main_~y~0 1)) (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)); {7033#(exists ((v_main_~a~0_BEFORE_CALL_48 Int) (aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 Int) (aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 Int) (aux_div_v_main_~x~0_BEFORE_CALL_46_34 Int) (v_main_~y~0_BEFORE_CALL_49 Int) (aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 Int) (aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 Int)) (and (<= (+ (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 2) (* aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 4) 1) (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (* aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 8) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45)) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45)) (<= 0 aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) (not (= aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 1)) (= (+ (* (* v_main_~a~0_BEFORE_CALL_48 aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) 8) (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (* 2 (* v_main_~a~0_BEFORE_CALL_48 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45))) (+ (* 2 (* (div (* aux_div_v_main_~x~0_BEFORE_CALL_46_34 2) 2) v_main_~y~0_BEFORE_CALL_49)) (* (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59) 2) (* (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) 4))) (< aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 2) (<= 1 |__VERIFIER_assert_#in~cond|) (< aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 2) (< (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) 2) (<= 0 aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (<= 0 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59) (< aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 2) (< aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 (+ v_main_~y~0_BEFORE_CALL_49 1))))} is VALID [2022-04-08 14:18:50,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {7033#(exists ((v_main_~a~0_BEFORE_CALL_48 Int) (aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 Int) (aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 Int) (aux_div_v_main_~x~0_BEFORE_CALL_46_34 Int) (v_main_~y~0_BEFORE_CALL_49 Int) (aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 Int) (aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 Int)) (and (<= (+ (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 2) (* aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 4) 1) (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (* aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 8) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45)) (<= 0 (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45)) (<= 0 aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) (not (= aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 1)) (= (+ (* (* v_main_~a~0_BEFORE_CALL_48 aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) 8) (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (* 2 (* v_main_~a~0_BEFORE_CALL_48 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45))) (+ (* 2 (* (div (* aux_div_v_main_~x~0_BEFORE_CALL_46_34 2) 2) v_main_~y~0_BEFORE_CALL_49)) (* (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59) 2) (* (* v_main_~a~0_BEFORE_CALL_48 aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70) 4))) (< aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59 2) (<= 1 |__VERIFIER_assert_#in~cond|) (< aux_mod_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 2) (< (+ (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) 2) (<= 0 aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45) (<= 0 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59) (< aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_57_34_45 2) (< aux_div_aux_div_aux_div_v_main_~b~0_BEFORE_CALL_57_34_59_70 (+ v_main_~y~0_BEFORE_CALL_49 1))))} ~cond := #in~cond; {7037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:18:50,806 INFO L290 TraceCheckUtils]: 46: Hoare triple {7037#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6882#false} is VALID [2022-04-08 14:18:50,806 INFO L290 TraceCheckUtils]: 47: Hoare triple {6882#false} assume !false; {6882#false} is VALID [2022-04-08 14:18:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:18:50,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:19:26,323 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful