/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/loops-crafted-1/theatreSquare.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:03:06,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:03:06,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:03:06,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:03:06,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:03:06,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:03:06,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:03:06,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:03:06,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:03:06,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:03:06,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:03:06,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:03:06,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:03:06,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:03:06,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:03:06,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:03:06,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:03:06,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:03:06,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:03:06,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:03:06,778 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:03:06,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:03:06,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:03:06,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:03:06,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:03:06,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:03:06,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:03:06,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:03:06,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:03:06,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:03:06,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:03:06,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:03:06,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:03:06,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:03:06,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:03:06,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:03:06,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:03:06,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:03:06,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:03:06,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:03:06,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:03:06,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:03:06,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:03:06,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:03:06,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:03:06,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:03:06,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:03:06,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:03:06,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:03:06,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:03:06,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:03:06,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:03:06,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:03:06,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:03:06,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:03:06,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:03:06,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:03:06,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:03:06,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:03:06,815 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:03:06,815 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:03:06,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:03:06,815 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:03:06,815 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 04:03:07,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:03:07,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:03:07,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:03:07,081 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:03:07,081 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:03:07,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-28 04:03:07,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dec6e9b9/703ccaecacc142089eeb39953fb884e3/FLAG0ed2c2ff2 [2022-04-28 04:03:07,543 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:03:07,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c [2022-04-28 04:03:07,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dec6e9b9/703ccaecacc142089eeb39953fb884e3/FLAG0ed2c2ff2 [2022-04-28 04:03:07,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dec6e9b9/703ccaecacc142089eeb39953fb884e3 [2022-04-28 04:03:07,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:03:07,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:03:07,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:03:07,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:03:07,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:03:07,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:03:07" (1/1) ... [2022-04-28 04:03:07,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60043f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:07, skipping insertion in model container [2022-04-28 04:03:07,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:03:07" (1/1) ... [2022-04-28 04:03:07,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:03:07,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:03:08,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-28 04:03:08,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:03:08,113 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:03:08,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/theatreSquare.c[370,383] [2022-04-28 04:03:08,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:03:08,143 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:03:08,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08 WrapperNode [2022-04-28 04:03:08,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:03:08,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:03:08,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:03:08,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:03:08,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:03:08,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:03:08,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:03:08,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:03:08,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (1/1) ... [2022-04-28 04:03:08,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:03:08,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:08,210 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 04:03:08,219 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 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure correct_version [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure student_version [2022-04-28 04:03:08,246 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:03:08,246 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure correct_version [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure student_version [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:03:08,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:03:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:03:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:03:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:03:08,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:03:08,317 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:03:08,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:03:08,596 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:03:08,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:03:08,602 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-28 04:03:08,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:03:08 BoogieIcfgContainer [2022-04-28 04:03:08,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:03:08,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:03:08,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:03:08,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:03:08,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:03:07" (1/3) ... [2022-04-28 04:03:08,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637cdff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:03:08, skipping insertion in model container [2022-04-28 04:03:08,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:03:08" (2/3) ... [2022-04-28 04:03:08,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@637cdff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:03:08, skipping insertion in model container [2022-04-28 04:03:08,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:03:08" (3/3) ... [2022-04-28 04:03:08,611 INFO L111 eAbstractionObserver]: Analyzing ICFG theatreSquare.c [2022-04-28 04:03:08,622 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:03:08,622 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:03:08,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:03:08,678 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@322b8712, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62dbab4b [2022-04-28 04:03:08,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:03:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 04:03:08,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:03:08,702 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:08,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:08,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1554304209, now seen corresponding path program 1 times [2022-04-28 04:03:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:08,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1267410238] [2022-04-28 04:03:08,733 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:03:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1554304209, now seen corresponding path program 2 times [2022-04-28 04:03:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:08,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93652322] [2022-04-28 04:03:08,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:09,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:09,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(16, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 04:03:09,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:03:09,051 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #117#return; {42#true} is VALID [2022-04-28 04:03:09,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:09,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(16, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-28 04:03:09,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:03:09,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #117#return; {42#true} is VALID [2022-04-28 04:03:09,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret10 := main(); {42#true} is VALID [2022-04-28 04:03:09,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-28 04:03:09,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} assume !(((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109); {47#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-28 04:03:09,058 INFO L272 TraceCheckUtils]: 7: Hoare triple {47#(= main_~n_stones2~0 main_~n_stones1~0)} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {48#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:09,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {49#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:09,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {49#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {43#false} is VALID [2022-04-28 04:03:09,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 04:03:09,060 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 04:03:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93652322] [2022-04-28 04:03:09,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93652322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:09,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:09,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:03:09,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:09,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1267410238] [2022-04-28 04:03:09,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1267410238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:09,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:09,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:03:09,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504968788] [2022-04-28 04:03:09,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:09,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:03:09,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:09,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:09,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:09,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:03:09,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:03:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:03:09,122 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 28 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:09,592 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2022-04-28 04:03:09,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:03:09,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:03:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 04:03:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:09,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2022-04-28 04:03:09,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 103 transitions. [2022-04-28 04:03:09,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:09,740 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:03:09,740 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 04:03:09,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:03:09,748 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:09,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 61 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:03:09,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 04:03:09,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 04:03:09,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:09,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:03:09,778 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:03:09,778 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:03:09,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:09,785 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 04:03:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 04:03:09,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:09,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:09,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 04:03:09,790 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-28 04:03:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:09,794 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-28 04:03:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 04:03:09,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:09,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:09,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:09,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:09,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:03:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-28 04:03:09,800 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2022-04-28 04:03:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:09,802 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-28 04:03:09,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:09,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-28 04:03:09,855 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-28 04:03:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-28 04:03:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 04:03:09,857 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:09,858 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:09,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:03:09,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash 362112746, now seen corresponding path program 1 times [2022-04-28 04:03:09,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:09,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773355733] [2022-04-28 04:03:09,860 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:03:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 362112746, now seen corresponding path program 2 times [2022-04-28 04:03:09,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:09,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21753643] [2022-04-28 04:03:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:09,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:03:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:09,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(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(16, 2);call #Ultimate.allocInit(12, 3); {341#true} is VALID [2022-04-28 04:03:09,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume true; {341#true} is VALID [2022-04-28 04:03:09,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {341#true} {341#true} #117#return; {341#true} is VALID [2022-04-28 04:03:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 04:03:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:10,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {341#true} is VALID [2022-04-28 04:03:10,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume !(~b~0 < ~n); {341#true} is VALID [2022-04-28 04:03:10,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(~l~0 < ~m); {341#true} is VALID [2022-04-28 04:03:10,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#true} ~x~0 := 0;~y~0 := 0; {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-28 04:03:10,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} assume !(~x~0 < ~i~0); {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-28 04:03:10,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} #res := ~y~0; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-28 04:03:10,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} assume true; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-28 04:03:10,049 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {341#true} #111#return; {354#(= |main_#t~ret8| 0)} is VALID [2022-04-28 04:03:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 04:03:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:10,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {341#true} is VALID [2022-04-28 04:03:10,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#true} assume !(~b~1 < ~n); {341#true} is VALID [2022-04-28 04:03:10,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume !(~l~1 < ~m); {341#true} is VALID [2022-04-28 04:03:10,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {341#true} ~x~1 := 0;~y~1 := 0; {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-28 04:03:10,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} assume !(~x~1 < ~i~1); {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-28 04:03:10,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} #res := ~y~1; {372#(= |student_version_#res| 0)} is VALID [2022-04-28 04:03:10,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= |student_version_#res| 0)} assume true; {372#(= |student_version_#res| 0)} is VALID [2022-04-28 04:03:10,129 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {372#(= |student_version_#res| 0)} {355#(= main_~n_stones1~0 0)} #113#return; {364#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-28 04:03:10,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {341#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:03:10,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(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(16, 2);call #Ultimate.allocInit(12, 3); {341#true} is VALID [2022-04-28 04:03:10,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#true} assume true; {341#true} is VALID [2022-04-28 04:03:10,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {341#true} {341#true} #117#return; {341#true} is VALID [2022-04-28 04:03:10,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {341#true} call #t~ret10 := main(); {341#true} is VALID [2022-04-28 04:03:10,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {341#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {341#true} is VALID [2022-04-28 04:03:10,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {341#true} assume ((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109; {341#true} is VALID [2022-04-28 04:03:10,132 INFO L272 TraceCheckUtils]: 7: Hoare triple {341#true} call #t~ret8 := correct_version(~n~0, ~m~0, ~a~0); {341#true} is VALID [2022-04-28 04:03:10,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {341#true} is VALID [2022-04-28 04:03:10,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#true} assume !(~b~0 < ~n); {341#true} is VALID [2022-04-28 04:03:10,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {341#true} assume !(~l~0 < ~m); {341#true} is VALID [2022-04-28 04:03:10,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {341#true} ~x~0 := 0;~y~0 := 0; {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-28 04:03:10,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} assume !(~x~0 < ~i~0); {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} is VALID [2022-04-28 04:03:10,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#(and (<= correct_version_~y~0 0) (<= 0 correct_version_~y~0))} #res := ~y~0; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-28 04:03:10,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} assume true; {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} is VALID [2022-04-28 04:03:10,136 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {370#(and (<= 0 |correct_version_#res|) (<= |correct_version_#res| 0))} {341#true} #111#return; {354#(= |main_#t~ret8| 0)} is VALID [2022-04-28 04:03:10,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {354#(= |main_#t~ret8| 0)} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~n_stones1~0 := #t~ret8;havoc #t~ret8; {355#(= main_~n_stones1~0 0)} is VALID [2022-04-28 04:03:10,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {355#(= main_~n_stones1~0 0)} call #t~ret9 := student_version(~n~0, ~m~0, ~a~0); {341#true} is VALID [2022-04-28 04:03:10,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {341#true} is VALID [2022-04-28 04:03:10,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#true} assume !(~b~1 < ~n); {341#true} is VALID [2022-04-28 04:03:10,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {341#true} assume !(~l~1 < ~m); {341#true} is VALID [2022-04-28 04:03:10,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {341#true} ~x~1 := 0;~y~1 := 0; {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-28 04:03:10,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} assume !(~x~1 < ~i~1); {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} is VALID [2022-04-28 04:03:10,139 INFO L290 TraceCheckUtils]: 23: Hoare triple {371#(and (<= 0 student_version_~y~1) (<= student_version_~y~1 0))} #res := ~y~1; {372#(= |student_version_#res| 0)} is VALID [2022-04-28 04:03:10,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {372#(= |student_version_#res| 0)} assume true; {372#(= |student_version_#res| 0)} is VALID [2022-04-28 04:03:10,140 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {372#(= |student_version_#res| 0)} {355#(= main_~n_stones1~0 0)} #113#return; {364#(= main_~n_stones1~0 |main_#t~ret9|)} is VALID [2022-04-28 04:03:10,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {364#(= main_~n_stones1~0 |main_#t~ret9|)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~n_stones2~0 := #t~ret9;havoc #t~ret9; {365#(= main_~n_stones2~0 main_~n_stones1~0)} is VALID [2022-04-28 04:03:10,142 INFO L272 TraceCheckUtils]: 27: Hoare triple {365#(= main_~n_stones2~0 main_~n_stones1~0)} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:03:10,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {366#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {367#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:03:10,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {367#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {342#false} is VALID [2022-04-28 04:03:10,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {342#false} assume !false; {342#false} is VALID [2022-04-28 04:03:10,143 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 04:03:10,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:10,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21753643] [2022-04-28 04:03:10,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21753643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:10,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:10,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:03:10,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:10,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773355733] [2022-04-28 04:03:10,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773355733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:10,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:10,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:03:10,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321623534] [2022-04-28 04:03:10,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 04:03:10,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:10,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:03:10,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:10,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:03:10,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:03:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:03:10,174 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:03:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:11,065 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-28 04:03:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:03:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-28 04:03:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:03:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-28 04:03:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:03:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2022-04-28 04:03:11,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2022-04-28 04:03:11,131 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-28 04:03:11,133 INFO L225 Difference]: With dead ends: 50 [2022-04-28 04:03:11,133 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 04:03:11,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:03:11,134 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:11,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:03:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 04:03:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-28 04:03:11,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:11,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:03:11,154 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:03:11,155 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:03:11,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:11,158 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 04:03:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 04:03:11,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:11,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:11,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-28 04:03:11,159 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 44 states. [2022-04-28 04:03:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:11,162 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 04:03:11,162 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-28 04:03:11,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:11,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:11,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:11,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:11,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-28 04:03:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-28 04:03:11,165 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 31 [2022-04-28 04:03:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:11,165 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-28 04:03:11,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:03:11,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-28 04:03:11,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:11,210 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-28 04:03:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:03:11,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:11,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:11,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:03:11,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:11,212 INFO L85 PathProgramCache]: Analyzing trace with hash -310269904, now seen corresponding path program 1 times [2022-04-28 04:03:11,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:11,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [553037324] [2022-04-28 04:03:15,402 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:03:15,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {1={2=2}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:03:15,523 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:03:15,526 INFO L85 PathProgramCache]: Analyzing trace with hash 470809425, now seen corresponding path program 1 times [2022-04-28 04:03:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:03:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312967293] [2022-04-28 04:03:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:03:15,563 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:03:15,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838935532] [2022-04-28 04:03:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:03:15,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:15,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:03:15,575 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 04:03:15,582 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 04:03:15,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:15,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:03:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:03:15,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:03:15,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {670#true} call ULTIMATE.init(); {670#true} is VALID [2022-04-28 04:03:15,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#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(16, 2);call #Ultimate.allocInit(12, 3); {670#true} is VALID [2022-04-28 04:03:15,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume true; {670#true} is VALID [2022-04-28 04:03:15,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {670#true} {670#true} #117#return; {670#true} is VALID [2022-04-28 04:03:15,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {670#true} call #t~ret10 := main(); {670#true} is VALID [2022-04-28 04:03:15,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {670#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~n~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~m~0 := #t~nondet6;havoc #t~nondet6;havoc ~n_stones1~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~n_stones2~0 := #t~nondet7;havoc #t~nondet7;~n_stones1~0 := ~n_stones2~0; {670#true} is VALID [2022-04-28 04:03:15,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#true} assume ((((1 <= ~n~0 && 1 <= ~m~0) && 1 <= ~a~0) && ~n~0 <= 109) && ~m~0 <= 109) && ~a~0 <= 109; {693#(<= 1 main_~n~0)} is VALID [2022-04-28 04:03:15,845 INFO L272 TraceCheckUtils]: 7: Hoare triple {693#(<= 1 main_~n~0)} call #t~ret8 := correct_version(~n~0, ~m~0, ~a~0); {670#true} is VALID [2022-04-28 04:03:15,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {670#true} ~n := #in~n;~m := #in~m;~a := #in~a;~i~0 := 0;~j~0 := 0;~b~0 := 0;~l~0 := 0; {700#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n))} is VALID [2022-04-28 04:03:15,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {700#(and (<= correct_version_~b~0 0) (<= |correct_version_#in~n| correct_version_~n))} assume !(~b~0 < ~n); {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {704#(<= |correct_version_#in~n| 0)} assume !(~l~0 < ~m); {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {704#(<= |correct_version_#in~n| 0)} ~x~0 := 0;~y~0 := 0; {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {704#(<= |correct_version_#in~n| 0)} assume !(~x~0 < ~i~0); {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {704#(<= |correct_version_#in~n| 0)} #res := ~y~0; {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(<= |correct_version_#in~n| 0)} assume true; {704#(<= |correct_version_#in~n| 0)} is VALID [2022-04-28 04:03:15,852 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {704#(<= |correct_version_#in~n| 0)} {693#(<= 1 main_~n~0)} #111#return; {671#false} is VALID [2022-04-28 04:03:15,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {671#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~n_stones1~0 := #t~ret8;havoc #t~ret8; {671#false} is VALID [2022-04-28 04:03:15,853 INFO L272 TraceCheckUtils]: 17: Hoare triple {671#false} call #t~ret9 := student_version(~n~0, ~m~0, ~a~0); {671#false} is VALID [2022-04-28 04:03:15,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {671#false} ~n := #in~n;~m := #in~m;~a := #in~a;~i~1 := 0;~j~1 := 0;~b~1 := 0;~l~1 := 0; {671#false} is VALID [2022-04-28 04:03:15,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {671#false} assume !(~b~1 < ~n); {671#false} is VALID [2022-04-28 04:03:15,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {671#false} assume !(~l~1 < ~m); {671#false} is VALID [2022-04-28 04:03:15,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {671#false} ~x~1 := 0;~y~1 := 0; {671#false} is VALID [2022-04-28 04:03:15,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {671#false} [121] L79-2-->L79-3_primed: Formula: (let ((.cse0 (= v_student_version_~x~1_6 v_student_version_~x~1_5)) (.cse1 (= v_student_version_~y~1_6 v_student_version_~y~1_5))) (or (and (= v_student_version_~i~1_6 v_student_version_~i~1_6) .cse0 .cse1 (= v_student_version_~j~1_5 v_student_version_~j~1_5)) (and .cse0 (<= v_student_version_~i~1_6 v_student_version_~x~1_6) .cse1) (and (< v_student_version_~x~1_5 (+ v_student_version_~i~1_6 1)) (< v_student_version_~x~1_6 v_student_version_~x~1_5) (= (+ (* v_student_version_~j~1_5 v_student_version_~x~1_6) v_student_version_~y~1_5) (+ (* v_student_version_~j~1_5 v_student_version_~x~1_5) v_student_version_~y~1_6))))) InVars {student_version_~i~1=v_student_version_~i~1_6, student_version_~y~1=v_student_version_~y~1_6, student_version_~x~1=v_student_version_~x~1_6, student_version_~j~1=v_student_version_~j~1_5} OutVars{student_version_~i~1=v_student_version_~i~1_6, student_version_~y~1=v_student_version_~y~1_5, student_version_~x~1=v_student_version_~x~1_5, student_version_~j~1=v_student_version_~j~1_5} AuxVars[] AssignedVars[student_version_~y~1, student_version_~x~1] {671#false} is VALID [2022-04-28 04:03:15,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {671#false} [120] L79-3_primed-->L79-3: Formula: (not (< v_student_version_~x~1_2 v_student_version_~i~1_3)) InVars {student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} OutVars{student_version_~i~1=v_student_version_~i~1_3, student_version_~x~1=v_student_version_~x~1_2} AuxVars[] AssignedVars[] {671#false} is VALID [2022-04-28 04:03:15,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {671#false} #res := ~y~1; {671#false} is VALID [2022-04-28 04:03:15,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {671#false} assume true; {671#false} is VALID [2022-04-28 04:03:15,854 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {671#false} {671#false} #113#return; {671#false} is VALID [2022-04-28 04:03:15,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {671#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~n_stones2~0 := #t~ret9;havoc #t~ret9; {671#false} is VALID [2022-04-28 04:03:15,855 INFO L272 TraceCheckUtils]: 28: Hoare triple {671#false} call __VERIFIER_assert((if ~n_stones1~0 == ~n_stones2~0 then 1 else 0)); {671#false} is VALID [2022-04-28 04:03:15,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {671#false} ~cond := #in~cond; {671#false} is VALID [2022-04-28 04:03:15,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {671#false} assume 0 == ~cond; {671#false} is VALID [2022-04-28 04:03:15,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {671#false} assume !false; {671#false} is VALID [2022-04-28 04:03:15,855 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 04:03:15,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:03:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:03:15,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312967293] [2022-04-28 04:03:15,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:03:15,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838935532] [2022-04-28 04:03:15,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838935532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:15,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:15,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:03:16,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:03:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [553037324] [2022-04-28 04:03:16,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [553037324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:03:16,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:03:16,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:03:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898985573] [2022-04-28 04:03:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:03:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2022-04-28 04:03:16,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:03:16,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:03:16,041 WARN L143 InductivityCheck]: Transition 771#(and (= |student_version_#in~a| student_version_~a) (<= |correct_version_#in~n| 0) (= student_version_~l~1 0) (= student_version_~i~1 0) (= |student_version_#in~m| student_version_~m) (not (< student_version_~b~1 student_version_~n)) (<= 0 (+ main_~n_stones1~0 2147483648)) (not (< student_version_~l~1 student_version_~m)) (= student_version_~j~1 0) (<= main_~n_stones1~0 2147483647) (= |student_version_#in~n| student_version_~n) (= student_version_~b~1 0)) ( _ , ~x~1 := 0;~y~1 := 0; , 671#false ) not inductive [2022-04-28 04:03:16,067 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 04:03:16,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:03:16,243 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 04:03:16,246 INFO L158 Benchmark]: Toolchain (without parser) took 8317.58ms. Allocated memory was 184.5MB in the beginning and 223.3MB in the end (delta: 38.8MB). Free memory was 135.6MB in the beginning and 180.7MB in the end (delta: -45.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:03:16,247 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:03:16,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.18ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 159.4MB in the end (delta: -23.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:03:16,247 INFO L158 Benchmark]: Boogie Preprocessor took 39.75ms. Allocated memory is still 184.5MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 04:03:16,248 INFO L158 Benchmark]: RCFGBuilder took 419.65ms. Allocated memory is still 184.5MB. Free memory was 157.8MB in the beginning and 143.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-28 04:03:16,248 INFO L158 Benchmark]: TraceAbstraction took 7640.08ms. Allocated memory was 184.5MB in the beginning and 223.3MB in the end (delta: 38.8MB). Free memory was 142.6MB in the beginning and 180.7MB in the end (delta: -38.1MB). Peak memory consumption was 1.8MB. Max. memory is 8.0GB. [2022-04-28 04:03:16,250 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.13ms. Allocated memory is still 184.5MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.18ms. Allocated memory is still 184.5MB. Free memory was 135.4MB in the beginning and 159.4MB in the end (delta: -23.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.75ms. Allocated memory is still 184.5MB. Free memory was 159.4MB in the beginning and 157.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 419.65ms. Allocated memory is still 184.5MB. Free memory was 157.8MB in the beginning and 143.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7640.08ms. Allocated memory was 184.5MB in the beginning and 223.3MB in the end (delta: 38.8MB). Free memory was 142.6MB in the beginning and 180.7MB in the end (delta: -38.1MB). Peak memory consumption was 1.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:03:16,274 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...