/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:41:26,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:41:26,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:41:26,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:41:26,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:41:26,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:41:26,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:41:26,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:41:26,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:41:26,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:41:26,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:41:26,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:41:26,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:41:26,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:41:26,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:41:26,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:41:26,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:41:26,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:41:26,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:41:26,693 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:41:26,694 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:41:26,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:41:26,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:41:26,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:41:26,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:41:26,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:41:26,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:41:26,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:41:26,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:41:26,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:41:26,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:41:26,704 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:41:26,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:41:26,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:41:26,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:41:26,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:41:26,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:41:26,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:41:26,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:41:26,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:41:26,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:41:26,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:41:26,709 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:41:26,717 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:41:26,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:41:26,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:41:26,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:41:26,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:41:26,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:41:26,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:41:26,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:41:26,719 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:41:26,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:41:26,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:41:26,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:26,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:41:26,720 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:41:26,720 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-28 09:41:26,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:41:26,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:41:26,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:41:26,924 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:41:26,924 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:41:26,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-28 09:41:26,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca630e54/7f98bda2652b4253a19ba71040df7589/FLAGee09a7340 [2022-04-28 09:41:27,313 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:41:27,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c [2022-04-28 09:41:27,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca630e54/7f98bda2652b4253a19ba71040df7589/FLAGee09a7340 [2022-04-28 09:41:27,326 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca630e54/7f98bda2652b4253a19ba71040df7589 [2022-04-28 09:41:27,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:41:27,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:41:27,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:27,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:41:27,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:41:27,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688f5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27, skipping insertion in model container [2022-04-28 09:41:27,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:41:27,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:41:27,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-28 09:41:27,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:27,496 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:41:27,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.c.i.v+cfa-reducer.c[1110,1123] [2022-04-28 09:41:27,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:41:27,520 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:41:27,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27 WrapperNode [2022-04-28 09:41:27,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:41:27,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:41:27,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:41:27,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:41:27,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:41:27,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:41:27,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:41:27,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:41:27,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (1/1) ... [2022-04-28 09:41:27,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:41:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:27,592 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-28 09:41:27,615 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-28 09:41:27,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:41:27,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:41:27,632 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:41:27,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 09:41:27,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 09:41:27,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:41:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 09:41:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:41:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:41:27,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:41:27,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:41:27,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:41:27,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:41:27,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:41:27,682 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:41:27,683 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:41:27,806 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:41:27,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:41:27,816 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 09:41:27,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:27 BoogieIcfgContainer [2022-04-28 09:41:27,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:41:27,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:41:27,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:41:27,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:41:27,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:41:27" (1/3) ... [2022-04-28 09:41:27,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f2c6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:27, skipping insertion in model container [2022-04-28 09:41:27,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:41:27" (2/3) ... [2022-04-28 09:41:27,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f2c6f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:41:27, skipping insertion in model container [2022-04-28 09:41:27,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:41:27" (3/3) ... [2022-04-28 09:41:27,823 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.c.i.v+cfa-reducer.c [2022-04-28 09:41:27,833 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:41:27,833 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:41:27,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:41:27,864 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c187baf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1899f0fd [2022-04-28 09:41:27,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:41:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:41:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:41:27,874 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:27,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:27,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:27,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1488249160, now seen corresponding path program 1 times [2022-04-28 09:41:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:27,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1410898626] [2022-04-28 09:41:27,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:27,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1488249160, now seen corresponding path program 2 times [2022-04-28 09:41:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:27,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816505844] [2022-04-28 09:41:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:28,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {20#true} is VALID [2022-04-28 09:41:28,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2022-04-28 09:41:28,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #42#return; {20#true} is VALID [2022-04-28 09:41:28,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:28,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {20#true} is VALID [2022-04-28 09:41:28,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume true; {20#true} is VALID [2022-04-28 09:41:28,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20#true} {20#true} #42#return; {20#true} is VALID [2022-04-28 09:41:28,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {20#true} call #t~ret6 := main(); {20#true} is VALID [2022-04-28 09:41:28,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__i~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__j~0 := #t~nondet5;havoc #t~nondet5; {20#true} is VALID [2022-04-28 09:41:28,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#true} assume !!(~main__i~0 >= 0); {20#true} is VALID [2022-04-28 09:41:28,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2022-04-28 09:41:28,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#(and (or (< 0 (+ main_~main__y~0 1)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} assume !(0 != ~main__x~0); {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-28 09:41:28,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#(and (or (< 0 (+ main_~main__y~0 1)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} assume ~main__i~0 == ~main__j~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == ~main__y~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {27#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-28 09:41:28,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {21#false} is VALID [2022-04-28 09:41:28,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-04-28 09:41:28,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:28,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:28,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816505844] [2022-04-28 09:41:28,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816505844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:28,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:28,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:41:28,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:28,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1410898626] [2022-04-28 09:41:28,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1410898626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:28,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:28,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:41:28,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712626913] [2022-04-28 09:41:28,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:28,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:41:28,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:28,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:28,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:41:28,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:41:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:41:28,272 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:28,705 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-28 09:41:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:41:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:41:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 09:41:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-28 09:41:28,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-28 09:41:28,772 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-28 09:41:28,781 INFO L225 Difference]: With dead ends: 32 [2022-04-28 09:41:28,781 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:41:28,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:41:28,788 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:28,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 44 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:41:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:41:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:41:28,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:28,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,822 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,822 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:28,824 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:41:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:28,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:28,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:28,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:41:28,825 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:41:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:28,827 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:41:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:28,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:28,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:28,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:28,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:28,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 09:41:28,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 09:41:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:28,830 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 09:41:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:28,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 09:41:28,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:41:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:41:28,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:41:28,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:41:28,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:41:28,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:41:28,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:41:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1110855594, now seen corresponding path program 1 times [2022-04-28 09:41:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:28,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248387064] [2022-04-28 09:41:28,851 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:41:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1110855594, now seen corresponding path program 2 times [2022-04-28 09:41:28,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:41:28,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986456156] [2022-04-28 09:41:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:41:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:41:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:28,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:41:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:29,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {159#true} is VALID [2022-04-28 09:41:29,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:41:29,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #42#return; {159#true} is VALID [2022-04-28 09:41:29,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {168#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:41:29,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {159#true} is VALID [2022-04-28 09:41:29,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:41:29,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #42#return; {159#true} is VALID [2022-04-28 09:41:29,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret6 := main(); {159#true} is VALID [2022-04-28 09:41:29,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__i~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__j~0 := #t~nondet5;havoc #t~nondet5; {159#true} is VALID [2022-04-28 09:41:29,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(~main__i~0 >= 0); {159#true} is VALID [2022-04-28 09:41:29,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {164#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} is VALID [2022-04-28 09:41:29,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#(and (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0)))} assume 0 != ~main__x~0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {165#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} is VALID [2022-04-28 09:41:29,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {165#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= (+ main_~main__j~0 main_~main__x~0) (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) (+ main_~main__j~0 main_~main__x~0)) (<= main_~main__y~0 0)))} assume !(0 != ~main__x~0); {166#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} is VALID [2022-04-28 09:41:29,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(and (or (not (<= (+ main_~main__y~0 1) 0)) (<= main_~main__j~0 (+ main_~main__i~0 main_~main__y~0))) (or (<= (+ main_~main__i~0 main_~main__y~0) main_~main__j~0) (<= main_~main__y~0 0)))} assume ~main__i~0 == ~main__j~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == ~main__y~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {167#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-28 09:41:29,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {160#false} is VALID [2022-04-28 09:41:29,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 09:41:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:41:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986456156] [2022-04-28 09:41:29,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986456156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:41:29,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959879835] [2022-04-28 09:41:29,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:41:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:41:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:41:29,024 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-28 09:41:29,044 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-28 09:41:29,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:41:29,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:41:29,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 09:41:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:41:29,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:41:29,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2022-04-28 09:41:29,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {159#true} is VALID [2022-04-28 09:41:29,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:41:29,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #42#return; {159#true} is VALID [2022-04-28 09:41:29,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret6 := main(); {159#true} is VALID [2022-04-28 09:41:29,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__i~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__j~0 := #t~nondet5;havoc #t~nondet5; {159#true} is VALID [2022-04-28 09:41:29,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(~main__i~0 >= 0); {159#true} is VALID [2022-04-28 09:41:29,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {193#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} is VALID [2022-04-28 09:41:29,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(and (= main_~main__i~0 main_~main__x~0) (= main_~main__j~0 main_~main__y~0))} assume 0 != ~main__x~0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {197#(and (= (+ (- 1) main_~main__i~0) main_~main__x~0) (= (+ main_~main__y~0 1) main_~main__j~0))} is VALID [2022-04-28 09:41:29,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#(and (= (+ (- 1) main_~main__i~0) main_~main__x~0) (= (+ main_~main__y~0 1) main_~main__j~0))} assume !(0 != ~main__x~0); {201#(and (= (+ main_~main__y~0 1) main_~main__j~0) (= (+ (- 1) main_~main__i~0) 0))} is VALID [2022-04-28 09:41:29,260 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#(and (= (+ main_~main__y~0 1) main_~main__j~0) (= (+ (- 1) main_~main__i~0) 0))} assume ~main__i~0 == ~main__j~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == ~main__y~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {205#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 09:41:29,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {160#false} is VALID [2022-04-28 09:41:29,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 09:41:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:29,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:41:29,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 09:41:29,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {160#false} is VALID [2022-04-28 09:41:29,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} assume ~main__i~0 == ~main__j~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == ~main__y~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {205#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID [2022-04-28 09:41:29,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {222#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} assume !(0 != ~main__x~0); {218#(or (not (= main_~main__j~0 main_~main__i~0)) (= main_~main__y~0 0))} is VALID [2022-04-28 09:41:29,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {226#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= (+ (- 1) main_~main__x~0) 0)) (= (+ (- 1) main_~main__y~0) 0))} assume 0 != ~main__x~0;~main____CPAchecker_TMP_0~0 := ~main__x~0;~main__x~0 := ~main__x~0 - 1;~main____CPAchecker_TMP_1~0 := ~main__y~0;~main__y~0 := ~main__y~0 - 1; {222#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= main_~main__x~0 0)) (= main_~main__y~0 0))} is VALID [2022-04-28 09:41:29,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {159#true} assume !!(~main__j~0 >= 0);~main__x~0 := ~main__i~0;~main__y~0 := ~main__j~0; {226#(or (not (= main_~main__j~0 main_~main__i~0)) (not (= (+ (- 1) main_~main__x~0) 0)) (= (+ (- 1) main_~main__y~0) 0))} is VALID [2022-04-28 09:41:29,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#true} assume !!(~main__i~0 >= 0); {159#true} is VALID [2022-04-28 09:41:29,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} havoc ~main__i~0;havoc ~main__j~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__i~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__j~0 := #t~nondet5;havoc #t~nondet5; {159#true} is VALID [2022-04-28 09:41:29,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret6 := main(); {159#true} is VALID [2022-04-28 09:41:29,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #42#return; {159#true} is VALID [2022-04-28 09:41:29,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 09:41:29,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#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(27, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_72~0 := 0; {159#true} is VALID [2022-04-28 09:41:29,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {159#true} is VALID [2022-04-28 09:41:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:41:29,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959879835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:41:29,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:41:29,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-04-28 09:41:29,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:41:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248387064] [2022-04-28 09:41:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248387064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:41:29,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:41:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:41:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027205904] [2022-04-28 09:41:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:41:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:41:29,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:41:29,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:29,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:29,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:41:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:41:29,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:41:29,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:41:29,459 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:29,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:29,584 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:41:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:41:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:41:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:41:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 09:41:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2022-04-28 09:41:29,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 13 transitions. [2022-04-28 09:41:29,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:41:29,598 INFO L225 Difference]: With dead ends: 14 [2022-04-28 09:41:29,598 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:41:29,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:41:29,599 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:41:29,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:41:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:41:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:41:29,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:41:29,600 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-28 09:41:29,600 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-28 09:41:29,600 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-28 09:41:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:29,600 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:29,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:29,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:29,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:29,601 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-28 09:41:29,601 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-28 09:41:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:41:29,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:41:29,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:29,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:29,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:41:29,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:41:29,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:41:29,601 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-28 09:41:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:41:29,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-28 09:41:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:41:29,601 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:41:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:41:29,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:41:29,602 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-28 09:41:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:41:29,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:41:29,604 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:41:29,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:41:29,822 WARN L477 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-28 09:41:29,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:41:29,981 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 09:41:29,982 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 53) the Hoare annotation is: false [2022-04-28 09:41:29,982 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 13 70) the Hoare annotation is: (= |old(~__return_72~0)| ~__return_72~0) [2022-04-28 09:41:29,982 INFO L895 garLoopResultBuilder]: At program point L25(lines 25 68) the Hoare annotation is: (= |old(~__return_72~0)| ~__return_72~0) [2022-04-28 09:41:29,982 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 13 70) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_72~0)| ~__return_72~0)) [2022-04-28 09:41:29,982 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: false [2022-04-28 09:41:29,983 INFO L895 garLoopResultBuilder]: At program point L19(lines 19 69) the Hoare annotation is: (= |old(~__return_72~0)| ~__return_72~0) [2022-04-28 09:41:29,983 INFO L895 garLoopResultBuilder]: At program point L51(lines 51 60) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~main__y~0 1))) (.cse2 (+ main_~main__i~0 main_~main__y~0)) (.cse1 (+ main_~main__j~0 main_~main__x~0)) (.cse3 (<= main_~main__y~0 0))) (and (or .cse0 (<= .cse1 .cse2)) (or .cse0 (<= main_~main__j~0 .cse2)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_72~0)| ~__return_72~0) (or (<= .cse2 main_~main__j~0) .cse3) (or (<= .cse2 .cse1) .cse3))) [2022-04-28 09:41:29,983 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 13 70) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_72~0)| ~__return_72~0)) [2022-04-28 09:41:29,984 INFO L895 garLoopResultBuilder]: At program point L44(lines 44 66) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~main__y~0 1))) (.cse2 (+ main_~main__i~0 main_~main__y~0)) (.cse1 (+ main_~main__j~0 main_~main__x~0)) (.cse3 (<= main_~main__y~0 0))) (and (or .cse0 (<= .cse1 .cse2)) (or .cse0 (<= main_~main__j~0 .cse2)) (= |old(~__return_72~0)| ~__return_72~0) (or (<= .cse2 main_~main__j~0) .cse3) (or (<= .cse2 .cse1) .cse3))) [2022-04-28 09:41:29,984 INFO L895 garLoopResultBuilder]: At program point L40(lines 30 68) the Hoare annotation is: (let ((.cse1 (+ main_~main__j~0 main_~main__x~0)) (.cse0 (+ main_~main__i~0 main_~main__y~0))) (and (<= .cse0 .cse1) (= |old(~__return_72~0)| ~__return_72~0) (<= .cse1 .cse0))) [2022-04-28 09:41:29,984 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,985 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_72~0)| ~__return_72~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:41:29,985 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,985 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,985 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,985 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,985 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:41:29,987 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 09:41:29,989 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:41:29,994 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:41:29,995 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 09:41:29,995 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:41:29,996 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:41:29,996 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:41:29,997 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 09:41:30,006 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:41:30,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:41:30 BoogieIcfgContainer [2022-04-28 09:41:30,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:41:30,021 INFO L158 Benchmark]: Toolchain (without parser) took 2690.27ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 154.1MB in the beginning and 143.8MB in the end (delta: 10.4MB). Peak memory consumption was 78.2MB. Max. memory is 8.0GB. [2022-04-28 09:41:30,021 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:41:30,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.04ms. Allocated memory is still 203.4MB. Free memory was 153.9MB in the beginning and 178.6MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:30,021 INFO L158 Benchmark]: Boogie Preprocessor took 36.42ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 09:41:30,021 INFO L158 Benchmark]: RCFGBuilder took 258.49ms. Allocated memory is still 203.4MB. Free memory was 177.1MB in the beginning and 166.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 09:41:30,022 INFO L158 Benchmark]: TraceAbstraction took 2198.87ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 166.1MB in the beginning and 143.8MB in the end (delta: 22.3MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. [2022-04-28 09:41:30,023 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.14ms. Allocated memory is still 203.4MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.04ms. Allocated memory is still 203.4MB. Free memory was 153.9MB in the beginning and 178.6MB in the end (delta: -24.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.42ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 258.49ms. Allocated memory is still 203.4MB. Free memory was 177.1MB in the beginning and 166.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2198.87ms. Allocated memory was 203.4MB in the beginning and 270.5MB in the end (delta: 67.1MB). Free memory was 166.1MB in the beginning and 143.8MB in the end (delta: 22.3MB). Peak memory consumption was 90.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: 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 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 73 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 25 mSDtfsCounter, 73 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 30 NumberOfFragments, 164 HoareAnnotationTreeSize, 17 FomulaSimplifications, 150 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: 30]: Loop Invariant Derived loop invariant: (main__i + main__y <= main__j + main__x && \old(__return_72) == __return_72) && main__j + main__x <= main__i + main__y - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_72) == __return_72 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:41:30,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...