/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/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:35:42,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:35:42,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:35:42,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:35:42,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:35:42,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:35:42,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:35:42,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:35:42,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:35:42,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:35:42,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:35:42,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:35:42,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:35:42,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:35:42,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:35:42,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:35:42,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:35:42,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:35:42,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:35:42,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:35:42,734 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:35:42,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:35:42,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:35:42,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:35:42,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:35:42,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:35:42,737 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:35:42,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:35:42,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:35:42,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:35:42,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:35:42,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:35:42,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:35:42,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:35:42,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:35:42,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:35:42,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:35:42,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:35:42,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:35:42,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:35:42,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:35:42,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:35:42,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:35:42,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:35:42,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:35:42,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:35:42,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:35:42,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:35:42,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:35:42,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:35:42,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:35:42,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:35:42,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:35:42,753 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:35:42,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:35:42,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:35:42,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:35:42,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:35:42,933 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:35:42,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-15 07:35:42,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e440795d/7c237596e761490d9092ee8bd5d864e0/FLAGa850bfb4b [2022-04-15 07:35:43,338 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:35:43,339 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-04-15 07:35:43,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e440795d/7c237596e761490d9092ee8bd5d864e0/FLAGa850bfb4b [2022-04-15 07:35:43,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e440795d/7c237596e761490d9092ee8bd5d864e0 [2022-04-15 07:35:43,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:35:43,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:35:43,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:35:43,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:35:43,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:35:43,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cca9e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43, skipping insertion in model container [2022-04-15 07:35:43,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:35:43,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:35:43,496 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/bresenham-ll_valuebound1.c[597,610] [2022-04-15 07:35:43,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:35:43,520 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:35:43,530 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/bresenham-ll_valuebound1.c[597,610] [2022-04-15 07:35:43,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:35:43,544 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:35:43,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43 WrapperNode [2022-04-15 07:35:43,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:35:43,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:35:43,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:35:43,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:35:43,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:35:43,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:35:43,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:35:43,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:35:43,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (1/1) ... [2022-04-15 07:35:43,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:35:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:35:43,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:35:43,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:35:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:35:43,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:35:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:35:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:35:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:35:43,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:35:43,642 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:35:43,642 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:35:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:35:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:35:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:35:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:35:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:35:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:35:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:35:43,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:35:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:35:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:35:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:35:43,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:35:43,692 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:35:43,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:35:43,834 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:35:43,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:35:43,839 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:35:43,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:35:43 BoogieIcfgContainer [2022-04-15 07:35:43,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:35:43,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:35:43,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:35:43,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:35:43,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:35:43" (1/3) ... [2022-04-15 07:35:43,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22956992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:35:43, skipping insertion in model container [2022-04-15 07:35:43,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:35:43" (2/3) ... [2022-04-15 07:35:43,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22956992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:35:43, skipping insertion in model container [2022-04-15 07:35:43,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:35:43" (3/3) ... [2022-04-15 07:35:43,862 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2022-04-15 07:35:43,865 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:35:43,865 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:35:43,904 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:35:43,916 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:35:43,916 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:35:43,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:35:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:35:43,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:35:43,944 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:35:43,944 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:35:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:35:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-04-15 07:35:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877684156] [2022-04-15 07:35:43,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:35:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-04-15 07:35:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:35:43,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891449425] [2022-04-15 07:35:43,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:35:43,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:35:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:35:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:44,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:35:44,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:35:44,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:35:44,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:35:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:44,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:35:44,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:35:44,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:35:44,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:35:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 07:35:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:44,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:35:44,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:35:44,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:35:44,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:35:44,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:35:44,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-15 07:35:44,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-15 07:35:44,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #69#return; {35#true} is VALID [2022-04-15 07:35:44,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret8 := main(); {35#true} is VALID [2022-04-15 07:35:44,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-15 07:35:44,166 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-15 07:35:44,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:35:44,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:35:44,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:35:44,168 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-15 07:35:44,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-15 07:35:44,168 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {35#true} is VALID [2022-04-15 07:35:44,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-15 07:35:44,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-15 07:35:44,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-15 07:35:44,169 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-15 07:35:44,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {36#false} is VALID [2022-04-15 07:35:44,170 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {36#false} is VALID [2022-04-15 07:35:44,170 INFO L272 TraceCheckUtils]: 19: Hoare triple {36#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-15 07:35:44,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-15 07:35:44,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-15 07:35:44,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-15 07:35:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:35:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:35:44,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891449425] [2022-04-15 07:35:44,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891449425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:35:44,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:35:44,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:35:44,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:35:44,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877684156] [2022-04-15 07:35:44,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877684156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:35:44,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:35:44,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:35:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114112217] [2022-04-15 07:35:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:35:44,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:35:44,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:35:44,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:35:44,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:44,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:35:44,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:35:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:35:44,231 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:35:44,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:44,372 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-04-15 07:35:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:35:44,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:35:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:35:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:35:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:35:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:35:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-04-15 07:35:44,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-04-15 07:35:44,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:44,468 INFO L225 Difference]: With dead ends: 57 [2022-04-15 07:35:44,469 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:35:44,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:35:44,473 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:35:44,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:35:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:35:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 07:35:44,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:35:44,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:35:44,517 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:35:44,517 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:35:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:44,519 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:35:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:35:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:44,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:44,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 07:35:44,521 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-15 07:35:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:44,523 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 07:35:44,523 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:35:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:44,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:35:44,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:35:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:35:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 07:35:44,527 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 07:35:44,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:35:44,528 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 07:35:44,528 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:35:44,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions. [2022-04-15 07:35:44,557 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-15 07:35:44,557 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 07:35:44,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:35:44,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:35:44,558 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:35:44,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:35:44,559 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:35:44,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:35:44,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-04-15 07:35:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:44,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3896818] [2022-04-15 07:35:44,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:35:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-04-15 07:35:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:35:44,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574999415] [2022-04-15 07:35:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:35:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:35:44,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:35:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406227261] [2022-04-15 07:35:44,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:35:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:35:44,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:35:44,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:35:44,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:35:44,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:35:44,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:35:44,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 07:35:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:44,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:35:44,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {273#true} call ULTIMATE.init(); {273#true} is VALID [2022-04-15 07:35:44,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#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(15, 2);call #Ultimate.allocInit(12, 3); {273#true} is VALID [2022-04-15 07:35:44,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:35:44,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {273#true} {273#true} #69#return; {273#true} is VALID [2022-04-15 07:35:44,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {273#true} call #t~ret8 := main(); {273#true} is VALID [2022-04-15 07:35:44,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {273#true} is VALID [2022-04-15 07:35:44,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {273#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {273#true} is VALID [2022-04-15 07:35:44,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:35:44,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:35:44,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:35:44,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {273#true} {273#true} #61#return; {273#true} is VALID [2022-04-15 07:35:44,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {273#true} is VALID [2022-04-15 07:35:44,796 INFO L272 TraceCheckUtils]: 12: Hoare triple {273#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {273#true} is VALID [2022-04-15 07:35:44,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {273#true} ~cond := #in~cond; {273#true} is VALID [2022-04-15 07:35:44,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {273#true} assume !(0 == ~cond); {273#true} is VALID [2022-04-15 07:35:44,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {273#true} assume true; {273#true} is VALID [2022-04-15 07:35:44,800 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {273#true} {273#true} #63#return; {273#true} is VALID [2022-04-15 07:35:44,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {273#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-15 07:35:44,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {329#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-15 07:35:44,802 INFO L272 TraceCheckUtils]: 19: Hoare triple {333#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {337#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:35:44,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {337#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:35:44,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {274#false} is VALID [2022-04-15 07:35:44,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-04-15 07:35:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:35:44,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:35:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:35:44,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574999415] [2022-04-15 07:35:44,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:35:44,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406227261] [2022-04-15 07:35:44,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406227261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:35:44,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:35:44,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:35:44,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:35:44,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3896818] [2022-04-15 07:35:44,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3896818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:35:44,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:35:44,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:35:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237556843] [2022-04-15 07:35:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:35:44,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:35:44,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:35:44,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:35:44,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:44,823 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:35:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:35:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:35:44,824 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:35:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:45,049 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-15 07:35:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:35:45,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 07:35:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:35:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:35:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:35:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:35:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:35:45,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 07:35:45,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:45,099 INFO L225 Difference]: With dead ends: 39 [2022-04-15 07:35:45,099 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:35:45,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:35:45,100 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:35:45,101 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:35:45,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:35:45,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 07:35:45,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:35:45,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:35:45,112 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:35:45,112 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:35:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:45,114 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:35:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:35:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:45,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:35:45,116 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:35:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:45,118 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 07:35:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-04-15 07:35:45,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:45,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:45,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:35:45,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:35:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:35:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 07:35:45,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-04-15 07:35:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:35:45,122 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 07:35:45,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 07:35:45,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 07:35:45,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 07:35:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:35:45,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:35:45,163 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:35:45,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 07:35:45,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:35:45,379 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:35:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:35:45,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-04-15 07:35:45,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:45,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [509657689] [2022-04-15 07:35:45,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:35:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-04-15 07:35:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:35:45,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104797005] [2022-04-15 07:35:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:35:45,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:35:45,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:35:45,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248026656] [2022-04-15 07:35:45,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:35:45,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:35:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:35:45,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:35:45,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:35:45,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:35:45,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:35:45,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 07:35:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:45,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:35:53,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {567#true} call ULTIMATE.init(); {567#true} is VALID [2022-04-15 07:35:53,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#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(15, 2);call #Ultimate.allocInit(12, 3); {567#true} is VALID [2022-04-15 07:35:53,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:35:53,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {567#true} {567#true} #69#return; {567#true} is VALID [2022-04-15 07:35:53,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {567#true} call #t~ret8 := main(); {567#true} is VALID [2022-04-15 07:35:53,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {567#true} is VALID [2022-04-15 07:35:53,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {567#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {567#true} is VALID [2022-04-15 07:35:53,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} ~cond := #in~cond; {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:35:53,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:35:53,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {597#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:35:53,294 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {597#(not (= |assume_abort_if_not_#in~cond| 0))} {567#true} #61#return; {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:35:53,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:35:53,294 INFO L272 TraceCheckUtils]: 12: Hoare triple {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {567#true} is VALID [2022-04-15 07:35:53,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} ~cond := #in~cond; {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:35:53,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {593#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:35:53,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {597#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {597#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:35:53,296 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {597#(not (= |assume_abort_if_not_#in~cond| 0))} {604#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {623#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:35:53,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,297 INFO L272 TraceCheckUtils]: 19: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {567#true} is VALID [2022-04-15 07:35:53,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} ~cond := #in~cond; {567#true} is VALID [2022-04-15 07:35:53,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} assume !(0 == ~cond); {567#true} is VALID [2022-04-15 07:35:53,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} assume true; {567#true} is VALID [2022-04-15 07:35:53,298 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {567#true} {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} #65#return; {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {627#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:35:53,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {652#(and (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {659#(and (= main_~xy~0 0) (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~yx~0 0))} is VALID [2022-04-15 07:35:53,302 INFO L272 TraceCheckUtils]: 28: Hoare triple {659#(and (= main_~xy~0 0) (<= (* main_~Y~0 4) (+ main_~X~0 main_~v~0)) (< main_~v~0 (* main_~Y~0 2)) (<= 0 main_~Y~0) (<= main_~X~0 1) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {663#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:35:53,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {663#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {667#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:35:53,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {667#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {568#false} is VALID [2022-04-15 07:35:53,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {568#false} assume !false; {568#false} is VALID [2022-04-15 07:35:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:35:53,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104797005] [2022-04-15 07:37:26,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:26,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248026656] [2022-04-15 07:37:26,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248026656] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 07:37:26,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 07:37:26,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-15 07:37:26,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:26,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [509657689] [2022-04-15 07:37:26,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [509657689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:26,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:26,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:37:26,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763576029] [2022-04-15 07:37:26,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 32 [2022-04-15 07:37:26,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:26,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 07:37:26,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:26,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:37:26,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:26,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:37:26,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:37:26,386 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 07:37:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:26,806 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-04-15 07:37:26,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:37:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 32 [2022-04-15 07:37:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 07:37:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-15 07:37:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 07:37:26,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 67 transitions. [2022-04-15 07:37:26,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 67 transitions. [2022-04-15 07:37:26,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:26,867 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:37:26,867 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:37:26,868 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:37:26,868 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:26,869 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:37:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:37:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 07:37:26,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:26,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:37:26,913 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:37:26,913 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:37:26,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:26,915 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 07:37:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:37:26,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:26,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:26,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:37:26,916 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-15 07:37:26,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:26,917 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 07:37:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:37:26,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:26,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:26,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:26,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:37:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 07:37:26,932 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-15 07:37:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:26,933 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 07:37:26,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 07:37:26,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 07:37:26,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 07:37:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:37:26,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:26,969 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:37:26,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 07:37:27,169 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 07:37:27,170 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-04-15 07:37:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:27,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [346450323] [2022-04-15 07:37:27,171 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-04-15 07:37:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:27,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706881810] [2022-04-15 07:37:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:27,199 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:27,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [122871937] [2022-04-15 07:37:27,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:37:27,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:27,209 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:27,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:37:27,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:37:27,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:27,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 07:37:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:27,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:27,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-15 07:37:27,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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(15, 2);call #Ultimate.allocInit(12, 3); {971#true} is VALID [2022-04-15 07:37:27,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:27,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #69#return; {971#true} is VALID [2022-04-15 07:37:27,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-15 07:37:27,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {971#true} is VALID [2022-04-15 07:37:27,716 INFO L272 TraceCheckUtils]: 6: Hoare triple {971#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:27,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} ~cond := #in~cond; {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:37:27,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:37:27,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:37:27,718 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} {971#true} #61#return; {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:37:27,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:37:27,719 INFO L272 TraceCheckUtils]: 12: Hoare triple {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:27,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#true} ~cond := #in~cond; {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:37:27,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {997#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:37:27,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1001#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:37:27,723 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1001#(not (= |assume_abort_if_not_#in~cond| 0))} {1008#(and (<= 0 main_~X~0) (<= main_~X~0 1))} #63#return; {1027#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:37:27,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {1027#(and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:37:27,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:37:27,724 INFO L272 TraceCheckUtils]: 19: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:27,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-15 07:37:27,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-15 07:37:27,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:27,725 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {971#true} {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} #65#return; {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:37:27,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} is VALID [2022-04-15 07:37:27,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1056#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:37:27,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {1056#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1060#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} is VALID [2022-04-15 07:37:27,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {1060#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (= main_~y~0 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~X~0) (<= main_~X~0 1))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1064#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-15 07:37:27,729 INFO L272 TraceCheckUtils]: 28: Hoare triple {1064#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~X~0 main_~xy~0) (<= 0 main_~X~0) (<= main_~X~0 1) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:27,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:27,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-15 07:37:27,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-15 07:37:27,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:37:27,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:28,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {972#false} assume !false; {972#false} is VALID [2022-04-15 07:37:28,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {972#false} is VALID [2022-04-15 07:37:28,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:28,063 INFO L272 TraceCheckUtils]: 28: Hoare triple {1088#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:28,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1088#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:37:28,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {1096#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1092#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:37:28,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1096#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:37:28,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {1100#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:37:28,070 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {971#true} {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:28,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:28,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-15 07:37:28,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-15 07:37:28,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:28,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:28,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {971#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1104#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:37:28,071 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {971#true} {971#true} #63#return; {971#true} is VALID [2022-04-15 07:37:28,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L272 TraceCheckUtils]: 12: Hoare triple {971#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {971#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {971#true} {971#true} #61#return; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {971#true} assume !(0 == ~cond); {971#true} is VALID [2022-04-15 07:37:28,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#true} ~cond := #in~cond; {971#true} is VALID [2022-04-15 07:37:28,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {971#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {971#true} is VALID [2022-04-15 07:37:28,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {971#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {971#true} is VALID [2022-04-15 07:37:28,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {971#true} call #t~ret8 := main(); {971#true} is VALID [2022-04-15 07:37:28,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {971#true} {971#true} #69#return; {971#true} is VALID [2022-04-15 07:37:28,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {971#true} assume true; {971#true} is VALID [2022-04-15 07:37:28,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#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(15, 2);call #Ultimate.allocInit(12, 3); {971#true} is VALID [2022-04-15 07:37:28,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {971#true} call ULTIMATE.init(); {971#true} is VALID [2022-04-15 07:37:28,073 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 07:37:28,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706881810] [2022-04-15 07:37:28,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122871937] [2022-04-15 07:37:28,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122871937] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:28,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:28,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-15 07:37:28,074 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [346450323] [2022-04-15 07:37:28,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [346450323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:28,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:28,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:37:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772033784] [2022-04-15 07:37:28,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 32 [2022-04-15 07:37:28,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:28,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-15 07:37:28,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:28,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:37:28,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:28,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:37:28,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:37:28,107 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-15 07:37:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:28,563 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-15 07:37:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:37:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 32 [2022-04-15 07:37:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-15 07:37:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-04-15 07:37:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-15 07:37:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 64 transitions. [2022-04-15 07:37:28,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 64 transitions. [2022-04-15 07:37:28,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:28,634 INFO L225 Difference]: With dead ends: 59 [2022-04-15 07:37:28,634 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 07:37:28,637 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:37:28,640 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:28,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:37:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 07:37:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-04-15 07:37:28,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:28,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:28,693 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:28,694 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:28,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:28,696 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 07:37:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 07:37:28,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:28,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:28,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-15 07:37:28,702 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-15 07:37:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:28,711 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 07:37:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 07:37:28,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:28,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:28,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:28,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 07:37:28,715 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2022-04-15 07:37:28,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:28,716 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 07:37:28,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-15 07:37:28,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 07:37:28,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:28,761 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 07:37:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:37:28,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:37:28,765 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-04-15 07:37:28,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 07:37:28,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:28,972 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:37:28,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:37:28,972 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-04-15 07:37:28,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:28,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467668089] [2022-04-15 07:37:28,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:37:28,973 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-04-15 07:37:28,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:37:28,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328466064] [2022-04-15 07:37:28,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:37:28,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:37:28,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:37:28,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1738311071] [2022-04-15 07:37:28,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:37:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:37:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:37:28,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:37:28,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:37:29,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:37:29,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:37:29,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 07:37:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:37:29,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:37:49,565 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:37:58,202 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:04,236 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:05,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(15, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #69#return; {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret8 := main(); {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {1483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-15 07:38:05,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1483#true} {1483#true} #61#return; {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L272 TraceCheckUtils]: 12: Hoare triple {1483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:05,873 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1483#true} {1483#true} #63#return; {1483#true} is VALID [2022-04-15 07:38:05,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {1483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:05,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:05,874 INFO L272 TraceCheckUtils]: 19: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:05,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#true} ~cond := #in~cond; {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:05,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:05,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:05,876 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1539#(and (= main_~x~0 0) (= main_~y~0 0))} #65#return; {1539#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:05,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {1539#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1563#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:05,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {1563#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1567#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:38:05,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {1567#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1571#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0))} is VALID [2022-04-15 07:38:05,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {1571#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-15 07:38:05,878 INFO L272 TraceCheckUtils]: 28: Hoare triple {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:05,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {1483#true} ~cond := #in~cond; {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:05,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {1549#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:05,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:05,880 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1575#(and (= main_~y~0 1) (<= main_~x~0 1) (<= 0 main_~X~0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #65#return; {1591#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} is VALID [2022-04-15 07:38:05,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {1591#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0))} assume !(~x~0 <= ~X~0); {1595#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:05,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {1595#(and (= main_~y~0 1) (<= main_~x~0 1) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= 0 main_~X~0) (not (<= main_~x~0 main_~X~0)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1599#(and (= main_~y~0 1) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is VALID [2022-04-15 07:38:05,888 INFO L272 TraceCheckUtils]: 35: Hoare triple {1599#(and (= main_~y~0 1) (<= 0 main_~X~0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (< main_~X~0 (div main_~xy~0 main_~y~0)) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0))) (<= (div main_~xy~0 main_~y~0) 1) (= main_~Y~0 0)) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 1) (not (<= (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) main_~X~0)) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:05,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:05,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1484#false} is VALID [2022-04-15 07:38:05,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-15 07:38:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 07:38:05,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:19,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {1484#false} assume !false; {1484#false} is VALID [2022-04-15 07:38:19,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {1607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1484#false} is VALID [2022-04-15 07:38:19,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:19,070 INFO L272 TraceCheckUtils]: 35: Hoare triple {1623#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:19,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {1627#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1623#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:19,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1627#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:38:19,072 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {1631#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:19,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:19,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {1645#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:19,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {1483#true} ~cond := #in~cond; {1645#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:19,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:19,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {1652#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1635#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:19,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {1656#(forall ((v_main_~x~0_14 Int)) (or (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_14 main_~y~0))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1652#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:19,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {1660#(forall ((v_main_~x~0_14 Int)) (or (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* v_main_~x~0_14 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1656#(forall ((v_main_~x~0_14 Int)) (or (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1))) (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* v_main_~x~0_14 main_~y~0))))))} is VALID [2022-04-15 07:38:19,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {1483#true} assume !!(~x~0 <= ~X~0); {1660#(forall ((v_main_~x~0_14 Int)) (or (= (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) 2 (* main_~y~0 2) (* main_~Y~0 2)) (+ (* 2 (* v_main_~x~0_14 main_~Y~0)) (* main_~Y~0 2) (* (* v_main_~x~0_14 (+ main_~y~0 1)) 2) (* (* main_~X~0 (+ main_~y~0 1)) (- 2)))) (<= v_main_~x~0_14 main_~X~0) (not (<= v_main_~x~0_14 (+ main_~x~0 1)))))} is VALID [2022-04-15 07:38:19,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1483#true} {1483#true} #65#return; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L272 TraceCheckUtils]: 19: Hoare triple {1483#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {1483#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {1483#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1483#true} {1483#true} #63#return; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-15 07:38:19,079 INFO L272 TraceCheckUtils]: 12: Hoare triple {1483#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1483#true} {1483#true} #61#return; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {1483#true} assume !(0 == ~cond); {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {1483#true} ~cond := #in~cond; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {1483#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {1483#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {1483#true} call #t~ret8 := main(); {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1483#true} {1483#true} #69#return; {1483#true} is VALID [2022-04-15 07:38:19,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1483#true} assume true; {1483#true} is VALID [2022-04-15 07:38:19,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {1483#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(15, 2);call #Ultimate.allocInit(12, 3); {1483#true} is VALID [2022-04-15 07:38:19,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {1483#true} call ULTIMATE.init(); {1483#true} is VALID [2022-04-15 07:38:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 07:38:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:19,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328466064] [2022-04-15 07:38:19,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:19,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738311071] [2022-04-15 07:38:19,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738311071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:19,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:19,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-15 07:38:19,082 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:19,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467668089] [2022-04-15 07:38:19,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467668089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:19,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:19,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:38:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800926978] [2022-04-15 07:38:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:19,082 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:38:19,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:19,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:19,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:19,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:38:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:19,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:38:19,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:38:19,121 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:21,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:38:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:22,070 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-04-15 07:38:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:38:22,070 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-04-15 07:38:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:38:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 07:38:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 07:38:22,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-15 07:38:22,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:22,113 INFO L225 Difference]: With dead ends: 52 [2022-04-15 07:38:22,113 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 07:38:22,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:38:22,114 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:38:22,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 185 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 07:38:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 07:38:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 07:38:22,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:38:22,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:22,166 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:22,166 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:22,168 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-15 07:38:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 07:38:22,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:22,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:22,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:38:22,168 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 44 states. [2022-04-15 07:38:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:22,170 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-15 07:38:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 07:38:22,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:22,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:22,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:38:22,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:38:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 07:38:22,171 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 39 [2022-04-15 07:38:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:38:22,171 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 07:38:22,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:22,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 07:38:22,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 07:38:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:38:22,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:38:22,223 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:38:22,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:38:22,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:22,435 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:38:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:38:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-04-15 07:38:22,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:22,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501940763] [2022-04-15 07:38:22,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:38:22,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-04-15 07:38:22,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:38:22,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202515264] [2022-04-15 07:38:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:38:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:38:22,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:38:22,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [375139091] [2022-04-15 07:38:22,448 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:38:22,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:22,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:38:22,460 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:38:22,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 07:38:22,498 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:38:22,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:38:22,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 07:38:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:38:22,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:38:33,253 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:33,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-15 07:38:33,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(15, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-15 07:38:33,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:33,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #69#return; {2028#true} is VALID [2022-04-15 07:38:33,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {2028#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2028#true} {2028#true} #61#return; {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2028#true} is VALID [2022-04-15 07:38:33,539 INFO L272 TraceCheckUtils]: 12: Hoare triple {2028#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:33,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} ~cond := #in~cond; {2072#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:38:33,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {2072#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2076#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:33,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2076#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:33,545 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2076#(not (= |assume_abort_if_not_#in~cond| 0))} {2028#true} #63#return; {2083#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:38:33,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {2083#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:33,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:33,546 INFO L272 TraceCheckUtils]: 19: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:33,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-15 07:38:33,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-15 07:38:33,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:33,547 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2028#true} {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:33,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:33,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {2087#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2112#(and (= main_~x~0 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:33,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {2112#(and (= main_~x~0 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2116#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:33,549 INFO L290 TraceCheckUtils]: 27: Hoare triple {2116#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:33,549 INFO L272 TraceCheckUtils]: 28: Hoare triple {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:33,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} ~cond := #in~cond; {2127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:33,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {2127#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:33,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:33,552 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} {2120#(and (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {2138#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:33,552 INFO L290 TraceCheckUtils]: 33: Hoare triple {2138#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (<= 1 main_~y~0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2142#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-15 07:38:33,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {2142#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2146#(and (<= main_~x~0 main_~X~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (= main_~x~0 1) (<= main_~Y~0 1) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:38:33,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {2146#(and (<= main_~x~0 main_~X~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (= main_~x~0 1) (<= main_~Y~0 1) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2150#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 4) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:38:33,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {2150#(and (= (+ (- 1) main_~x~0) 1) (= (+ (* main_~X~0 4) (* 2 (* (+ (- 1) main_~x~0) main_~Y~0))) (+ (* (* main_~X~0 main_~y~0) 2) (* main_~Y~0 2))) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2154#(and (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} is VALID [2022-04-15 07:38:33,558 INFO L272 TraceCheckUtils]: 37: Hoare triple {2154#(and (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= (* main_~Y~0 2) main_~yx~0) (<= (* main_~X~0 3) (* main_~Y~0 4)) (<= main_~Y~0 1) (<= 1 main_~X~0) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2158#(exists ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (and (<= 1 v_main_~X~0_BEFORE_CALL_19) (<= v_main_~Y~0_BEFORE_CALL_17 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))))} is VALID [2022-04-15 07:38:33,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {2158#(exists ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (and (<= 1 v_main_~X~0_BEFORE_CALL_19) (<= v_main_~Y~0_BEFORE_CALL_17 1) (<= 1 |__VERIFIER_assert_#in~cond|) (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))))} ~cond := #in~cond; {2162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:33,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-15 07:38:33,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-15 07:38:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 07:38:33,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:37,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-15 07:38:37,139 INFO L290 TraceCheckUtils]: 39: Hoare triple {2162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2029#false} is VALID [2022-04-15 07:38:37,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {2175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:37,139 INFO L272 TraceCheckUtils]: 37: Hoare triple {2179#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:37,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {2183#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2179#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-15 07:38:37,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {2187#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2183#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:37,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {2191#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2187#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-15 07:38:37,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {2195#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {2191#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:38:37,144 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} {2199#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {2195#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:37,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:37,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {2209#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2131#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:37,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} ~cond := #in~cond; {2209#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:37,145 INFO L272 TraceCheckUtils]: 28: Hoare triple {2199#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {2028#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2199#(or (< main_~v~0 0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* main_~X~0 (+ main_~y~0 1)) 2)) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {2028#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {2028#true} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {2028#true} assume !!(~x~0 <= ~X~0); {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2028#true} {2028#true} #65#return; {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:37,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 20: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L272 TraceCheckUtils]: 19: Hoare triple {2028#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {2028#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2028#true} {2028#true} #63#return; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L272 TraceCheckUtils]: 12: Hoare triple {2028#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2028#true} is VALID [2022-04-15 07:38:37,147 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2028#true} {2028#true} #61#return; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !(0 == ~cond); {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} ~cond := #in~cond; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L272 TraceCheckUtils]: 6: Hoare triple {2028#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #69#return; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#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(15, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-15 07:38:37,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-15 07:38:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:38:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:37,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202515264] [2022-04-15 07:38:37,149 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:37,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375139091] [2022-04-15 07:38:37,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375139091] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:37,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:37,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 26 [2022-04-15 07:38:37,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:37,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501940763] [2022-04-15 07:38:37,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501940763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:37,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:37,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:38:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020813515] [2022-04-15 07:38:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:38:37,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:37,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:37,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:37,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:38:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:37,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:38:37,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:38:37,184 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:38,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:38,218 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 07:38:38,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:38:38,218 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-15 07:38:38,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:38:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-15 07:38:38,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2022-04-15 07:38:38,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2022-04-15 07:38:38,299 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-15 07:38:38,301 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:38:38,301 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:38:38,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:38:38,303 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:38:38,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 167 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 12 Unchecked, 0.4s Time] [2022-04-15 07:38:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:38:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 07:38:38,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:38:38,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:38,368 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:38,369 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:38,370 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 07:38:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 07:38:38,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:38,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:38,370 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-04-15 07:38:38,370 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 45 states. [2022-04-15 07:38:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:38,371 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 07:38:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 07:38:38,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:38,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:38,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:38:38,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:38:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:38:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 07:38:38,373 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2022-04-15 07:38:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:38:38,373 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 07:38:38,374 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 07:38:38,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 07:38:38,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 07:38:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 07:38:38,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:38:38,436 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:38:38,455 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-15 07:38:38,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:38,637 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:38:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:38:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-04-15 07:38:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090198610] [2022-04-15 07:38:38,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:38:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-04-15 07:38:38,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:38:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627389434] [2022-04-15 07:38:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:38:38,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:38:38,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:38:38,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698609162] [2022-04-15 07:38:38,652 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:38:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:38,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:38:38,659 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:38:38,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 07:38:38,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:38:38,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:38:38,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 07:38:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:38:38,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:38:39,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {2612#true} call ULTIMATE.init(); {2612#true} is VALID [2022-04-15 07:38:39,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#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(15, 2);call #Ultimate.allocInit(12, 3); {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2612#true} {2612#true} #69#return; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {2612#true} call #t~ret8 := main(); {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {2612#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L272 TraceCheckUtils]: 6: Hoare triple {2612#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2612#true} {2612#true} #61#return; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {2612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2612#true} is VALID [2022-04-15 07:38:39,426 INFO L272 TraceCheckUtils]: 12: Hoare triple {2612#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {2612#true} ~cond := #in~cond; {2656#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:38:39,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {2656#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2660#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:39,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {2660#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2660#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:39,428 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2660#(not (= |assume_abort_if_not_#in~cond| 0))} {2612#true} #63#return; {2667#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} is VALID [2022-04-15 07:38:39,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {2667#(and (<= main_~Y~0 1) (<= 0 main_~Y~0))} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:39,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:39,429 INFO L272 TraceCheckUtils]: 19: Hoare triple {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,430 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2612#true} {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} #65#return; {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:39,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} is VALID [2022-04-15 07:38:39,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {2671#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2696#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:39,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {2696#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:39,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:39,432 INFO L272 TraceCheckUtils]: 28: Hoare triple {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,432 INFO L290 TraceCheckUtils]: 29: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,433 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2612#true} {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} #65#return; {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} is VALID [2022-04-15 07:38:39,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {2700#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (<= main_~Y~0 1) (<= 0 main_~Y~0) (not (< (+ main_~v~0 (* main_~X~0 2)) (* main_~Y~0 2))) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) (+ main_~v~0 (* main_~X~0 2) (* (- 2) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {2722#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} is VALID [2022-04-15 07:38:39,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {2722#(and (= (+ main_~v~0 (* main_~X~0 3)) (* main_~Y~0 4)) (<= main_~x~0 main_~X~0) (= main_~y~0 1) (= main_~x~0 1) (<= main_~Y~0 1) (<= (* main_~Y~0 2) (+ main_~v~0 (* main_~X~0 2))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2726#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1))} is VALID [2022-04-15 07:38:39,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {2726#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (<= main_~x~0 main_~X~0) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (= main_~x~0 1) (<= main_~Y~0 1))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-15 07:38:39,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-15 07:38:39,435 INFO L272 TraceCheckUtils]: 37: Hoare triple {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,436 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,436 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2612#true} {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} #65#return; {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-15 07:38:39,437 INFO L290 TraceCheckUtils]: 42: Hoare triple {2730#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (= main_~x~0 2) (<= 1 main_~X~0))} assume !(~x~0 <= ~X~0); {2752#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (not (<= main_~x~0 main_~X~0)) (= main_~x~0 2) (<= 1 main_~X~0))} is VALID [2022-04-15 07:38:39,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {2752#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (+ (- 1) main_~y~0) 1) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (not (<= main_~x~0 main_~X~0)) (= main_~x~0 2) (<= 1 main_~X~0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2756#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} is VALID [2022-04-15 07:38:39,438 INFO L272 TraceCheckUtils]: 44: Hoare triple {2756#(and (= main_~v~0 (+ (* main_~Y~0 6) (* main_~X~0 (- 5)))) (= (* main_~y~0 2) main_~xy~0) (= (+ (- 1) main_~y~0) 1) (= (* main_~Y~0 2) main_~yx~0) (<= main_~X~0 (* main_~Y~0 2)) (<= main_~Y~0 1) (<= 1 main_~X~0) (not (<= 2 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:39,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:39,439 INFO L290 TraceCheckUtils]: 46: Hoare triple {2764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2613#false} is VALID [2022-04-15 07:38:39,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2022-04-15 07:38:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 07:38:39,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:39,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {2613#false} assume !false; {2613#false} is VALID [2022-04-15 07:38:39,959 INFO L290 TraceCheckUtils]: 46: Hoare triple {2764#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2613#false} is VALID [2022-04-15 07:38:39,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2764#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:39,960 INFO L272 TraceCheckUtils]: 44: Hoare triple {2780#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2760#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:39,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {2784#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2780#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-15 07:38:39,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {2784#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-15 07:38:39,962 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2612#true} {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #65#return; {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:39,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,963 INFO L272 TraceCheckUtils]: 37: Hoare triple {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:39,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {2810#(or (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2788#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-15 07:38:39,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {2814#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2810#(or (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-15 07:38:39,983 INFO L290 TraceCheckUtils]: 33: Hoare triple {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !!(~x~0 <= ~X~0); {2814#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))))} is VALID [2022-04-15 07:38:39,984 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2612#true} {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} #65#return; {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:39,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,985 INFO L272 TraceCheckUtils]: 28: Hoare triple {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,985 INFO L290 TraceCheckUtils]: 27: Hoare triple {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:39,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {2840#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* (+ main_~x~0 2) (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) 2 (* main_~y~0 2) (* main_~Y~0 2))) (<= (+ main_~x~0 2) main_~X~0) (not (<= (+ main_~x~0 1) main_~X~0)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2818#(or (<= (+ main_~x~0 1) main_~X~0) (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1)))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)))) (not (<= main_~x~0 main_~X~0)))} is VALID [2022-04-15 07:38:39,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2840#(or (= (+ main_~v~0 (* (- 1) main_~X~0) (* main_~Y~0 2) (* (* (+ main_~x~0 2) (+ main_~y~0 1)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) 2 (* main_~y~0 2) (* main_~Y~0 2))) (<= (+ main_~x~0 2) main_~X~0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:38:39,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !!(~x~0 <= ~X~0); {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:38:39,992 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2612#true} {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} #65#return; {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:38:39,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,993 INFO L272 TraceCheckUtils]: 19: Hoare triple {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:38:39,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {2612#true} ~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2844#(or (<= (+ main_~x~0 2) main_~X~0) (= (+ (* main_~X~0 (- 3)) main_~v~0 (* main_~Y~0 4) (* (* (+ main_~y~0 2) (+ main_~x~0 2)) 2)) (+ (* 2 (* main_~Y~0 (+ main_~x~0 2))) (* main_~y~0 2) (* main_~Y~0 2) 4)) (< main_~v~0 0) (not (<= (+ main_~x~0 1) main_~X~0)))} is VALID [2022-04-15 07:38:39,994 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2612#true} {2612#true} #63#return; {2612#true} is VALID [2022-04-15 07:38:39,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,994 INFO L272 TraceCheckUtils]: 12: Hoare triple {2612#true} call assume_abort_if_not((if ~Y~0 >= 0 && ~Y~0 <= 1 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {2612#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2612#true} {2612#true} #61#return; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {2612#true} assume !(0 == ~cond); {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {2612#true} ~cond := #in~cond; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L272 TraceCheckUtils]: 6: Hoare triple {2612#true} call assume_abort_if_not((if ~X~0 >= 0 && ~X~0 <= 1 then 1 else 0)); {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {2612#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {2612#true} call #t~ret8 := main(); {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2612#true} {2612#true} #69#return; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2612#true} assume true; {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2612#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(15, 2);call #Ultimate.allocInit(12, 3); {2612#true} is VALID [2022-04-15 07:38:39,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {2612#true} call ULTIMATE.init(); {2612#true} is VALID [2022-04-15 07:38:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 07:38:39,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627389434] [2022-04-15 07:38:39,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698609162] [2022-04-15 07:38:39,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698609162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:39,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:39,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2022-04-15 07:38:39,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:39,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090198610] [2022-04-15 07:38:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090198610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:39,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:39,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:38:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554406113] [2022-04-15 07:38:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:39,997 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:38:39,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:39,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:40,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:40,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:38:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:38:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:38:40,032 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:40,633 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 07:38:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:38:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-04-15 07:38:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:38:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-15 07:38:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-15 07:38:40,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-15 07:38:40,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:40,667 INFO L225 Difference]: With dead ends: 45 [2022-04-15 07:38:40,667 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:38:40,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:38:40,668 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:38:40,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 109 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:38:40,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:38:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:38:40,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:38:40,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:38:40,668 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:38:40,668 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:38:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:40,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:38:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:38:40,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:40,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:40,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:38:40,669 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:38:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:38:40,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:38:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:38:40,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:40,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:38:40,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:38:40,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:38:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:38:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:38:40,669 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-04-15 07:38:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:38:40,670 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:38:40,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 07:38:40,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:38:40,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:38:40,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:38:40,672 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:38:40,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 07:38:40,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:40,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:38:42,447 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-04-15 07:38:42,447 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-04-15 07:38:42,447 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-04-15 07:38:42,447 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-04-15 07:38:42,447 INFO L878 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L11-2(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-15 07:38:42,448 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-15 07:38:42,448 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 53) the Hoare annotation is: true [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse2 (<= main_~Y~0 1)) (.cse4 (<= 0 main_~X~0)) (.cse14 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse13 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse3 (<= 0 main_~Y~0)) (.cse5 (<= main_~X~0 1)) (.cse15 (= main_~y~0 0)) (.cse12 (= main_~yx~0 0))) (or (and (= main_~y~0 2) (= (* main_~y~0 2) main_~xy~0) (= .cse0 main_~yx~0) (<= (* main_~X~0 3) .cse1) .cse2 .cse3 .cse4 .cse5 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~y~0 1) (<= main_~x~0 1) .cse2 .cse3 .cse4 .cse5 (let ((.cse7 (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0)) (.cse9 (* main_~X~0 main_~y~0)) (.cse10 (div .cse13 2)) (.cse8 (= main_~Y~0 0))) (or (let ((.cse6 (div (+ .cse9 .cse10 (* (- 1) main_~Y~0)) main_~Y~0))) (and (= (* main_~y~0 .cse6) main_~xy~0) .cse7 (<= .cse6 1) (not (<= .cse6 main_~X~0)) (not .cse8) (= main_~yx~0 (* main_~Y~0 .cse6)))) (let ((.cse11 (div main_~xy~0 main_~y~0))) (and .cse7 (= (+ .cse9 .cse10) main_~Y~0) (< main_~X~0 .cse11) .cse12 (<= .cse11 1) .cse8)))) (not (<= main_~x~0 main_~X~0))) (and (= main_~x~0 0) .cse14 (= .cse13 .cse0) .cse15 .cse12) (and .cse14 (<= .cse1 .cse13) (< main_~v~0 .cse0) .cse3 .cse5 .cse15 .cse12))) [2022-04-15 07:38:42,448 INFO L885 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2022-04-15 07:38:42,448 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 53) the Hoare annotation is: true [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 45) the Hoare annotation is: (let ((.cse3 (<= main_~Y~0 1)) (.cse6 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse5 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse7 (= main_~y~0 0))) (or (let ((.cse2 (* main_~X~0 main_~y~0)) (.cse1 (* main_~Y~0 main_~x~0))) (and (<= main_~x~0 main_~X~0) (= (+ .cse0 (* 2 .cse1)) (+ (* .cse2 2) main_~X~0 main_~v~0)) (= main_~x~0 1) .cse3 (= main_~X~0 main_~xy~0) .cse4 (<= .cse0 (+ main_~v~0 (* main_~X~0 2))) (= .cse2 main_~xy~0) (= main_~yx~0 .cse1))) (and (= main_~x~0 0) .cse3 .cse5 (<= 0 main_~X~0) .cse4 (= .cse6 .cse0) .cse7) (and (= main_~xy~0 0) (<= (* main_~Y~0 4) .cse6) (< main_~v~0 .cse0) .cse5 .cse4 .cse7 (= main_~yx~0 0)))) [2022-04-15 07:38:42,448 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 45) the Hoare annotation is: (let ((.cse3 (* main_~X~0 3)) (.cse0 (* main_~Y~0 4)) (.cse4 (<= main_~Y~0 1)) (.cse2 (<= main_~X~0 1)) (.cse1 (* main_~Y~0 2))) (or (and (<= .cse0 (+ main_~X~0 main_~v~0)) (< main_~v~0 .cse1) (<= 0 main_~Y~0) .cse2 (= main_~y~0 0)) (and (<= main_~x~0 main_~X~0) (<= .cse3 .cse0) (= (+ (* main_~X~0 4) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) .cse1)) (= main_~x~0 1) .cse4 (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= (+ main_~v~0 .cse3) .cse0) (= main_~x~0 0) (= main_~y~0 1) .cse4 (<= 0 main_~X~0) .cse2 (<= .cse1 (+ main_~v~0 (* main_~X~0 2)))))) [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse3 (<= 0 main_~Y~0)) (.cse1 (+ main_~X~0 main_~v~0)) (.cse5 (= main_~y~0 0)) (.cse8 (* main_~X~0 3)) (.cse0 (* main_~Y~0 4)) (.cse6 (<= main_~Y~0 1)) (.cse7 (<= 0 main_~X~0)) (.cse4 (<= main_~X~0 1)) (.cse2 (* main_~Y~0 2))) (or (and (<= .cse0 .cse1) (< main_~v~0 .cse2) .cse3 .cse4 .cse5) (and (= main_~x~0 0) .cse6 .cse3 .cse7 .cse4 (= .cse1 .cse2) .cse5) (and (= main_~y~0 2) (<= .cse8 .cse0) .cse6 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= (+ main_~v~0 .cse8) .cse0) (= main_~y~0 1) (= main_~x~0 1) .cse6 .cse7 .cse4 (<= .cse2 (+ main_~v~0 (* main_~X~0 2)))))) [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 53) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 47) the Hoare annotation is: (let ((.cse2 (<= main_~Y~0 1)) (.cse6 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse7 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse5 (<= 0 main_~Y~0)) (.cse8 (= main_~y~0 0)) (.cse9 (= main_~yx~0 0))) (or (and (= main_~y~0 2) (= (* (div (* main_~X~0 2) main_~X~0) main_~X~0) main_~xy~0) (= .cse0 main_~yx~0) (<= (* main_~X~0 3) .cse1) .cse2 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (let ((.cse4 (* main_~X~0 main_~y~0)) (.cse3 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 1) (<= main_~x~0 1) (= (+ .cse0 (* 2 .cse3)) (+ (* .cse4 2) main_~X~0 main_~v~0)) .cse2 .cse5 (<= 0 main_~X~0) (= .cse4 main_~xy~0) (not (<= main_~x~0 main_~X~0)) (= main_~yx~0 .cse3))) (and (= main_~x~0 0) .cse6 (= .cse7 .cse0) .cse8 .cse9) (and .cse6 (<= .cse1 .cse7) (< main_~v~0 .cse0) .cse5 (<= main_~X~0 1) .cse8 .cse9))) [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 (* main_~X~0 2)) (.cse0 (* main_~X~0 3)) (.cse2 (<= main_~Y~0 1)) (.cse3 (<= 0 main_~X~0)) (.cse7 (= main_~xy~0 0)) (.cse1 (* main_~Y~0 4)) (.cse9 (+ main_~X~0 main_~v~0)) (.cse5 (* main_~Y~0 2)) (.cse8 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse10 (= main_~y~0 0)) (.cse11 (= main_~yx~0 0))) (or (and (= (+ main_~v~0 .cse0) .cse1) (= main_~y~0 1) (= main_~x~0 1) .cse2 .cse3 .cse4 (<= .cse5 (+ main_~v~0 .cse6)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 2) (= (* (div .cse6 main_~X~0) main_~X~0) main_~xy~0) (= .cse5 main_~yx~0) (<= .cse0 .cse1) .cse2 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~x~0 0) .cse7 .cse2 .cse8 .cse3 .cse4 (= .cse9 .cse5) .cse10 .cse11) (and .cse7 (<= .cse1 .cse9) (< main_~v~0 .cse5) .cse8 .cse4 .cse10 .cse11))) [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 32 47) the Hoare annotation is: (let ((.cse4 (= main_~xy~0 0)) (.cse2 (* main_~Y~0 4)) (.cse8 (+ main_~X~0 main_~v~0)) (.cse5 (<= 0 main_~Y~0)) (.cse9 (= main_~y~0 0)) (.cse10 (= main_~yx~0 0)) (.cse3 (<= main_~Y~0 1)) (.cse6 (<= 0 main_~X~0)) (.cse7 (<= main_~X~0 1)) (.cse1 (* main_~Y~0 2)) (.cse0 (* main_~X~0 2))) (or (and (= main_~y~0 2) (= (* (div .cse0 main_~X~0) main_~X~0) main_~xy~0) (= .cse1 main_~yx~0) (<= (* main_~X~0 3) .cse2) .cse3 (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~x~0 0) .cse4 .cse3 .cse5 .cse6 .cse7 (= .cse8 .cse1) .cse9 .cse10) (and .cse4 (<= .cse2 .cse8) (< main_~v~0 .cse1) .cse5 .cse7 .cse9 .cse10) (let ((.cse12 (* main_~X~0 main_~y~0)) (.cse11 (* main_~Y~0 main_~x~0))) (and (= main_~y~0 1) (= (+ .cse1 (* 2 .cse11)) (+ (* .cse12 2) main_~X~0 main_~v~0)) (= main_~x~0 1) .cse3 .cse6 .cse7 (<= .cse1 (+ main_~v~0 .cse0)) (= .cse12 main_~xy~0) (= main_~yx~0 .cse11))))) [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:38:42,449 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 16) the Hoare annotation is: (forall ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (or (not (<= 1 v_main_~X~0_BEFORE_CALL_19)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (not (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))) (not (<= v_main_~Y~0_BEFORE_CALL_17 1)))) [2022-04-15 07:38:42,449 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-04-15 07:38:42,450 INFO L878 garLoopResultBuilder]: At program point L14(lines 14 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 07:38:42,450 INFO L878 garLoopResultBuilder]: At program point L14-2(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (or (not (<= 1 v_main_~X~0_BEFORE_CALL_19)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (not (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))) (not (<= v_main_~Y~0_BEFORE_CALL_17 1))))) [2022-04-15 07:38:42,450 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (forall ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (or (not (<= 1 v_main_~X~0_BEFORE_CALL_19)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (not (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))) (not (<= v_main_~Y~0_BEFORE_CALL_17 1))))) [2022-04-15 07:38:42,450 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (forall ((v_main_~Y~0_BEFORE_CALL_17 Int) (v_main_~X~0_BEFORE_CALL_19 Int)) (or (not (<= 1 v_main_~X~0_BEFORE_CALL_19)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (not (<= (* v_main_~X~0_BEFORE_CALL_19 3) (* 4 v_main_~Y~0_BEFORE_CALL_17))) (not (<= v_main_~Y~0_BEFORE_CALL_17 1)))) [2022-04-15 07:38:42,452 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-04-15 07:38:42,453 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:38:42,454 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:38:42,458 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:38:42,524 INFO L163 areAnnotationChecker]: CFG has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:38:42,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] [2022-04-15 07:38:42,532 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] [2022-04-15 07:38:42,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:38:42 BoogieIcfgContainer [2022-04-15 07:38:42,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:38:42,534 INFO L158 Benchmark]: Toolchain (without parser) took 179177.04ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 141.7MB in the beginning and 115.5MB in the end (delta: 26.2MB). Peak memory consumption was 117.9MB. Max. memory is 8.0GB. [2022-04-15 07:38:42,534 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 158.0MB in the beginning and 157.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:38:42,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.96ms. Allocated memory is still 189.8MB. Free memory was 141.6MB in the beginning and 165.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 07:38:42,534 INFO L158 Benchmark]: Boogie Preprocessor took 34.60ms. Allocated memory is still 189.8MB. Free memory was 165.8MB in the beginning and 164.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:38:42,534 INFO L158 Benchmark]: RCFGBuilder took 260.06ms. Allocated memory is still 189.8MB. Free memory was 164.5MB in the beginning and 152.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 07:38:42,535 INFO L158 Benchmark]: TraceAbstraction took 178692.21ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 151.9MB in the beginning and 115.5MB in the end (delta: 36.4MB). Peak memory consumption was 128.1MB. Max. memory is 8.0GB. [2022-04-15 07:38:42,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory was 158.0MB in the beginning and 157.9MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.96ms. Allocated memory is still 189.8MB. Free memory was 141.6MB in the beginning and 165.8MB in the end (delta: -24.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.60ms. Allocated memory is still 189.8MB. Free memory was 165.8MB in the beginning and 164.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 260.06ms. Allocated memory is still 189.8MB. Free memory was 164.5MB in the beginning and 152.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 178692.21ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 151.9MB in the beginning and 115.5MB in the end (delta: 36.4MB). Peak memory consumption was 128.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 178.5s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 833 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 671 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1184 IncrementalHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 162 mSDtfsCounter, 1184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 411 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 130 PreInvPairs, 202 NumberOfFragments, 1192 HoareAnnotationTreeSize, 130 FomulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 32 FomulaSimplificationsInter, 693 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((Y * 4 <= X + v && v < Y * 2) && 0 <= Y) && X <= 1) && y == 0) || ((((((x == 0 && Y <= 1) && 0 <= Y) && 0 <= X) && X <= 1) && X + v == Y * 2) && y == 0)) || (((((y == 2 && X * 3 <= Y * 4) && Y <= 1) && x == 2) && x <= X + 1) && v + 5 * X == Y * 6)) || ((((((v + X * 3 == Y * 4 && y == 1) && x == 1) && Y <= 1) && 0 <= X) && X <= 1) && Y * 2 <= v + X * 2) - ProcedureContractResult [Line: 10]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~X~0_BEFORE_CALL_19,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] [2022-04-15 07:38:42,540 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~Y~0_BEFORE_CALL_17,QUANTIFIED] Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || (forall v_main_~Y~0_BEFORE_CALL_17 : int, v_main_~X~0_BEFORE_CALL_19 : int :: ((!(1 <= v_main_~X~0_BEFORE_CALL_19) || !(1 <= \old(cond))) || !(v_main_~X~0_BEFORE_CALL_19 * 3 <= 4 * v_main_~Y~0_BEFORE_CALL_17)) || !(v_main_~Y~0_BEFORE_CALL_17 <= 1)) RESULT: Ultimate proved your program to be correct! [2022-04-15 07:38:42,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...