/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:31:25,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:31:25,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:31:25,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:31:25,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:31:25,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:31:25,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:31:25,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:31:25,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:31:25,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:31:25,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:31:25,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:31:25,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:31:25,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:31:25,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:31:25,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:31:25,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:31:25,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:31:25,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:31:25,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:31:25,549 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:31:25,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:31:25,550 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:31:25,551 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:31:25,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:31:25,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:31:25,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:31:25,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:31:25,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:31:25,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:31:25,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:31:25,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:31:25,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:31:25,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:31:25,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:31:25,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:31:25,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:31:25,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:31:25,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:31:25,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:31:25,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:31:25,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:31:25,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:31:25,594 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:31:25,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:31:25,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:31:25,595 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:31:25,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:31:25,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:31:25,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:31:25,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:31:25,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:31:25,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:31:25,597 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:31:25,597 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 07:31:25,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:31:25,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:31:25,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:31:25,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:31:25,835 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:31:25,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound50.c [2022-04-08 07:31:25,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ede52149/8fb4f58cf2d141ebb84cd2d9bde55fc1/FLAG93362ce1f [2022-04-08 07:31:26,238 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:31:26,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_unwindbound50.c [2022-04-08 07:31:26,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ede52149/8fb4f58cf2d141ebb84cd2d9bde55fc1/FLAG93362ce1f [2022-04-08 07:31:26,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ede52149/8fb4f58cf2d141ebb84cd2d9bde55fc1 [2022-04-08 07:31:26,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:31:26,699 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:31:26,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:31:26,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:31:26,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:31:26,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55223eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26, skipping insertion in model container [2022-04-08 07:31:26,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:31:26,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:31:26,830 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_unwindbound50.c[537,550] [2022-04-08 07:31:26,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:31:26,858 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:31:26,865 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_unwindbound50.c[537,550] [2022-04-08 07:31:26,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:31:26,876 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:31:26,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26 WrapperNode [2022-04-08 07:31:26,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:31:26,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:31:26,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:31:26,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:31:26,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,887 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:31:26,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:31:26,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:31:26,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:31:26,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (1/1) ... [2022-04-08 07:31:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:31:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:26,929 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 07:31:26,934 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 07:31:26,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:31:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:31:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:31:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:31:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:31:26,963 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:31:26,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:31:26,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:31:27,023 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:31:27,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:31:27,132 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:31:27,136 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:31:27,136 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:31:27,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:31:27 BoogieIcfgContainer [2022-04-08 07:31:27,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:31:27,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:31:27,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:31:27,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:31:27,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:31:26" (1/3) ... [2022-04-08 07:31:27,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607bf8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:31:27, skipping insertion in model container [2022-04-08 07:31:27,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:31:26" (2/3) ... [2022-04-08 07:31:27,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607bf8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:31:27, skipping insertion in model container [2022-04-08 07:31:27,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:31:27" (3/3) ... [2022-04-08 07:31:27,143 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_unwindbound50.c [2022-04-08 07:31:27,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:31:27,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:31:27,209 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:31:27,213 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 07:31:27,213 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:31:27,235 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 07:31:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 07:31:27,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:27,240 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 07:31:27,241 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 1 times [2022-04-08 07:31:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:27,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [330803006] [2022-04-08 07:31:27,258 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:31:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1523633710, now seen corresponding path program 2 times [2022-04-08 07:31:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:27,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31688184] [2022-04-08 07:31:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:27,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:31:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:27,440 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 07:31:27,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 07:31:27,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-08 07:31:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:31:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:27,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 07:31:27,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 07:31:27,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 07:31:27,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-08 07:31:27,459 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 07:31:27,459 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 07:31:27,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 07:31:27,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #65#return; {33#true} is VALID [2022-04-08 07:31:27,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-08 07:31:27,460 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 07:31:27,460 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 07:31:27,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 07:31:27,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 07:31:27,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 07:31:27,462 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-08 07:31:27,462 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 07:31:27,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 07:31:27,463 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 07:31:27,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 07:31:27,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 07:31:27,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 07:31:27,465 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 07:31:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:31:27,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31688184] [2022-04-08 07:31:27,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31688184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:27,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:27,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:31:27,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:31:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [330803006] [2022-04-08 07:31:27,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [330803006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:27,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:27,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:31:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817870757] [2022-04-08 07:31:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:31:27,474 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 07:31:27,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:31:27,477 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 07:31:27,502 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 07:31:27,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:31:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:27,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:31:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:31:27,526 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 07:31:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:27,664 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-08 07:31:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:31:27,665 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 07:31:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:31:27,666 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 07:31:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 07:31:27,672 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 07:31:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 07:31:27,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-08 07:31:27,732 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 07:31:27,738 INFO L225 Difference]: With dead ends: 52 [2022-04-08 07:31:27,738 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 07:31:27,740 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 07:31:27,742 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 07:31:27,742 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 07:31:27,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 07:31:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 07:31:27,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:31:27,772 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 07:31:27,773 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 07:31:27,773 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 07:31:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:27,776 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:31:27,776 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:31:27,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:27,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:27,777 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 07:31:27,777 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 07:31:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:27,780 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-08 07:31:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-08 07:31:27,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:27,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:27,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:31:27,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:31:27,781 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 07:31:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 07:31:27,784 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-08 07:31:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:31:27,784 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 07:31:27,784 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 07:31:27,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 07:31:27,820 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 07:31:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 07:31:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:31:27,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:27,821 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 07:31:27,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:31:27,822 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:27,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 1 times [2022-04-08 07:31:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082917914] [2022-04-08 07:31:27,823 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:31:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -991958694, now seen corresponding path program 2 times [2022-04-08 07:31:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:27,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154072630] [2022-04-08 07:31:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:27,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:31:27,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197826129] [2022-04-08 07:31:27,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:31:27,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:31:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:27,839 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 07:31:27,840 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 07:31:27,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:31:27,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:31:27,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 07:31:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:27,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:31:27,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 07:31:27,997 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 07:31:27,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:27,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {259#(<= ~counter~0 0)} {251#true} #65#return; {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:27,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {259#(<= ~counter~0 0)} call #t~ret7 := main(); {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:27,999 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 07:31:27,999 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 07:31:28,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {259#(<= ~counter~0 0)} ~cond := #in~cond; {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:28,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {259#(<= ~counter~0 0)} assume !(0 == ~cond); {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:28,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(<= ~counter~0 0)} assume true; {259#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:28,001 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 07:31:28,002 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 07:31:28,002 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 07:31:28,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {252#false} is VALID [2022-04-08 07:31:28,003 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 07:31:28,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 07:31:28,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 07:31:28,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 07:31:28,004 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 07:31:28,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:31:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:31:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154072630] [2022-04-08 07:31:28,004 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:31:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197826129] [2022-04-08 07:31:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197826129] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:28,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:28,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:31:28,005 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:31:28,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082917914] [2022-04-08 07:31:28,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082917914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:28,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:28,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 07:31:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474232008] [2022-04-08 07:31:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:31:28,007 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 07:31:28,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:31:28,007 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 07:31:28,020 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 07:31:28,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 07:31:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 07:31:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 07:31:28,021 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 07:31:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,068 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 07:31:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 07:31:28,069 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 07:31:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:31:28,069 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 07:31:28,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 07:31:28,071 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 07:31:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-08 07:31:28,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-08 07:31:28,101 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 07:31:28,102 INFO L225 Difference]: With dead ends: 34 [2022-04-08 07:31:28,103 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 07:31:28,103 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 07:31:28,104 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 07:31:28,104 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 07:31:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 07:31:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 07:31:28,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:31:28,114 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 07:31:28,115 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 07:31:28,115 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 07:31:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,117 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 07:31:28,117 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 07:31:28,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:28,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:28,117 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 07:31:28,118 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 07:31:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,119 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 07:31:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 07:31:28,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:28,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:28,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:31:28,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:31:28,120 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 07:31:28,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-08 07:31:28,121 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 18 [2022-04-08 07:31:28,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:31:28,122 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-08 07:31:28,122 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 07:31:28,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-08 07:31:28,145 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 07:31:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 07:31:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 07:31:28,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:28,146 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 07:31:28,179 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 07:31:28,366 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 07:31:28,366 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 1 times [2022-04-08 07:31:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:28,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [608846260] [2022-04-08 07:31:28,367 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:31:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -990171234, now seen corresponding path program 2 times [2022-04-08 07:31:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400696511] [2022-04-08 07:31:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:28,379 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:31:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908673143] [2022-04-08 07:31:28,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:31:28,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:31:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:28,381 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 07:31:28,415 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 07:31:28,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:31:28,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:31:28,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 07:31:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:28,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:31:28,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} call ULTIMATE.init(); {484#true} is VALID [2022-04-08 07:31:28,551 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 07:31:28,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 07:31:28,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} #65#return; {484#true} is VALID [2022-04-08 07:31:28,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} call #t~ret7 := main(); {484#true} is VALID [2022-04-08 07:31:28,552 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 07:31:28,552 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 07:31:28,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {484#true} ~cond := #in~cond; {484#true} is VALID [2022-04-08 07:31:28,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#true} assume !(0 == ~cond); {484#true} is VALID [2022-04-08 07:31:28,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#true} assume true; {484#true} is VALID [2022-04-08 07:31:28,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {484#true} {484#true} #59#return; {484#true} is VALID [2022-04-08 07:31:28,553 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 07:31:28,553 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 07:31:28,554 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 < 50);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 07:31:28,555 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 07:31:28,555 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 07:31:28,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {485#false} is VALID [2022-04-08 07:31:28,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {485#false} assume !false; {485#false} is VALID [2022-04-08 07:31:28,557 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 07:31:28,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:31:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:31:28,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400696511] [2022-04-08 07:31:28,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:31:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908673143] [2022-04-08 07:31:28,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908673143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:28,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:28,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:31:28,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:31:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [608846260] [2022-04-08 07:31:28,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [608846260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:28,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:28,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:31:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026481245] [2022-04-08 07:31:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:31:28,559 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 07:31:28,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:31:28,560 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 07:31:28,572 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 07:31:28,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:31:28,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:31:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:31:28,573 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 07:31:28,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,723 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-04-08 07:31:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:31:28,723 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 07:31:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:31:28,724 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 07:31:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-08 07:31:28,725 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 07:31:28,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-08 07:31:28,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-08 07:31:28,753 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 07:31:28,758 INFO L225 Difference]: With dead ends: 38 [2022-04-08 07:31:28,758 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:31:28,759 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 07:31:28,765 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 07:31:28,765 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 07:31:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:31:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-04-08 07:31:28,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:31:28,784 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 07:31:28,784 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 07:31:28,786 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 07:31:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,791 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:31:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 07:31:28,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:28,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:28,792 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 07:31:28,793 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 07:31:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:28,794 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:31:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 07:31:28,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:28,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:28,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:31:28,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:31:28,795 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 07:31:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-08 07:31:28,796 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2022-04-08 07:31:28,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:31:28,796 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-08 07:31:28,797 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 07:31:28,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-08 07:31:28,825 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 07:31:28,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-08 07:31:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 07:31:28,827 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:28,827 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 07:31:28,845 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 07:31:29,043 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 07:31:29,043 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 1 times [2022-04-08 07:31:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:29,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006196248] [2022-04-08 07:31:29,045 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:31:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1094479982, now seen corresponding path program 2 times [2022-04-08 07:31:29,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:29,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911674453] [2022-04-08 07:31:29,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:29,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:29,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:31:29,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984176145] [2022-04-08 07:31:29,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:31:29,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:31:29,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:29,068 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 07:31:29,069 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 07:31:29,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:31:29,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:31:29,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:31:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:29,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:31:29,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {756#true} call ULTIMATE.init(); {756#true} is VALID [2022-04-08 07:31:29,217 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 07:31:29,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-08 07:31:29,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {756#true} {756#true} #65#return; {756#true} is VALID [2022-04-08 07:31:29,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {756#true} call #t~ret7 := main(); {756#true} is VALID [2022-04-08 07:31:29,218 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 07:31:29,218 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 07:31:29,218 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 07:31:29,219 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 07:31:29,219 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 07:31:29,220 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 07:31:29,220 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 07:31:29,220 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 07:31:29,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {797#(<= 1 main_~y~0)} assume !!(#t~post6 < 50);havoc #t~post6; {797#(<= 1 main_~y~0)} is VALID [2022-04-08 07:31:29,221 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 07:31:29,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {756#true} ~cond := #in~cond; {756#true} is VALID [2022-04-08 07:31:29,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {756#true} assume !(0 == ~cond); {756#true} is VALID [2022-04-08 07:31:29,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {756#true} assume true; {756#true} is VALID [2022-04-08 07:31:29,224 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 07:31:29,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {797#(<= 1 main_~y~0)} assume !(0 != ~y~0); {757#false} is VALID [2022-04-08 07:31:29,224 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 07:31:29,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {757#false} ~cond := #in~cond; {757#false} is VALID [2022-04-08 07:31:29,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {757#false} assume 0 == ~cond; {757#false} is VALID [2022-04-08 07:31:29,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {757#false} assume !false; {757#false} is VALID [2022-04-08 07:31:29,225 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 07:31:29,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:31:29,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:31:29,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911674453] [2022-04-08 07:31:29,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:31:29,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984176145] [2022-04-08 07:31:29,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984176145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:29,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:29,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:31:29,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:31:29,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006196248] [2022-04-08 07:31:29,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006196248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:29,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:29,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:31:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488735676] [2022-04-08 07:31:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:31:29,227 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 07:31:29,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:31:29,227 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 07:31:29,242 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 07:31:29,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:31:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:31:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:31:29,243 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 07:31:29,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:29,383 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 07:31:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:31:29,383 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 07:31:29,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:31:29,383 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 07:31:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 07:31:29,387 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 07:31:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 07:31:29,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 07:31:29,422 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 07:31:29,423 INFO L225 Difference]: With dead ends: 42 [2022-04-08 07:31:29,423 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 07:31:29,423 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 07:31:29,425 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:31:29,425 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.0s Time] [2022-04-08 07:31:29,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 07:31:29,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-08 07:31:29,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:31:29,454 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 07:31:29,456 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 07:31:29,456 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 07:31:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:29,458 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 07:31:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 07:31:29,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:29,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:29,459 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 07:31:29,459 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 07:31:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:29,461 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-08 07:31:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-08 07:31:29,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:29,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:29,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:31:29,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:31:29,461 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 07:31:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-08 07:31:29,463 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 24 [2022-04-08 07:31:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:31:29,463 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-08 07:31:29,463 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 07:31:29,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 36 transitions. [2022-04-08 07:31:29,489 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 07:31:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-08 07:31:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:31:29,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:29,490 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 07:31:29,508 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 07:31:29,698 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 07:31:29,698 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 1 times [2022-04-08 07:31:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:29,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1330625104] [2022-04-08 07:31:31,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:31:31,922 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:31:31,922 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:31:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash 584619061, now seen corresponding path program 2 times [2022-04-08 07:31:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:31,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22428687] [2022-04-08 07:31:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:31,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:31:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818256428] [2022-04-08 07:31:31,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:31:31,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:31:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:31,951 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 07:31:31,952 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 07:31:32,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:31:32,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:31:32,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:31:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:32,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:31:32,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-08 07:31:32,141 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 07:31:32,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1065#(<= ~counter~0 0)} assume true; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1065#(<= ~counter~0 0)} {1057#true} #65#return; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {1065#(<= ~counter~0 0)} call #t~ret7 := main(); {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,144 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 07:31:32,144 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 07:31:32,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1065#(<= ~counter~0 0)} ~cond := #in~cond; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {1065#(<= ~counter~0 0)} assume !(0 == ~cond); {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {1065#(<= ~counter~0 0)} assume true; {1065#(<= ~counter~0 0)} is VALID [2022-04-08 07:31:32,146 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 07:31:32,146 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 07:31:32,146 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 07:31:32,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 07:31:32,147 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 07:31:32,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#(<= ~counter~0 1)} ~cond := #in~cond; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 07:31:32,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 1)} assume !(0 == ~cond); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 07:31:32,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 1)} assume true; {1099#(<= ~counter~0 1)} is VALID [2022-04-08 07:31:32,151 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 07:31:32,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#(<= ~counter~0 1)} assume !!(0 != ~y~0); {1099#(<= ~counter~0 1)} is VALID [2022-04-08 07:31:32,152 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 07:31:32,153 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 07:31:32,153 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 07:31:32,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {1130#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1058#false} is VALID [2022-04-08 07:31:32,154 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 07:31:32,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-08 07:31:32,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-08 07:31:32,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-08 07:31:32,154 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 07:31:32,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:31:32,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {1058#false} assume !false; {1058#false} is VALID [2022-04-08 07:31:32,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {1058#false} assume 0 == ~cond; {1058#false} is VALID [2022-04-08 07:31:32,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {1058#false} ~cond := #in~cond; {1058#false} is VALID [2022-04-08 07:31:32,302 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 07:31:32,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {1158#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1058#false} is VALID [2022-04-08 07:31:32,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {1162#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1158#(< |main_#t~post6| 50)} is VALID [2022-04-08 07:31:32,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(< ~counter~0 50)} ~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 50)} is VALID [2022-04-08 07:31:32,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {1162#(< ~counter~0 50)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1162#(< ~counter~0 50)} is VALID [2022-04-08 07:31:32,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1162#(< ~counter~0 50)} assume !!(0 != ~y~0); {1162#(< ~counter~0 50)} is VALID [2022-04-08 07:31:32,316 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1057#true} {1162#(< ~counter~0 50)} #61#return; {1162#(< ~counter~0 50)} is VALID [2022-04-08 07:31:32,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-08 07:31:32,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#true} assume !(0 == ~cond); {1057#true} is VALID [2022-04-08 07:31:32,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#true} ~cond := #in~cond; {1057#true} is VALID [2022-04-08 07:31:32,316 INFO L272 TraceCheckUtils]: 14: Hoare triple {1162#(< ~counter~0 50)} 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 07:31:32,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1162#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1162#(< ~counter~0 50)} is VALID [2022-04-08 07:31:32,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1162#(< ~counter~0 50)} is VALID [2022-04-08 07:31:32,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#(< ~counter~0 49)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1193#(< ~counter~0 49)} is VALID [2022-04-08 07:31:32,318 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1057#true} {1193#(< ~counter~0 49)} #59#return; {1193#(< ~counter~0 49)} is VALID [2022-04-08 07:31:32,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1057#true} assume true; {1057#true} is VALID [2022-04-08 07:31:32,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {1057#true} assume !(0 == ~cond); {1057#true} is VALID [2022-04-08 07:31:32,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1057#true} ~cond := #in~cond; {1057#true} is VALID [2022-04-08 07:31:32,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {1193#(< ~counter~0 49)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1057#true} is VALID [2022-04-08 07:31:32,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#(< ~counter~0 49)} 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 49)} is VALID [2022-04-08 07:31:32,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {1193#(< ~counter~0 49)} call #t~ret7 := main(); {1193#(< ~counter~0 49)} is VALID [2022-04-08 07:31:32,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1193#(< ~counter~0 49)} {1057#true} #65#return; {1193#(< ~counter~0 49)} is VALID [2022-04-08 07:31:32,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#(< ~counter~0 49)} assume true; {1193#(< ~counter~0 49)} is VALID [2022-04-08 07:31:32,321 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 49)} is VALID [2022-04-08 07:31:32,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {1057#true} call ULTIMATE.init(); {1057#true} is VALID [2022-04-08 07:31:32,321 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 07:31:32,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:31:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22428687] [2022-04-08 07:31:32,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:31:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818256428] [2022-04-08 07:31:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818256428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:31:32,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:31:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 07:31:32,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:31:32,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1330625104] [2022-04-08 07:31:32,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1330625104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:31:32,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:31:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:31:32,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153044701] [2022-04-08 07:31:32,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:31:32,323 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 07:31:32,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:31:32,323 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 07:31:32,341 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 07:31:32,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:31:32,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:32,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:31:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 07:31:32,342 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 07:31:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:32,430 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-08 07:31:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:31:32,431 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 07:31:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:31:32,432 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 07:31:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 07:31:32,435 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 07:31:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-04-08 07:31:32,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-04-08 07:31:32,465 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 07:31:32,466 INFO L225 Difference]: With dead ends: 44 [2022-04-08 07:31:32,466 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 07:31:32,467 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 07:31:32,468 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 07:31:32,468 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 07:31:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 07:31:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 07:31:32,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:31:32,515 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 07:31:32,516 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 07:31:32,516 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 07:31:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:32,517 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 07:31:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 07:31:32,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:32,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:32,518 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 07:31:32,518 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 07:31:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:31:32,521 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-08 07:31:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 07:31:32,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:31:32,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:31:32,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:31:32,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:31:32,529 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 07:31:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-08 07:31:32,530 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2022-04-08 07:31:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:31:32,530 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-08 07:31:32,531 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 07:31:32,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-08 07:31:32,562 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 07:31:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-08 07:31:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:31:32,563 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:31:32,563 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 07:31:32,585 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 07:31:32,778 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 07:31:32,778 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:31:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:31:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash 586406521, now seen corresponding path program 1 times [2022-04-08 07:31:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:31:32,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176288714] [2022-04-08 07:31:36,197 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:31:36,197 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:31:36,197 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:31:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash 586406521, now seen corresponding path program 2 times [2022-04-08 07:31:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:31:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773412978] [2022-04-08 07:31:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:31:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:31:36,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:31:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [899877761] [2022-04-08 07:31:36,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:31:36,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:31:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:31:36,209 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 07:31:36,210 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 07:31:36,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:31:36,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:31:36,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 07:31:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:31:36,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:31:37,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {1470#true} call ULTIMATE.init(); {1470#true} is VALID [2022-04-08 07:31:37,232 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 07:31:37,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume true; {1470#true} is VALID [2022-04-08 07:31:37,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#true} {1470#true} #65#return; {1470#true} is VALID [2022-04-08 07:31:37,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#true} call #t~ret7 := main(); {1470#true} is VALID [2022-04-08 07:31:37,232 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 07:31:37,232 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 07:31:37,233 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 07:31:37,233 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 07:31:37,233 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 07:31:37,234 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 07:31:37,235 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 07:31:37,235 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 07:31:37,236 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 < 50);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 07:31:37,236 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 07:31:37,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {1470#true} ~cond := #in~cond; {1524#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:31:37,236 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 07:31:37,237 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 07:31:37,237 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 07:31:37,238 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 07:31:37,238 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 07:31:37,239 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 07:31:37,239 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 07:31:37,240 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 < 50);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 07:31:37,242 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 07:31:37,242 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 07:31:37,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {1559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1471#false} is VALID [2022-04-08 07:31:37,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#false} assume !false; {1471#false} is VALID [2022-04-08 07:31:37,243 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 07:31:37,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:32:24,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {1471#false} assume !false; {1471#false} is VALID [2022-04-08 07:32:24,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {1559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1471#false} is VALID [2022-04-08 07:32:24,414 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 07:32:24,415 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 07:32:24,415 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 < 50);havoc #t~post6; {1575#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:32:24,416 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 07:32:24,420 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 07:32:24,421 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 07:32:24,422 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 07:32:24,424 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 07:32:24,424 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 07:32:24,425 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 07:32:24,425 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 07:32:24,425 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 07:32:24,426 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 < 50);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 07:32:24,427 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 07:32:24,427 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 07:32:24,428 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 07:32:24,428 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 07:32:24,428 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 07:32:24,429 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 07:32:24,429 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 07:32:24,429 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 07:32:24,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {1470#true} call #t~ret7 := main(); {1470#true} is VALID [2022-04-08 07:32:24,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1470#true} {1470#true} #65#return; {1470#true} is VALID [2022-04-08 07:32:24,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {1470#true} assume true; {1470#true} is VALID [2022-04-08 07:32:24,429 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 07:32:24,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {1470#true} call ULTIMATE.init(); {1470#true} is VALID [2022-04-08 07:32:24,429 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 07:32:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:32:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773412978] [2022-04-08 07:32:24,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:32:24,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899877761] [2022-04-08 07:32:24,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899877761] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:32:24,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:32:24,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-04-08 07:32:24,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:32:24,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176288714] [2022-04-08 07:32:24,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176288714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:32:24,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:32:24,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:32:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670992100] [2022-04-08 07:32:24,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:32:24,432 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 07:32:24,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:32:24,432 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 07:32:24,452 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 07:32:24,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:32:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:32:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:32:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:32:24,454 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 07:32:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:32:24,980 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 07:32:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:32:24,980 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 07:32:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:32:24,980 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 07:32:24,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 07:32:24,982 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 07:32:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-08 07:32:24,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-08 07:32:25,022 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 07:32:25,023 INFO L225 Difference]: With dead ends: 55 [2022-04-08 07:32:25,023 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 07:32:25,023 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 07:32:25,023 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 07:32:25,024 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 07:32:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 07:32:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-04-08 07:32:25,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:32:25,058 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 07:32:25,058 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 07:32:25,058 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 07:32:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:32:25,060 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-08 07:32:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-08 07:32:25,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:32:25,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:32:25,060 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 07:32:25,060 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 07:32:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:32:25,061 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-08 07:32:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-08 07:32:25,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:32:25,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:32:25,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:32:25,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:32:25,062 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 07:32:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-08 07:32:25,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 28 [2022-04-08 07:32:25,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:32:25,063 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-08 07:32:25,063 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 07:32:25,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-08 07:32:25,104 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 07:32:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-08 07:32:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:32:25,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:32:25,105 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 07:32:25,139 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 07:32:25,305 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 07:32:25,306 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:32:25,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:32:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1395753147, now seen corresponding path program 1 times [2022-04-08 07:32:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:32:25,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921775904] [2022-04-08 07:32:28,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:32:28,053 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:32:28,053 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:32:28,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1395753147, now seen corresponding path program 2 times [2022-04-08 07:32:28,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:32:28,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975886680] [2022-04-08 07:32:28,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:32:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:32:28,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:32:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [831156938] [2022-04-08 07:32:28,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:32:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:32:28,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:32:28,085 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 07:32:28,086 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 07:32:28,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:32:28,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:32:28,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 07:32:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:32:28,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:32:30,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2022-04-08 07:32:30,911 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 07:32:30,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 07:32:30,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #65#return; {1960#true} is VALID [2022-04-08 07:32:30,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret7 := main(); {1960#true} is VALID [2022-04-08 07:32:30,911 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 07:32:30,912 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 07:32:30,914 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 07:32:30,915 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 07:32:30,916 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 07:32:30,916 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 07:32:30,916 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 07:32:30,917 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 07:32:30,917 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 < 50);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 07:32:30,917 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 07:32:30,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1960#true} ~cond := #in~cond; {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:32:30,918 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 07:32:30,918 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 07:32:30,919 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 07:32:30,919 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 07:32:30,920 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 07:32:30,921 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 07:32:30,921 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 07:32:30,922 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 < 50);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 07:32:31,136 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 07:32:31,137 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 07:32:31,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {2050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1961#false} is VALID [2022-04-08 07:32:31,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2022-04-08 07:32:31,137 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 07:32:31,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:33:45,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2022-04-08 07:33:45,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {2050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1961#false} is VALID [2022-04-08 07:33:45,636 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 07:33:45,637 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 07:33:45,637 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 < 50);havoc #t~post6; {2066#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:33:45,638 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 07:33:45,642 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 07:33:45,644 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 07:33:45,645 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 07:33:47,647 WARN 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 UNKNOWN [2022-04-08 07:33:47,648 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 07:33:47,648 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 07:33:47,648 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 07:33:47,648 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 07:33:47,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {1960#true} assume !!(#t~post6 < 50);havoc #t~post6; {1960#true} is VALID [2022-04-08 07:33:47,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {1960#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1960#true} is VALID [2022-04-08 07:33:47,649 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 07:33:47,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1960#true} {1960#true} #59#return; {1960#true} is VALID [2022-04-08 07:33:47,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 07:33:47,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {1960#true} assume !(0 == ~cond); {1960#true} is VALID [2022-04-08 07:33:47,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1960#true} ~cond := #in~cond; {1960#true} is VALID [2022-04-08 07:33:47,649 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 07:33:47,649 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 07:33:47,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret7 := main(); {1960#true} is VALID [2022-04-08 07:33:47,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #65#return; {1960#true} is VALID [2022-04-08 07:33:47,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2022-04-08 07:33:47,650 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 07:33:47,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2022-04-08 07:33:47,650 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 07:33:47,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:33:47,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975886680] [2022-04-08 07:33:47,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:33:47,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831156938] [2022-04-08 07:33:47,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831156938] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:33:47,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:33:47,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 07:33:47,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:33:47,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921775904] [2022-04-08 07:33:47,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921775904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:47,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:47,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:33:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444764352] [2022-04-08 07:33:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:33:47,654 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 07:33:47,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:33:47,654 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 07:33:48,177 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 07:33:48,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:33:48,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:48,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:33:48,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:33:48,178 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 07:33:55,103 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 07:33:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:56,770 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-08 07:33:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:33:56,770 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 07:33:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:33:56,770 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 07:33:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 07:33:56,771 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 07:33:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-08 07:33:56,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-08 07:33:57,226 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 07:33:57,240 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:33:57,240 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 07:33:57,240 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-08 07:33:57,241 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:33:57,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 142 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 07:33:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 07:33:57,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-08 07:33:57,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:33:57,282 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 07:33:57,282 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 07:33:57,282 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 07:33:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:57,284 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 07:33:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-08 07:33:57,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:57,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:57,284 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 07:33:57,284 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 07:33:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:57,285 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-04-08 07:33:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-04-08 07:33:57,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:57,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:57,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:33:57,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:33:57,286 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 07:33:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-04-08 07:33:57,287 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 28 [2022-04-08 07:33:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:33:57,287 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-04-08 07:33:57,287 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 07:33:57,288 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 55 transitions. [2022-04-08 07:33:57,506 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 07:33:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-08 07:33:57,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 07:33:57,507 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:33:57,507 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 07:33:57,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-08 07:33:57,707 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 07:33:57,708 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:33:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:33:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1513703477, now seen corresponding path program 1 times [2022-04-08 07:33:57,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:57,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1775583268] [2022-04-08 07:34:01,775 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:34:01,775 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:34:01,775 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:34:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1513703477, now seen corresponding path program 2 times [2022-04-08 07:34:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:34:01,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238966928] [2022-04-08 07:34:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:34:01,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:34:01,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:34:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46695758] [2022-04-08 07:34:01,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:34:01,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:34:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:34:01,791 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 07:34:01,792 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 07:34:01,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:34:01,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:34:01,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 07:34:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:34:01,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:34:12,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {2476#true} call ULTIMATE.init(); {2476#true} is VALID [2022-04-08 07:34:12,003 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 07:34:12,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:12,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#true} {2476#true} #65#return; {2476#true} is VALID [2022-04-08 07:34:12,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#true} call #t~ret7 := main(); {2476#true} is VALID [2022-04-08 07:34:12,005 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 07:34:12,006 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 07:34:12,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 07:34:12,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 07:34:12,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:12,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2476#true} {2476#true} #59#return; {2476#true} is VALID [2022-04-08 07:34:12,006 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 07:34:12,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 07:34:12,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#true} assume !!(#t~post6 < 50);havoc #t~post6; {2476#true} is VALID [2022-04-08 07:34:12,006 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 07:34:12,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 07:34:12,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 07:34:12,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:12,007 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2476#true} {2476#true} #61#return; {2476#true} is VALID [2022-04-08 07:34:12,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#true} assume !!(0 != ~y~0); {2476#true} is VALID [2022-04-08 07:34:12,007 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 07:34:12,007 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 07:34:12,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 07:34:12,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {2476#true} assume !!(#t~post6 < 50);havoc #t~post6; {2476#true} is VALID [2022-04-08 07:34:12,007 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 07:34:12,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {2476#true} ~cond := #in~cond; {2556#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:34:12,008 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 07:34:12,008 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 07:34:14,020 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 07:34:14,020 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 07:34:14,021 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 07:34:14,021 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 07:34:14,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2477#false} is VALID [2022-04-08 07:34:14,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {2477#false} assume !false; {2477#false} is VALID [2022-04-08 07:34:14,022 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 07:34:14,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:34:20,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {2477#false} assume !false; {2477#false} is VALID [2022-04-08 07:34:20,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {2579#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2477#false} is VALID [2022-04-08 07:34:20,262 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 07:34:20,262 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 07:34:20,262 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 07:34:20,263 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 07:34:20,263 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 07:34:20,264 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 07:34:20,264 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 07:34:20,264 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 07:34:20,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {2476#true} assume !!(#t~post6 < 50);havoc #t~post6; {2476#true} is VALID [2022-04-08 07:34:20,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 07:34:20,264 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 07:34:20,264 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 07:34:20,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {2476#true} assume !!(0 != ~y~0); {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2476#true} {2476#true} #61#return; {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 07:34:20,265 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 07:34:20,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {2476#true} assume !!(#t~post6 < 50);havoc #t~post6; {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2476#true} is VALID [2022-04-08 07:34:20,265 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 07:34:20,265 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2476#true} {2476#true} #59#return; {2476#true} is VALID [2022-04-08 07:34:20,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:20,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {2476#true} assume !(0 == ~cond); {2476#true} is VALID [2022-04-08 07:34:20,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {2476#true} ~cond := #in~cond; {2476#true} is VALID [2022-04-08 07:34:20,266 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 07:34:20,266 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 07:34:20,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {2476#true} call #t~ret7 := main(); {2476#true} is VALID [2022-04-08 07:34:20,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2476#true} {2476#true} #65#return; {2476#true} is VALID [2022-04-08 07:34:20,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {2476#true} assume true; {2476#true} is VALID [2022-04-08 07:34:20,266 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 07:34:20,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {2476#true} call ULTIMATE.init(); {2476#true} is VALID [2022-04-08 07:34:20,266 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 07:34:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:34:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238966928] [2022-04-08 07:34:20,267 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:34:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46695758] [2022-04-08 07:34:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46695758] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:34:20,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:34:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 07:34:20,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:34:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1775583268] [2022-04-08 07:34:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1775583268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:34:20,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:34:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:34:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11986234] [2022-04-08 07:34:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:34:20,268 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 07:34:20,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:34:20,268 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 07:34:22,305 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 07:34:22,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:34:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:34:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:34:22,306 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 07:34:24,346 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 07:34:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:24,881 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-08 07:34:24,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:34:24,881 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 07:34:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:34:24,881 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 07:34:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 07:34:24,882 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 07:34:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 07:34:24,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 07:34:26,907 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 07:34:26,910 INFO L225 Difference]: With dead ends: 59 [2022-04-08 07:34:26,910 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:34:26,911 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 07:34:26,911 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 07:34:26,911 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 07:34:26,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:34:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-08 07:34:26,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:34:26,947 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 07:34:26,947 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 07:34:26,947 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 07:34:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:26,949 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-08 07:34:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-08 07:34:26,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:26,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:26,949 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 07:34:26,949 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 07:34:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:26,950 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-08 07:34:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-04-08 07:34:26,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:26,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:26,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:34:26,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:34:26,951 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 07:34:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-08 07:34:26,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 34 [2022-04-08 07:34:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:34:26,952 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-08 07:34:26,952 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 07:34:26,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-08 07:34:33,273 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 07:34:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-08 07:34:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:34:33,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:34:33,274 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 07:34:33,304 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 07:34:33,474 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 07:34:33,474 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:34:33,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:34:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887472, now seen corresponding path program 3 times [2022-04-08 07:34:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:33,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329750403] [2022-04-08 07:34:38,580 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:34:38,580 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:34:38,580 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:34:38,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1456887472, now seen corresponding path program 4 times [2022-04-08 07:34:38,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:34:38,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070096554] [2022-04-08 07:34:38,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:34:38,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:34:38,589 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:34:38,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052756929] [2022-04-08 07:34:38,590 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:34:38,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:34:38,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:34:38,590 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 07:34:38,591 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 07:34:38,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:34:38,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:34:38,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 07:34:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:34:38,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:34:38,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-08 07:34:38,821 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 07:34:38,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {3007#(<= ~counter~0 0)} assume true; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3007#(<= ~counter~0 0)} {2999#true} #65#return; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {3007#(<= ~counter~0 0)} call #t~ret7 := main(); {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,822 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 07:34:38,823 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 07:34:38,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {3007#(<= ~counter~0 0)} ~cond := #in~cond; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#(<= ~counter~0 0)} assume !(0 == ~cond); {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#(<= ~counter~0 0)} assume true; {3007#(<= ~counter~0 0)} is VALID [2022-04-08 07:34:38,824 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 07:34:38,824 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 07:34:38,825 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 07:34:38,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {3041#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 07:34:38,826 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 07:34:38,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {3041#(<= ~counter~0 1)} ~cond := #in~cond; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 07:34:38,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {3041#(<= ~counter~0 1)} assume !(0 == ~cond); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 07:34:38,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {3041#(<= ~counter~0 1)} assume true; {3041#(<= ~counter~0 1)} is VALID [2022-04-08 07:34:38,827 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 07:34:38,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {3041#(<= ~counter~0 1)} assume !!(0 != ~y~0); {3041#(<= ~counter~0 1)} is VALID [2022-04-08 07:34:38,827 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 07:34:38,828 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 07:34:38,828 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 07:34:38,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {3072#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 07:34:38,829 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 07:34:38,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {3072#(<= ~counter~0 2)} ~cond := #in~cond; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 07:34:38,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {3072#(<= ~counter~0 2)} assume !(0 == ~cond); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 07:34:38,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {3072#(<= ~counter~0 2)} assume true; {3072#(<= ~counter~0 2)} is VALID [2022-04-08 07:34:38,830 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 07:34:38,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {3072#(<= ~counter~0 2)} assume !!(0 != ~y~0); {3072#(<= ~counter~0 2)} is VALID [2022-04-08 07:34:38,830 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 07:34:38,830 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 07:34:38,831 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 07:34:38,831 INFO L290 TraceCheckUtils]: 33: Hoare triple {3103#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {3000#false} is VALID [2022-04-08 07:34:38,831 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 07:34:38,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#false} ~cond := #in~cond; {3000#false} is VALID [2022-04-08 07:34:38,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {3000#false} assume 0 == ~cond; {3000#false} is VALID [2022-04-08 07:34:38,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-08 07:34:38,832 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 07:34:38,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:34:38,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-08 07:34:38,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {3000#false} assume 0 == ~cond; {3000#false} is VALID [2022-04-08 07:34:38,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#false} ~cond := #in~cond; {3000#false} is VALID [2022-04-08 07:34:38,967 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 07:34:38,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {3131#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {3000#false} is VALID [2022-04-08 07:34:38,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {3135#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3131#(< |main_#t~post6| 50)} is VALID [2022-04-08 07:34:38,968 INFO L290 TraceCheckUtils]: 31: Hoare triple {3135#(< ~counter~0 50)} ~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 50)} is VALID [2022-04-08 07:34:38,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {3135#(< ~counter~0 50)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3135#(< ~counter~0 50)} is VALID [2022-04-08 07:34:38,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {3135#(< ~counter~0 50)} assume !!(0 != ~y~0); {3135#(< ~counter~0 50)} is VALID [2022-04-08 07:34:38,969 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2999#true} {3135#(< ~counter~0 50)} #61#return; {3135#(< ~counter~0 50)} is VALID [2022-04-08 07:34:38,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 07:34:38,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 07:34:38,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 07:34:38,969 INFO L272 TraceCheckUtils]: 24: Hoare triple {3135#(< ~counter~0 50)} 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 07:34:38,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {3135#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {3135#(< ~counter~0 50)} is VALID [2022-04-08 07:34:38,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {3166#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3135#(< ~counter~0 50)} is VALID [2022-04-08 07:34:38,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {3166#(< ~counter~0 49)} ~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 49)} is VALID [2022-04-08 07:34:38,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {3166#(< ~counter~0 49)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3166#(< ~counter~0 49)} is VALID [2022-04-08 07:34:38,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {3166#(< ~counter~0 49)} assume !!(0 != ~y~0); {3166#(< ~counter~0 49)} is VALID [2022-04-08 07:34:38,983 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2999#true} {3166#(< ~counter~0 49)} #61#return; {3166#(< ~counter~0 49)} is VALID [2022-04-08 07:34:38,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 07:34:38,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 07:34:38,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 07:34:38,983 INFO L272 TraceCheckUtils]: 14: Hoare triple {3166#(< ~counter~0 49)} 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 07:34:38,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {3166#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {3166#(< ~counter~0 49)} is VALID [2022-04-08 07:34:38,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {3197#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3166#(< ~counter~0 49)} is VALID [2022-04-08 07:34:38,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {3197#(< ~counter~0 48)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3197#(< ~counter~0 48)} is VALID [2022-04-08 07:34:38,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2999#true} {3197#(< ~counter~0 48)} #59#return; {3197#(< ~counter~0 48)} is VALID [2022-04-08 07:34:38,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-08 07:34:38,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-08 07:34:38,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-08 07:34:38,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {3197#(< ~counter~0 48)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2999#true} is VALID [2022-04-08 07:34:38,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {3197#(< ~counter~0 48)} 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 48)} is VALID [2022-04-08 07:34:38,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {3197#(< ~counter~0 48)} call #t~ret7 := main(); {3197#(< ~counter~0 48)} is VALID [2022-04-08 07:34:38,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3197#(< ~counter~0 48)} {2999#true} #65#return; {3197#(< ~counter~0 48)} is VALID [2022-04-08 07:34:38,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {3197#(< ~counter~0 48)} assume true; {3197#(< ~counter~0 48)} is VALID [2022-04-08 07:34:38,986 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 48)} is VALID [2022-04-08 07:34:38,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-08 07:34:38,986 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 07:34:38,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:34:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070096554] [2022-04-08 07:34:38,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:34:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052756929] [2022-04-08 07:34:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052756929] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:34:38,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:34:38,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 07:34:38,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:34:38,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329750403] [2022-04-08 07:34:38,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329750403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:34:38,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:34:38,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:34:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675607044] [2022-04-08 07:34:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:34:38,988 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 07:34:38,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:34:38,988 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 07:34:39,014 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 07:34:39,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:34:39,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:39,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:34:39,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:34:39,015 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 07:34:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:39,140 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-08 07:34:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:34:39,141 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 07:34:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:34:39,141 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 07:34:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 07:34:39,142 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 07:34:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-08 07:34:39,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-08 07:34:39,179 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 07:34:39,180 INFO L225 Difference]: With dead ends: 54 [2022-04-08 07:34:39,180 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 07:34:39,181 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 07:34:39,181 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 07:34:39,181 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 07:34:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 07:34:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 07:34:39,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:34:39,222 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 07:34:39,222 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 07:34:39,222 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 07:34:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:39,224 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 07:34:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 07:34:39,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:39,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:39,225 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 07:34:39,225 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 07:34:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:39,226 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 07:34:39,226 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 07:34:39,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:39,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:39,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:34:39,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:34:39,226 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 07:34:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 07:34:39,227 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2022-04-08 07:34:39,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:34:39,227 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 07:34:39,227 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 07:34:39,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-08 07:34:45,567 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 07:34:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 07:34:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:34:45,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:34:45,568 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 07:34:45,584 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 07:34:45,768 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 07:34:45,769 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:34:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:34:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1455100012, now seen corresponding path program 3 times [2022-04-08 07:34:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:45,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367655162] [2022-04-08 07:34:47,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:34:47,820 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:34:47,820 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:34:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1455100012, now seen corresponding path program 4 times [2022-04-08 07:34:47,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:34:47,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76499483] [2022-04-08 07:34:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:34:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:34:47,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:34:47,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262664346] [2022-04-08 07:34:47,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:34:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:34:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:34:47,832 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 07:34:47,833 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 07:34:47,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:34:47,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:34:47,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 07:34:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:34:47,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:34:55,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {3536#true} call ULTIMATE.init(); {3536#true} is VALID [2022-04-08 07:34:55,749 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 07:34:55,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:34:55,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3536#true} {3536#true} #65#return; {3536#true} is VALID [2022-04-08 07:34:55,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {3536#true} call #t~ret7 := main(); {3536#true} is VALID [2022-04-08 07:34:55,749 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 07:34:55,749 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 07:34:55,749 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 07:34:55,750 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 07:34:55,750 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 07:34:55,751 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 07:34:55,751 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 07:34:55,751 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 07:34:55,752 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 < 50);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 07:34:55,752 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 07:34:55,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 07:34:55,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 07:34:55,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:34:55,753 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 07:34:55,753 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 07:34:55,754 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 07:34:55,755 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 07:34:55,755 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 07:34:55,756 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 < 50);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 07:34:55,756 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 07:34:55,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 07:34:55,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 07:34:55,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:34:55,757 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 07:34:55,757 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 07:34:55,758 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 07:34:55,759 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 07:34:55,760 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 07:34:55,760 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 < 50);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 07:34:55,762 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 07:34:55,762 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 07:34:55,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {3655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3537#false} is VALID [2022-04-08 07:34:55,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {3537#false} assume !false; {3537#false} is VALID [2022-04-08 07:34:55,763 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 07:34:55,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:35:13,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {3537#false} assume !false; {3537#false} is VALID [2022-04-08 07:35:13,574 INFO L290 TraceCheckUtils]: 36: Hoare triple {3655#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3537#false} is VALID [2022-04-08 07:35:13,574 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 07:35:13,574 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 07:35:13,575 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 < 50);havoc #t~post6; {3671#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:35:13,575 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 07:35:13,579 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 07:35:13,580 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 07:35:13,581 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 07:35:13,581 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 07:35:13,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:35:13,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 07:35:13,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 07:35:13,581 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 07:35:13,582 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 < 50);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 07:35:13,582 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 07:35:13,597 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 07:35:13,598 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 07:35:13,599 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 07:35:13,599 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 07:35:13,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:35:13,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#true} assume !(0 == ~cond); {3536#true} is VALID [2022-04-08 07:35:13,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {3536#true} ~cond := #in~cond; {3536#true} is VALID [2022-04-08 07:35:13,599 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 07:35:13,600 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 < 50);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 07:35:13,601 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 07:35:13,604 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 07:35:13,604 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 07:35:13,605 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 07:35:13,605 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 07:35:13,605 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 07:35:13,605 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 07:35:13,605 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 07:35:13,607 INFO L272 TraceCheckUtils]: 4: Hoare triple {3536#true} call #t~ret7 := main(); {3536#true} is VALID [2022-04-08 07:35:13,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3536#true} {3536#true} #65#return; {3536#true} is VALID [2022-04-08 07:35:13,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {3536#true} assume true; {3536#true} is VALID [2022-04-08 07:35:13,607 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 07:35:13,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {3536#true} call ULTIMATE.init(); {3536#true} is VALID [2022-04-08 07:35:13,607 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 07:35:13,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:35:13,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76499483] [2022-04-08 07:35:13,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:35:13,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262664346] [2022-04-08 07:35:13,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262664346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:35:13,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:35:13,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-08 07:35:13,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:35:13,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367655162] [2022-04-08 07:35:13,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367655162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:35:13,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:35:13,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:35:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769509064] [2022-04-08 07:35:13,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:35:13,610 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 07:35:13,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:35:13,610 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 07:35:13,633 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 07:35:13,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:35:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:35:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:35:13,634 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 07:35:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:14,501 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-08 07:35:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:35:14,501 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 07:35:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:35:14,501 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 07:35:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:35:14,507 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 07:35:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2022-04-08 07:35:14,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2022-04-08 07:35:14,555 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 07:35:14,556 INFO L225 Difference]: With dead ends: 70 [2022-04-08 07:35:14,556 INFO L226 Difference]: Without dead ends: 68 [2022-04-08 07:35:14,557 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 07:35:14,557 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:35:14,558 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.4s Time] [2022-04-08 07:35:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-08 07:35:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-04-08 07:35:14,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:35:14,606 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 07:35:14,606 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 07:35:14,606 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 07:35:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:14,613 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-04-08 07:35:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-08 07:35:14,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:14,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:14,614 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 07:35:14,614 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 07:35:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:14,623 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-04-08 07:35:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-04-08 07:35:14,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:14,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:14,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:35:14,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:35:14,623 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 07:35:14,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 07:35:14,624 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 07:35:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:35:14,625 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 07:35:14,625 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 07:35:14,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 07:35:24,845 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 07:35:24,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 07:35:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:35:24,846 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:35:24,846 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 07:35:24,862 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 07:35:25,046 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 07:35:25,047 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:35:25,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:35:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash -645753386, now seen corresponding path program 1 times [2022-04-08 07:35:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:25,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1474788292] [2022-04-08 07:35:30,834 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:35:30,834 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:35:30,834 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:35:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash -645753386, now seen corresponding path program 2 times [2022-04-08 07:35:30,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:35:30,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371012946] [2022-04-08 07:35:30,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:35:30,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:35:30,847 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:35:30,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826597797] [2022-04-08 07:35:30,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:35:30,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:35:30,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:35:30,848 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 07:35:30,851 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 07:35:30,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:35:30,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:35:30,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-08 07:35:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:35:30,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:36:00,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-08 07:36:00,727 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 07:36:00,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 07:36:00,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #65#return; {4192#true} is VALID [2022-04-08 07:36:00,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2022-04-08 07:36:00,727 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 07:36:00,727 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 07:36:00,727 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 07:36:00,728 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 07:36:00,728 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 07:36:00,728 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 07:36:00,729 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 07:36:00,729 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 07:36:00,729 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 < 50);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 07:36:00,729 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 07:36:00,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 07:36:00,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 07:36:00,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 07:36:00,730 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 07:36:00,730 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 07:36:00,731 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 07:36:00,732 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 07:36:00,732 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 07:36:00,732 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 < 50);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 07:36:00,733 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 07:36:00,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {4192#true} ~cond := #in~cond; {4278#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:36:00,733 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 07:36:00,733 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 07:36:00,734 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 07:36:00,734 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 07:36:00,735 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 07:36:00,737 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 07:36:00,738 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 07:36:00,738 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 < 50);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 07:36:02,378 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 07:36:02,379 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 07:36:02,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {4313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4193#false} is VALID [2022-04-08 07:36:02,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-08 07:36:02,380 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 07:36:02,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:36:54,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2022-04-08 07:36:54,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {4313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4193#false} is VALID [2022-04-08 07:36:54,157 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 07:36:54,157 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 07:36:54,158 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 < 50);havoc #t~post6; {4329#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:36:54,158 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 07:36:54,163 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 07:36:54,165 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 07:36:54,165 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 07:36:55,590 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 07:36:55,591 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 07:36:55,591 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 07:36:55,591 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 07:36:55,591 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 07:36:55,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {4192#true} assume !!(#t~post6 < 50);havoc #t~post6; {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {4192#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4192#true} is VALID [2022-04-08 07:36:55,592 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 07:36:55,592 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 07:36:55,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {4192#true} assume !!(0 != ~y~0); {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4192#true} {4192#true} #61#return; {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 07:36:55,592 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 07:36:55,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {4192#true} assume !!(#t~post6 < 50);havoc #t~post6; {4192#true} is VALID [2022-04-08 07:36:55,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {4192#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4192#true} is VALID [2022-04-08 07:36:55,592 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 07:36:55,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4192#true} {4192#true} #59#return; {4192#true} is VALID [2022-04-08 07:36:55,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 07:36:55,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {4192#true} assume !(0 == ~cond); {4192#true} is VALID [2022-04-08 07:36:55,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {4192#true} ~cond := #in~cond; {4192#true} is VALID [2022-04-08 07:36:55,593 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 07:36:55,593 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 07:36:55,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret7 := main(); {4192#true} is VALID [2022-04-08 07:36:55,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #65#return; {4192#true} is VALID [2022-04-08 07:36:55,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2022-04-08 07:36:55,593 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 07:36:55,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2022-04-08 07:36:55,593 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 07:36:55,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:36:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371012946] [2022-04-08 07:36:55,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:36:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826597797] [2022-04-08 07:36:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826597797] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:36:55,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:36:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-08 07:36:55,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:36:55,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1474788292] [2022-04-08 07:36:55,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1474788292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:36:55,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:36:55,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:36:55,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006487554] [2022-04-08 07:36:55,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:36:55,595 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 07:36:55,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:36:55,595 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 07:36:55,824 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 07:36:55,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:36:55,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:36:55,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:36:55,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=250, Unknown=1, NotChecked=0, Total=306 [2022-04-08 07:36:55,825 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 07:36:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:36:59,540 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-04-08 07:36:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:36:59,541 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 07:36:59,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:36:59,541 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 07:36:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-08 07:36:59,542 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 07:36:59,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 57 transitions. [2022-04-08 07:36:59,542 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 57 transitions. [2022-04-08 07:36:59,644 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 07:36:59,645 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:36:59,646 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 07:36:59,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=72, Invalid=347, Unknown=1, NotChecked=0, Total=420 [2022-04-08 07:36:59,646 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:36:59,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 164 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 07:36:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 07:36:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-04-08 07:36:59,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:36:59,716 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 07:36:59,716 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 07:36:59,717 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 07:36:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:36:59,718 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 07:36:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 07:36:59,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:36:59,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:36:59,718 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 07:36:59,718 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 07:36:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:36:59,719 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 07:36:59,719 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 07:36:59,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:36:59,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:36:59,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:36:59,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:36:59,720 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 07:36:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 07:36:59,721 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 07:36:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:36:59,721 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 07:36:59,721 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 07:36:59,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 07:37:10,228 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 07:37:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 07:37:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:37:10,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:37:10,228 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 07:37:10,246 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 07:37:10,429 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 07:37:10,429 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:37:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:37:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash 539044694, now seen corresponding path program 3 times [2022-04-08 07:37:10,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:37:10,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298441143] [2022-04-08 07:37:15,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:37:15,709 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:37:15,709 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:37:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash 539044694, now seen corresponding path program 4 times [2022-04-08 07:37:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:37:15,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499702027] [2022-04-08 07:37:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:37:15,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:37:15,726 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:37:15,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717288347] [2022-04-08 07:37:15,726 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:37:15,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:37:15,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:37:15,731 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 07:37:15,732 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 07:37:15,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:37:15,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:37:15,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 07:37:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:37:15,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:37:22,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {4881#true} call ULTIMATE.init(); {4881#true} is VALID [2022-04-08 07:37:22,474 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 07:37:22,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:37:22,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4881#true} {4881#true} #65#return; {4881#true} is VALID [2022-04-08 07:37:22,475 INFO L272 TraceCheckUtils]: 4: Hoare triple {4881#true} call #t~ret7 := main(); {4881#true} is VALID [2022-04-08 07:37:22,475 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 07:37:22,475 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 07:37:22,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 07:37:22,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 07:37:22,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:37:22,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4881#true} {4881#true} #59#return; {4881#true} is VALID [2022-04-08 07:37:22,475 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 07:37:22,476 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 07:37:22,476 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 < 50);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 07:37:22,476 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 07:37:22,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 07:37:22,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 07:37:22,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:37:22,477 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 07:37:22,477 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 07:37:22,478 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 07:37:22,479 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 07:37:22,480 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 07:37:22,480 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 < 50);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 07:37:22,480 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 07:37:22,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {4881#true} ~cond := #in~cond; {4965#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:37:22,481 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 07:37:22,481 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 07:37:22,482 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 07:37:22,482 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 07:37:22,483 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 07:37:22,484 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 07:37:22,484 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 07:37:22,485 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 < 50);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 07:37:24,488 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 07:37:24,488 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 07:37:24,488 INFO L290 TraceCheckUtils]: 36: Hoare triple {5000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4882#false} is VALID [2022-04-08 07:37:24,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {4882#false} assume !false; {4882#false} is VALID [2022-04-08 07:37:24,489 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 07:37:24,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:39:48,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {4882#false} assume !false; {4882#false} is VALID [2022-04-08 07:39:48,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {5000#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4882#false} is VALID [2022-04-08 07:39:48,116 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 07:39:48,116 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 07:39:48,117 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 < 50);havoc #t~post6; {5016#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:39:48,117 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 07:39:48,122 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 07:39:48,123 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 07:39:48,123 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 07:39:48,125 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 07:39:48,126 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 07:39:48,126 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 07:39:48,126 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 07:39:48,126 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 07:39:48,127 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 < 50);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 07:39:48,127 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 07:39:48,207 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 07:39:48,208 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 07:39:48,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {4881#true} assume !!(0 != ~y~0); {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4881#true} {4881#true} #61#return; {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 07:39:48,209 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 07:39:48,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {4881#true} assume !!(#t~post6 < 50);havoc #t~post6; {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {4881#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4881#true} is VALID [2022-04-08 07:39:48,209 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 07:39:48,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4881#true} {4881#true} #59#return; {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:39:48,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {4881#true} assume !(0 == ~cond); {4881#true} is VALID [2022-04-08 07:39:48,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {4881#true} ~cond := #in~cond; {4881#true} is VALID [2022-04-08 07:39:48,210 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 07:39:48,210 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 07:39:48,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {4881#true} call #t~ret7 := main(); {4881#true} is VALID [2022-04-08 07:39:48,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4881#true} {4881#true} #65#return; {4881#true} is VALID [2022-04-08 07:39:48,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {4881#true} assume true; {4881#true} is VALID [2022-04-08 07:39:48,210 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 07:39:48,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {4881#true} call ULTIMATE.init(); {4881#true} is VALID [2022-04-08 07:39:48,210 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 07:39:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:39:48,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499702027] [2022-04-08 07:39:48,211 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:39:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717288347] [2022-04-08 07:39:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717288347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:39:48,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:39:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-08 07:39:48,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:39:48,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298441143] [2022-04-08 07:39:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298441143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:39:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:39:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:39:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283241127] [2022-04-08 07:39:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:39:48,212 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 07:39:48,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:39:48,212 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 07:39:50,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:39:50,253 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:39:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:39:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:39:50,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=244, Unknown=3, NotChecked=0, Total=306 [2022-04-08 07:39:50,253 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 07:40:03,172 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 07:40:05,175 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 07:40:12,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:40:16,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:40:17,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:17,110 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-04-08 07:40:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 07:40:17,110 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 07:40:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:40:17,110 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 07:40:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 07:40:17,111 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 07:40:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 57 transitions. [2022-04-08 07:40:17,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 57 transitions. [2022-04-08 07:40:18,333 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 07:40:18,334 INFO L225 Difference]: With dead ends: 78 [2022-04-08 07:40:18,334 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 07:40:18,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=72, Invalid=305, Unknown=3, NotChecked=0, Total=380 [2022-04-08 07:40:18,335 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:40:18,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 175 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2022-04-08 07:40:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 07:40:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2022-04-08 07:40:18,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:40:18,413 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 07:40:18,413 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 07:40:18,413 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 07:40:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:18,414 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 07:40:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 07:40:18,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:40:18,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:40:18,414 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 07:40:18,415 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 07:40:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:18,416 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 07:40:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-04-08 07:40:18,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:40:18,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:40:18,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:40:18,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:40:18,416 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 07:40:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-08 07:40:18,417 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 38 [2022-04-08 07:40:18,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:40:18,417 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-08 07:40:18,417 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 07:40:18,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-08 07:40:30,590 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 07:40:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-08 07:40:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 07:40:30,590 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:40:30,590 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 07:40:30,607 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 07:40:30,791 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 07:40:30,791 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:40:30,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:40:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1348391320, now seen corresponding path program 3 times [2022-04-08 07:40:30,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:40:30,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647405796] [2022-04-08 07:40:33,369 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:40:33,369 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:40:33,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:40:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1348391320, now seen corresponding path program 4 times [2022-04-08 07:40:33,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:40:33,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599685082] [2022-04-08 07:40:33,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:40:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:40:33,395 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:40:33,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [942932974] [2022-04-08 07:40:33,395 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:40:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:40:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:40:33,403 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 07:40:33,406 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 07:40:33,450 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:40:33,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:40:33,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-08 07:40:33,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:40:33,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:42:03,038 WARN L232 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 07:42:03,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {5568#true} call ULTIMATE.init(); {5568#true} is VALID [2022-04-08 07:42:03,785 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 07:42:03,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:42:03,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5568#true} #65#return; {5568#true} is VALID [2022-04-08 07:42:03,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {5568#true} call #t~ret7 := main(); {5568#true} is VALID [2022-04-08 07:42:03,785 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 07:42:03,785 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 07:42:03,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 07:42:03,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 07:42:03,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:42:03,786 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5568#true} {5568#true} #59#return; {5568#true} is VALID [2022-04-08 07:42:03,786 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 07:42:03,786 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 07:42:03,787 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 < 50);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 07:42:03,787 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 07:42:03,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 07:42:03,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 07:42:03,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:42:03,787 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 07:42:03,788 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 07:42:03,788 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 07:42:03,789 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 07:42:03,790 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 07:42:03,790 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 < 50);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 07:42:03,790 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 07:42:03,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {5568#true} ~cond := #in~cond; {5652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:42:03,791 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 07:42:03,791 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 07:42:03,792 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; {5663#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= 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 07:42:03,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {5663#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {5667#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= 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 07:42:03,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {5667#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= 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; {5671#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ main_~x~0 (* 2 (* (div (+ (- 1) main_~b~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 07:42:03,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {5671#(and (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) main_~x~0)) (+ main_~x~0 (* main_~b~0 main_~a~0))) (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ main_~x~0 (* 2 (* (div (+ (- 1) main_~b~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); {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:42:03,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:42:03,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:42:05,899 WARN L272 TraceCheckUtils]: 34: Hoare triple {5675#(and (<= 1 (mod main_~b~0 2)) (= (* 2 (* main_~b~0 main_~a~0)) (+ (div main_~x~0 2) (* 2 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))))) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (div main_~x~0 2) (div (+ (- 1) main_~b~0) 2))) (+ (div main_~x~0 2) (* main_~b~0 main_~a~0))) (<= 0 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)); {5685#(exists ((aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 Int) (aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 Int) (aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51 Int) (aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 Int) (v_main_~a~0_BEFORE_CALL_42 Int) (aux_div_v_main_~x~0_BEFORE_CALL_40_34 Int)) (and (<= 1 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45) (<= (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) 2 (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2))) (< aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 2) (<= 0 aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) (<= (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165))) (<= 0 (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) 1)) (<= 1 |__VERIFIER_assert_#in~cond|) (= (+ (* v_main_~a~0_BEFORE_CALL_42 2) (* 2 (* v_main_~a~0_BEFORE_CALL_42 aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (* (* v_main_~a~0_BEFORE_CALL_42 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) 4)) (+ (div (* aux_div_v_main_~x~0_BEFORE_CALL_40_34 2) 2) (* 2 (* (div (* aux_div_v_main_~x~0_BEFORE_CALL_40_34 2) 2) aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2) 1)) (< aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)))} is UNKNOWN [2022-04-08 07:42:05,901 INFO L290 TraceCheckUtils]: 35: Hoare triple {5685#(exists ((aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 Int) (aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 Int) (aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 Int) (aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51 Int) (aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 Int) (v_main_~a~0_BEFORE_CALL_42 Int) (aux_div_v_main_~x~0_BEFORE_CALL_40_34 Int)) (and (<= 1 aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45) (<= (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) 2 (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2))) (< aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 2) (<= 0 aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) (<= (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)) (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165))) (<= 0 (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) 1)) (<= 1 |__VERIFIER_assert_#in~cond|) (= (+ (* v_main_~a~0_BEFORE_CALL_42 2) (* 2 (* v_main_~a~0_BEFORE_CALL_42 aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (* (* v_main_~a~0_BEFORE_CALL_42 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165) 4)) (+ (div (* aux_div_v_main_~x~0_BEFORE_CALL_40_34 2) 2) (* 2 (* (div (* aux_div_v_main_~x~0_BEFORE_CALL_40_34 2) 2) aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)))) (< (+ aux_mod_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165 (* 2 aux_div_aux_mod_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51_165)) (+ (* aux_div_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 4) (* 2 aux_div_aux_mod_v_main_~b~0_BEFORE_CALL_49_44_51) (* aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2) 1)) (< aux_mod_aux_div_v_main_~b~0_BEFORE_CALL_49_44_45 2)))} ~cond := #in~cond; {5689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:42:05,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5569#false} is VALID [2022-04-08 07:42:05,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-04-08 07:42:05,901 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 07:42:05,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:09,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2022-04-08 07:43:09,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5569#false} is VALID [2022-04-08 07:43:09,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:09,322 INFO L272 TraceCheckUtils]: 34: Hoare triple {5706#(= (+ 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)); {5702#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:43:09,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {5706#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(#t~post6 < 50);havoc #t~post6; {5706#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:43:09,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {5706#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5706#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:43:09,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {5716#(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); {5706#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:43:09,330 INFO L290 TraceCheckUtils]: 30: Hoare triple {5720#(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; {5716#(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 07:43:09,330 INFO L290 TraceCheckUtils]: 29: Hoare triple {5720#(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); {5720#(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 07:43:11,333 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {5656#(not (= |__VERIFIER_assert_#in~cond| 0))} {5568#true} #61#return; {5720#(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 07:43:11,333 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 07:43:11,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {5736#(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 07:43:11,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {5568#true} ~cond := #in~cond; {5736#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:43:11,334 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 07:43:11,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {5568#true} assume !!(#t~post6 < 50);havoc #t~post6; {5568#true} is VALID [2022-04-08 07:43:11,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {5568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5568#true} is VALID [2022-04-08 07:43:11,334 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 07:43:11,335 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 07:43:11,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {5568#true} assume !!(0 != ~y~0); {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5568#true} {5568#true} #61#return; {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 07:43:11,335 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 07:43:11,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#true} assume !!(#t~post6 < 50);havoc #t~post6; {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {5568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5568#true} is VALID [2022-04-08 07:43:11,335 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 07:43:11,335 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5568#true} {5568#true} #59#return; {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {5568#true} assume !(0 == ~cond); {5568#true} is VALID [2022-04-08 07:43:11,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {5568#true} ~cond := #in~cond; {5568#true} is VALID [2022-04-08 07:43:11,336 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 07:43:11,336 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 07:43:11,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {5568#true} call #t~ret7 := main(); {5568#true} is VALID [2022-04-08 07:43:11,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5568#true} #65#return; {5568#true} is VALID [2022-04-08 07:43:11,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2022-04-08 07:43:11,336 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 07:43:11,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {5568#true} call ULTIMATE.init(); {5568#true} is VALID [2022-04-08 07:43:11,336 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 07:43:11,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:11,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599685082] [2022-04-08 07:43:11,336 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:11,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942932974] [2022-04-08 07:43:11,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942932974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:43:11,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:43:11,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2022-04-08 07:43:11,337 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:11,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647405796] [2022-04-08 07:43:11,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647405796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:11,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:11,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 07:43:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621065593] [2022-04-08 07:43:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:11,338 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), 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 07:43:11,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:11,338 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:43:13,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:13,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 07:43:13,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 07:43:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=275, Unknown=2, NotChecked=0, Total=342 [2022-04-08 07:43:13,553 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:43:24,050 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 07:43:25,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:43:35,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:43:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:38,701 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-04-08 07:43:38,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:43:38,701 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), 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 07:43:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:38,702 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:43:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2022-04-08 07:43:38,702 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:43:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 60 transitions. [2022-04-08 07:43:38,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 60 transitions. [2022-04-08 07:43:40,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:40,885 INFO L225 Difference]: With dead ends: 76 [2022-04-08 07:43:40,885 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 07:43:40,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=79, Invalid=339, Unknown=2, NotChecked=0, Total=420 [2022-04-08 07:43:40,886 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:40,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 234 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 1 Unknown, 6 Unchecked, 12.3s Time] [2022-04-08 07:43:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 07:43:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-04-08 07:43:40,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:40,960 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 07:43:40,960 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 07:43:40,960 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 07:43:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:40,971 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-08 07:43:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-04-08 07:43:40,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:40,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:40,972 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 07:43:40,972 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 07:43:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:40,973 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-04-08 07:43:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-04-08 07:43:40,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:40,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:40,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:40,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:40,974 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 07:43:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-08 07:43:40,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 38 [2022-04-08 07:43:40,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:40,975 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-08 07:43:40,975 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), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 07:43:40,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-08 07:43:49,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 52 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-08 07:43:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 07:43:49,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:49,908 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 07:43:49,924 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 07:43:50,108 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 07:43:50,109 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1258071893, now seen corresponding path program 5 times [2022-04-08 07:43:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:50,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267324548] [2022-04-08 07:43:54,149 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:43:54,149 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:43:54,149 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:43:54,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1258071893, now seen corresponding path program 6 times [2022-04-08 07:43:54,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:54,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591857746] [2022-04-08 07:43:54,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:54,159 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:54,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281624256] [2022-04-08 07:43:54,159 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:43:54,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:54,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:54,163 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 07:43:54,163 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 07:43:54,205 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:43:54,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:54,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 07:43:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:54,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:54,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {6223#true} call ULTIMATE.init(); {6223#true} is VALID [2022-04-08 07:43:54,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#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; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {6231#(<= ~counter~0 0)} assume true; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6231#(<= ~counter~0 0)} {6223#true} #65#return; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {6231#(<= ~counter~0 0)} call #t~ret7 := main(); {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {6231#(<= ~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; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,440 INFO L272 TraceCheckUtils]: 6: Hoare triple {6231#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {6231#(<= ~counter~0 0)} ~cond := #in~cond; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {6231#(<= ~counter~0 0)} assume !(0 == ~cond); {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {6231#(<= ~counter~0 0)} assume true; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6231#(<= ~counter~0 0)} {6231#(<= ~counter~0 0)} #59#return; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {6231#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6231#(<= ~counter~0 0)} is VALID [2022-04-08 07:43:54,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {6231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {6265#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,443 INFO L272 TraceCheckUtils]: 14: Hoare triple {6265#(<= ~counter~0 1)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {6265#(<= ~counter~0 1)} ~cond := #in~cond; {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {6265#(<= ~counter~0 1)} assume !(0 == ~cond); {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {6265#(<= ~counter~0 1)} assume true; {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,444 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6265#(<= ~counter~0 1)} {6265#(<= ~counter~0 1)} #61#return; {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {6265#(<= ~counter~0 1)} assume !!(0 != ~y~0); {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {6265#(<= ~counter~0 1)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {6265#(<= ~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); {6265#(<= ~counter~0 1)} is VALID [2022-04-08 07:43:54,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {6265#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {6296#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,447 INFO L272 TraceCheckUtils]: 24: Hoare triple {6296#(<= ~counter~0 2)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {6296#(<= ~counter~0 2)} ~cond := #in~cond; {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {6296#(<= ~counter~0 2)} assume !(0 == ~cond); {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {6296#(<= ~counter~0 2)} assume true; {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,448 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6296#(<= ~counter~0 2)} {6296#(<= ~counter~0 2)} #61#return; {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {6296#(<= ~counter~0 2)} assume !!(0 != ~y~0); {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {6296#(<= ~counter~0 2)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {6296#(<= ~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); {6296#(<= ~counter~0 2)} is VALID [2022-04-08 07:43:54,449 INFO L290 TraceCheckUtils]: 32: Hoare triple {6296#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {6327#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,450 INFO L272 TraceCheckUtils]: 34: Hoare triple {6327#(<= ~counter~0 3)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {6327#(<= ~counter~0 3)} ~cond := #in~cond; {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {6327#(<= ~counter~0 3)} assume !(0 == ~cond); {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {6327#(<= ~counter~0 3)} assume true; {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,451 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6327#(<= ~counter~0 3)} {6327#(<= ~counter~0 3)} #61#return; {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {6327#(<= ~counter~0 3)} assume !!(0 != ~y~0); {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {6327#(<= ~counter~0 3)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {6327#(<= ~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); {6327#(<= ~counter~0 3)} is VALID [2022-04-08 07:43:54,453 INFO L290 TraceCheckUtils]: 42: Hoare triple {6327#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6358#(<= |main_#t~post6| 3)} is VALID [2022-04-08 07:43:54,453 INFO L290 TraceCheckUtils]: 43: Hoare triple {6358#(<= |main_#t~post6| 3)} assume !(#t~post6 < 50);havoc #t~post6; {6224#false} is VALID [2022-04-08 07:43:54,453 INFO L272 TraceCheckUtils]: 44: Hoare triple {6224#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {6224#false} is VALID [2022-04-08 07:43:54,453 INFO L290 TraceCheckUtils]: 45: Hoare triple {6224#false} ~cond := #in~cond; {6224#false} is VALID [2022-04-08 07:43:54,453 INFO L290 TraceCheckUtils]: 46: Hoare triple {6224#false} assume 0 == ~cond; {6224#false} is VALID [2022-04-08 07:43:54,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {6224#false} assume !false; {6224#false} is VALID [2022-04-08 07:43:54,453 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 07:43:54,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:43:54,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {6224#false} assume !false; {6224#false} is VALID [2022-04-08 07:43:54,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {6224#false} assume 0 == ~cond; {6224#false} is VALID [2022-04-08 07:43:54,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {6224#false} ~cond := #in~cond; {6224#false} is VALID [2022-04-08 07:43:54,692 INFO L272 TraceCheckUtils]: 44: Hoare triple {6224#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {6224#false} is VALID [2022-04-08 07:43:54,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {6386#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {6224#false} is VALID [2022-04-08 07:43:54,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {6390#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6386#(< |main_#t~post6| 50)} is VALID [2022-04-08 07:43:54,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {6390#(< ~counter~0 50)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {6390#(< ~counter~0 50)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {6390#(< ~counter~0 50)} assume !!(0 != ~y~0); {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,694 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6223#true} {6390#(< ~counter~0 50)} #61#return; {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {6223#true} assume true; {6223#true} is VALID [2022-04-08 07:43:54,694 INFO L290 TraceCheckUtils]: 36: Hoare triple {6223#true} assume !(0 == ~cond); {6223#true} is VALID [2022-04-08 07:43:54,694 INFO L290 TraceCheckUtils]: 35: Hoare triple {6223#true} ~cond := #in~cond; {6223#true} is VALID [2022-04-08 07:43:54,694 INFO L272 TraceCheckUtils]: 34: Hoare triple {6390#(< ~counter~0 50)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6223#true} is VALID [2022-04-08 07:43:54,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {6390#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {6421#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6390#(< ~counter~0 50)} is VALID [2022-04-08 07:43:54,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {6421#(< ~counter~0 49)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {6421#(< ~counter~0 49)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {6421#(< ~counter~0 49)} assume !!(0 != ~y~0); {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,716 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6223#true} {6421#(< ~counter~0 49)} #61#return; {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {6223#true} assume true; {6223#true} is VALID [2022-04-08 07:43:54,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {6223#true} assume !(0 == ~cond); {6223#true} is VALID [2022-04-08 07:43:54,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {6223#true} ~cond := #in~cond; {6223#true} is VALID [2022-04-08 07:43:54,716 INFO L272 TraceCheckUtils]: 24: Hoare triple {6421#(< ~counter~0 49)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6223#true} is VALID [2022-04-08 07:43:54,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {6421#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {6452#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6421#(< ~counter~0 49)} is VALID [2022-04-08 07:43:54,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {6452#(< ~counter~0 48)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {6452#(< ~counter~0 48)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {6452#(< ~counter~0 48)} assume !!(0 != ~y~0); {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,718 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6223#true} {6452#(< ~counter~0 48)} #61#return; {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {6223#true} assume true; {6223#true} is VALID [2022-04-08 07:43:54,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {6223#true} assume !(0 == ~cond); {6223#true} is VALID [2022-04-08 07:43:54,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {6223#true} ~cond := #in~cond; {6223#true} is VALID [2022-04-08 07:43:54,719 INFO L272 TraceCheckUtils]: 14: Hoare triple {6452#(< ~counter~0 48)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6223#true} is VALID [2022-04-08 07:43:54,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {6452#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {6483#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6452#(< ~counter~0 48)} is VALID [2022-04-08 07:43:54,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {6483#(< ~counter~0 47)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,720 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6223#true} {6483#(< ~counter~0 47)} #59#return; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {6223#true} assume true; {6223#true} is VALID [2022-04-08 07:43:54,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {6223#true} assume !(0 == ~cond); {6223#true} is VALID [2022-04-08 07:43:54,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {6223#true} ~cond := #in~cond; {6223#true} is VALID [2022-04-08 07:43:54,720 INFO L272 TraceCheckUtils]: 6: Hoare triple {6483#(< ~counter~0 47)} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6223#true} is VALID [2022-04-08 07:43:54,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {6483#(< ~counter~0 47)} 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; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {6483#(< ~counter~0 47)} call #t~ret7 := main(); {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6483#(< ~counter~0 47)} {6223#true} #65#return; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {6483#(< ~counter~0 47)} assume true; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#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; {6483#(< ~counter~0 47)} is VALID [2022-04-08 07:43:54,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {6223#true} call ULTIMATE.init(); {6223#true} is VALID [2022-04-08 07:43:54,722 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 07:43:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:43:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591857746] [2022-04-08 07:43:54,722 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:43:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281624256] [2022-04-08 07:43:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281624256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:43:54,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:43:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 07:43:54,723 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:43:54,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267324548] [2022-04-08 07:43:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267324548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:43:54,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:43:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 07:43:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743933292] [2022-04-08 07:43:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:43:54,724 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 07:43:54,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:43:54,724 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 07:43:54,757 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 07:43:54,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 07:43:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:54,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 07:43:54,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:43:54,758 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 07:43:54,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:54,990 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-04-08 07:43:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:43:54,990 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 07:43:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:43:54,991 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 07:43:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-08 07:43:54,992 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 07:43:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 69 transitions. [2022-04-08 07:43:54,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 69 transitions. [2022-04-08 07:43:55,038 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 07:43:55,040 INFO L225 Difference]: With dead ends: 64 [2022-04-08 07:43:55,040 INFO L226 Difference]: Without dead ends: 57 [2022-04-08 07:43:55,040 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 07:43:55,041 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:43:55,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:43:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-08 07:43:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-08 07:43:55,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:43:55,120 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 07:43:55,120 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 07:43:55,121 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 07:43:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:55,121 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-08 07:43:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 07:43:55,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:55,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:55,124 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 07:43:55,124 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 07:43:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:43:55,125 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-04-08 07:43:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 07:43:55,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:43:55,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:43:55,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:43:55,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:43:55,125 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 07:43:55,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-08 07:43:55,126 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 48 [2022-04-08 07:43:55,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:43:55,127 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-08 07:43:55,127 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 07:43:55,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-08 07:44:04,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 58 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-08 07:44:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-08 07:44:04,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:44:04,564 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 07:44:04,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-08 07:44:04,764 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 07:44:04,764 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:44:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:44:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1256284433, now seen corresponding path program 5 times [2022-04-08 07:44:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:04,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1929379911] [2022-04-08 07:44:08,811 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 07:44:08,811 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 07:44:08,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 07:44:08,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1256284433, now seen corresponding path program 6 times [2022-04-08 07:44:08,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:44:08,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344609060] [2022-04-08 07:44:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:44:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:44:08,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:44:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232691858] [2022-04-08 07:44:08,823 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:44:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:44:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:44:08,824 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 07:44:08,826 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 07:44:08,867 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:44:08,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:44:08,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 07:44:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:44:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:44:47,152 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful