java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 06:44:17,033 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 06:44:17,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 06:44:17,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 06:44:17,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 06:44:17,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 06:44:17,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 06:44:17,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 06:44:17,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 06:44:17,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 06:44:17,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 06:44:17,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 06:44:17,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 06:44:17,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 06:44:17,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 06:44:17,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 06:44:17,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 06:44:17,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 06:44:17,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 06:44:17,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 06:44:17,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 06:44:17,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 06:44:17,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 06:44:17,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 06:44:17,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 06:44:17,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 06:44:17,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 06:44:17,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 06:44:17,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 06:44:17,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 06:44:17,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 06:44:17,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 06:44:17,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 06:44:17,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 06:44:17,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 06:44:17,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 06:44:17,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 06:44:17,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 06:44:17,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 06:44:17,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 06:44:17,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 06:44:17,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 06:44:17,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 06:44:17,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 06:44:17,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 06:44:17,117 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 06:44:17,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 06:44:17,118 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 06:44:17,118 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 06:44:17,119 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 06:44:17,119 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 06:44:17,119 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 06:44:17,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 06:44:17,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 06:44:17,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 06:44:17,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 06:44:17,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 06:44:17,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 06:44:17,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 06:44:17,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 06:44:17,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 06:44:17,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 06:44:17,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 06:44:17,124 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 06:44:17,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 06:44:17,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 06:44:17,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 06:44:17,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 06:44:17,125 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 06:44:17,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 06:44:17,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 06:44:17,126 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 06:44:17,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 06:44:17,199 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 06:44:17,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 06:44:17,204 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 06:44:17,205 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 06:44:17,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label10.c [2019-09-09 06:44:17,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9f266f8/2ec704d1f6384eafbcc6cf12c43ab761/FLAGfa72c047b [2019-09-09 06:44:17,788 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 06:44:17,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label10.c [2019-09-09 06:44:17,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9f266f8/2ec704d1f6384eafbcc6cf12c43ab761/FLAGfa72c047b [2019-09-09 06:44:18,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c9f266f8/2ec704d1f6384eafbcc6cf12c43ab761 [2019-09-09 06:44:18,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 06:44:18,086 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 06:44:18,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 06:44:18,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 06:44:18,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 06:44:18,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fc2b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18, skipping insertion in model container [2019-09-09 06:44:18,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,102 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 06:44:18,154 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 06:44:18,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 06:44:18,547 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 06:44:18,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 06:44:18,808 INFO L192 MainTranslator]: Completed translation [2019-09-09 06:44:18,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18 WrapperNode [2019-09-09 06:44:18,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 06:44:18,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 06:44:18,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 06:44:18,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 06:44:18,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... [2019-09-09 06:44:18,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 06:44:18,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 06:44:18,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 06:44:18,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 06:44:18,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 06:44:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 06:44:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 06:44:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 06:44:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 06:44:19,017 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 06:44:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 06:44:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 06:44:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 06:44:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 06:44:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 06:44:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 06:44:20,184 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 06:44:20,184 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 06:44:20,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:44:20 BoogieIcfgContainer [2019-09-09 06:44:20,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 06:44:20,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 06:44:20,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 06:44:20,191 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 06:44:20,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 06:44:18" (1/3) ... [2019-09-09 06:44:20,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:44:20, skipping insertion in model container [2019-09-09 06:44:20,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:44:18" (2/3) ... [2019-09-09 06:44:20,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5f86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:44:20, skipping insertion in model container [2019-09-09 06:44:20,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:44:20" (3/3) ... [2019-09-09 06:44:20,202 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label10.c [2019-09-09 06:44:20,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 06:44:20,225 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 06:44:20,241 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 06:44:20,269 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 06:44:20,269 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 06:44:20,270 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 06:44:20,270 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 06:44:20,270 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 06:44:20,270 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 06:44:20,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 06:44:20,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 06:44:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-09-09 06:44:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-09 06:44:20,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:44:20,316 INFO L399 BasicCegarLoop]: 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:44:20,318 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:44:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:44:20,325 INFO L82 PathProgramCache]: Analyzing trace with hash 898563457, now seen corresponding path program 1 times [2019-09-09 06:44:20,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:44:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:20,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:44:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:20,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:44:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:44:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 06:44:21,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:44:21,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 06:44:21,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:44:21,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 06:44:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 06:44:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 06:44:21,037 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 4 states. [2019-09-09 06:44:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:44:22,458 INFO L93 Difference]: Finished difference Result 540 states and 875 transitions. [2019-09-09 06:44:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 06:44:22,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-09 06:44:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:44:22,497 INFO L225 Difference]: With dead ends: 540 [2019-09-09 06:44:22,497 INFO L226 Difference]: Without dead ends: 468 [2019-09-09 06:44:22,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 06:44:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-09-09 06:44:22,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 466. [2019-09-09 06:44:22,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-09-09 06:44:22,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 697 transitions. [2019-09-09 06:44:22,577 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 697 transitions. Word has length 141 [2019-09-09 06:44:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:44:22,578 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 697 transitions. [2019-09-09 06:44:22,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 06:44:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2019-09-09 06:44:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-09 06:44:22,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:44:22,585 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:44:22,586 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:44:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:44:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1506798472, now seen corresponding path program 1 times [2019-09-09 06:44:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:44:22,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:22,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:44:22,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:22,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:44:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:44:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 06:44:22,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:44:22,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 06:44:22,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:44:22,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 06:44:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 06:44:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 06:44:22,739 INFO L87 Difference]: Start difference. First operand 466 states and 697 transitions. Second operand 6 states. [2019-09-09 06:44:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:44:23,546 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2019-09-09 06:44:23,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 06:44:23,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-09 06:44:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:44:23,553 INFO L225 Difference]: With dead ends: 635 [2019-09-09 06:44:23,553 INFO L226 Difference]: Without dead ends: 635 [2019-09-09 06:44:23,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:44:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-09 06:44:23,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 619. [2019-09-09 06:44:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-09 06:44:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 890 transitions. [2019-09-09 06:44:23,607 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 890 transitions. Word has length 162 [2019-09-09 06:44:23,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:44:23,607 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 890 transitions. [2019-09-09 06:44:23,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 06:44:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 890 transitions. [2019-09-09 06:44:23,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-09 06:44:23,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:44:23,612 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:44:23,612 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:44:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:44:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1395637775, now seen corresponding path program 1 times [2019-09-09 06:44:23,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:44:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:44:23,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:23,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:44:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:44:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 06:44:23,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:44:23,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 06:44:23,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:44:23,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 06:44:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 06:44:23,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 06:44:23,881 INFO L87 Difference]: Start difference. First operand 619 states and 890 transitions. Second operand 5 states. [2019-09-09 06:44:24,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:44:24,630 INFO L93 Difference]: Finished difference Result 705 states and 978 transitions. [2019-09-09 06:44:24,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 06:44:24,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-09-09 06:44:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:44:24,636 INFO L225 Difference]: With dead ends: 705 [2019-09-09 06:44:24,636 INFO L226 Difference]: Without dead ends: 619 [2019-09-09 06:44:24,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 06:44:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-09-09 06:44:24,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-09-09 06:44:24,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-09 06:44:24,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 874 transitions. [2019-09-09 06:44:24,659 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 874 transitions. Word has length 167 [2019-09-09 06:44:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:44:24,659 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 874 transitions. [2019-09-09 06:44:24,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 06:44:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 874 transitions. [2019-09-09 06:44:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-09 06:44:24,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:44:24,665 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:44:24,665 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:44:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:44:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1724390544, now seen corresponding path program 1 times [2019-09-09 06:44:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:44:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:24,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:44:24,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:24,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:44:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:44:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 06:44:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 06:44:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 06:44:24,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:44:24,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 06:44:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 06:44:24,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 06:44:24,794 INFO L87 Difference]: Start difference. First operand 619 states and 874 transitions. Second operand 6 states. [2019-09-09 06:44:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 06:44:25,603 INFO L93 Difference]: Finished difference Result 1103 states and 1608 transitions. [2019-09-09 06:44:25,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 06:44:25,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-09 06:44:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 06:44:25,611 INFO L225 Difference]: With dead ends: 1103 [2019-09-09 06:44:25,612 INFO L226 Difference]: Without dead ends: 1103 [2019-09-09 06:44:25,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 06:44:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-09 06:44:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1078. [2019-09-09 06:44:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-09-09 06:44:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1528 transitions. [2019-09-09 06:44:25,675 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1528 transitions. Word has length 195 [2019-09-09 06:44:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 06:44:25,675 INFO L475 AbstractCegarLoop]: Abstraction has 1078 states and 1528 transitions. [2019-09-09 06:44:25,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 06:44:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1528 transitions. [2019-09-09 06:44:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-09 06:44:25,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 06:44:25,682 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 06:44:25,682 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 06:44:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:44:25,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2135000910, now seen corresponding path program 1 times [2019-09-09 06:44:25,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 06:44:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 06:44:25,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 06:44:25,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 06:44:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 06:44:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-09 06:44:25,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 06:44:25,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 06:44:25,824 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-09-09 06:44:25,827 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [207], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [807], [809], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-09-09 06:44:25,883 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 06:44:25,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 06:46:21,906 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 06:46:21,908 INFO L272 AbstractInterpreter]: Visited 141 different actions 141 times. Never merged. Never widened. Performed 206 root evaluator evaluations with a maximum evaluation depth of 18. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Never found a fixpoint. Largest state had 38 variables. [2019-09-09 06:46:21,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 06:46:21,912 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 06:48:26,424 INFO L227 lantSequenceWeakener]: Weakened 187 states. On average, predicates are now at 81.15% of their original sizes. [2019-09-09 06:48:26,425 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 06:48:26,507 INFO L420 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2019-09-09 06:48:26,507 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 06:48:26,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 06:48:26,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2019-09-09 06:48:26,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 06:48:26,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 06:48:26,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 06:48:26,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-09-09 06:48:26,510 INFO L87 Difference]: Start difference. First operand 1078 states and 1528 transitions. Second operand 10 states. [2019-09-09 06:48:43,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 06:48:43,289 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~a25~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-09 06:48:43,296 INFO L168 Benchmark]: Toolchain (without parser) took 265208.46 ms. Allocated memory was 133.7 MB in the beginning and 384.3 MB in the end (delta: 250.6 MB). Free memory was 88.3 MB in the beginning and 242.0 MB in the end (delta: -153.7 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. [2019-09-09 06:48:43,297 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-09 06:48:43,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 721.74 ms. Allocated memory was 133.7 MB in the beginning and 202.9 MB in the end (delta: 69.2 MB). Free memory was 87.9 MB in the beginning and 168.3 MB in the end (delta: -80.4 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. [2019-09-09 06:48:43,299 INFO L168 Benchmark]: Boogie Preprocessor took 136.14 ms. Allocated memory is still 202.9 MB. Free memory was 168.3 MB in the beginning and 163.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2019-09-09 06:48:43,300 INFO L168 Benchmark]: RCFGBuilder took 1240.60 ms. Allocated memory was 202.9 MB in the beginning and 228.6 MB in the end (delta: 25.7 MB). Free memory was 163.5 MB in the beginning and 182.7 MB in the end (delta: -19.2 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. [2019-09-09 06:48:43,301 INFO L168 Benchmark]: TraceAbstraction took 263105.47 ms. Allocated memory was 228.6 MB in the beginning and 384.3 MB in the end (delta: 155.7 MB). Free memory was 182.7 MB in the beginning and 242.0 MB in the end (delta: -59.3 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2019-09-09 06:48:43,307 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 721.74 ms. Allocated memory was 133.7 MB in the beginning and 202.9 MB in the end (delta: 69.2 MB). Free memory was 87.9 MB in the beginning and 168.3 MB in the end (delta: -80.4 MB). Peak memory consumption was 38.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 136.14 ms. Allocated memory is still 202.9 MB. Free memory was 168.3 MB in the beginning and 163.5 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1240.60 ms. Allocated memory was 202.9 MB in the beginning and 228.6 MB in the end (delta: 25.7 MB). Free memory was 163.5 MB in the beginning and 182.7 MB in the end (delta: -19.2 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263105.47 ms. Allocated memory was 228.6 MB in the beginning and 384.3 MB in the end (delta: 155.7 MB). Free memory was 182.7 MB in the beginning and 242.0 MB in the end (delta: -59.3 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~a25~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~a25~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...