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_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:37:32,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:37:32,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:37:32,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:37:32,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:37:32,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:37:32,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:37:32,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:37:32,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:37:32,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:37:32,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:37:32,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:37:32,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:37:32,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:37:32,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:37:32,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:37:32,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:37:32,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:37:32,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:37:32,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:37:32,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:37:32,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:37:32,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:37:32,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:37:32,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:37:32,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:37:32,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:37:32,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:37:32,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:37:32,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:37:32,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:37:32,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:37:32,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:37:32,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:37:32,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:37:32,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:37:32,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:37:32,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:37:32,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:37:32,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:37:32,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:37:32,494 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-10-02 17:37:32,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:37:32,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:37:32,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:37:32,518 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:37:32,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:37:32,519 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:37:32,519 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:37:32,519 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:37:32,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:37:32,520 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:37:32,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:37:32,521 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:37:32,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:37:32,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:37:32,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:37:32,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:37:32,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:37:32,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:37:32,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:37:32,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:37:32,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:37:32,524 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:37:32,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:37:32,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:37:32,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:37:32,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:37:32,525 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:37:32,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:37:32,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:37:32,526 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:37:32,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:37:32,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:37:32,601 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:37:32,603 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:37:32,603 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:37:32,604 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label47.c [2019-10-02 17:37:32,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca04300f5/9f8bf4616ab246ff93add9ed2c341dbe/FLAGbe1f68624 [2019-10-02 17:37:33,184 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:37:33,187 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label47.c [2019-10-02 17:37:33,206 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca04300f5/9f8bf4616ab246ff93add9ed2c341dbe/FLAGbe1f68624 [2019-10-02 17:37:33,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca04300f5/9f8bf4616ab246ff93add9ed2c341dbe [2019-10-02 17:37:33,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:37:33,510 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:37:33,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:37:33,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:37:33,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:37:33,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:37:33" (1/1) ... [2019-10-02 17:37:33,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b57f279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:33, skipping insertion in model container [2019-10-02 17:37:33,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:37:33" (1/1) ... [2019-10-02 17:37:33,527 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:37:33,576 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:37:34,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:37:34,059 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:37:34,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:37:34,185 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:37:34,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34 WrapperNode [2019-10-02 17:37:34,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:37:34,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:37:34,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:37:34,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:37:34,204 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (1/1) ... [2019-10-02 17:37:34,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:37:34,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:37:34,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:37:34,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:37:34,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (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-10-02 17:37:34,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:37:34,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:37:34,351 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:37:34,351 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:37:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:37:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:37:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:37:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:37:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:37:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:37:34,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:37:35,456 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:37:35,456 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:37:35,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:37:35 BoogieIcfgContainer [2019-10-02 17:37:35,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:37:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:37:35,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:37:35,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:37:35,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:37:33" (1/3) ... [2019-10-02 17:37:35,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f58f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:37:35, skipping insertion in model container [2019-10-02 17:37:35,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:37:34" (2/3) ... [2019-10-02 17:37:35,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f58f36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:37:35, skipping insertion in model container [2019-10-02 17:37:35,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:37:35" (3/3) ... [2019-10-02 17:37:35,466 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label47.c [2019-10-02 17:37:35,477 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:37:35,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:37:35,504 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:37:35,540 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:37:35,540 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:37:35,540 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:37:35,541 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:37:35,542 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:37:35,542 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:37:35,542 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:37:35,543 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:37:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:37:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-02 17:37:35,603 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:35,604 INFO L411 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] [2019-10-02 17:37:35,607 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash -681714095, now seen corresponding path program 1 times [2019-10-02 17:37:35,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:35,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:35,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:35,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:36,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:37:36,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:37:36,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:36,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:37:36,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:37:36,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:37:36,216 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:37:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:37:37,144 INFO L93 Difference]: Finished difference Result 394 states and 575 transitions. [2019-10-02 17:37:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:37:37,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-10-02 17:37:37,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:37:37,178 INFO L225 Difference]: With dead ends: 394 [2019-10-02 17:37:37,178 INFO L226 Difference]: Without dead ends: 326 [2019-10-02 17:37:37,182 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:37:37,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-02 17:37:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 321. [2019-10-02 17:37:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-02 17:37:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 467 transitions. [2019-10-02 17:37:37,268 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 467 transitions. Word has length 113 [2019-10-02 17:37:37,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:37:37,269 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 467 transitions. [2019-10-02 17:37:37,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:37:37,269 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 467 transitions. [2019-10-02 17:37:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-02 17:37:37,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:37,273 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:37:37,274 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1310105962, now seen corresponding path program 1 times [2019-10-02 17:37:37,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:37,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:37,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:37,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:37,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:37,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:37:37,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:37:37,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:37,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:37:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:37:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:37:37,617 INFO L87 Difference]: Start difference. First operand 321 states and 467 transitions. Second operand 5 states. [2019-10-02 17:37:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:37:38,347 INFO L93 Difference]: Finished difference Result 408 states and 554 transitions. [2019-10-02 17:37:38,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:37:38,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-02 17:37:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:37:38,351 INFO L225 Difference]: With dead ends: 408 [2019-10-02 17:37:38,351 INFO L226 Difference]: Without dead ends: 321 [2019-10-02 17:37:38,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-02 17:37:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-02 17:37:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2019-10-02 17:37:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-10-02 17:37:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 463 transitions. [2019-10-02 17:37:38,370 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 463 transitions. Word has length 121 [2019-10-02 17:37:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:37:38,371 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 463 transitions. [2019-10-02 17:37:38,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:37:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 463 transitions. [2019-10-02 17:37:38,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 17:37:38,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:38,375 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:37:38,376 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:38,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:38,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2076461862, now seen corresponding path program 1 times [2019-10-02 17:37:38,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:38,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:38,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:38,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:38,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:37:38,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:37:38,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:38,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:37:38,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:37:38,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:37:38,514 INFO L87 Difference]: Start difference. First operand 321 states and 463 transitions. Second operand 6 states. [2019-10-02 17:37:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:37:39,370 INFO L93 Difference]: Finished difference Result 664 states and 985 transitions. [2019-10-02 17:37:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 17:37:39,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 17:37:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:37:39,377 INFO L225 Difference]: With dead ends: 664 [2019-10-02 17:37:39,377 INFO L226 Difference]: Without dead ends: 664 [2019-10-02 17:37:39,378 INFO L640 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-10-02 17:37:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2019-10-02 17:37:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 632. [2019-10-02 17:37:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 17:37:39,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 894 transitions. [2019-10-02 17:37:39,416 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 894 transitions. Word has length 123 [2019-10-02 17:37:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:37:39,416 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 894 transitions. [2019-10-02 17:37:39,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:37:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 894 transitions. [2019-10-02 17:37:39,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 17:37:39,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:39,422 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:37:39,422 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:39,423 INFO L82 PathProgramCache]: Analyzing trace with hash 313178237, now seen corresponding path program 1 times [2019-10-02 17:37:39,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:39,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:39,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:39,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:37:39,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:37:39,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:39,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:37:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:37:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:37:39,716 INFO L87 Difference]: Start difference. First operand 632 states and 894 transitions. Second operand 5 states. [2019-10-02 17:37:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:37:40,347 INFO L93 Difference]: Finished difference Result 716 states and 980 transitions. [2019-10-02 17:37:40,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:37:40,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-10-02 17:37:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:37:40,352 INFO L225 Difference]: With dead ends: 716 [2019-10-02 17:37:40,352 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 17:37:40,353 INFO L640 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-10-02 17:37:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 17:37:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 17:37:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 17:37:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 882 transitions. [2019-10-02 17:37:40,372 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 882 transitions. Word has length 137 [2019-10-02 17:37:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:37:40,373 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 882 transitions. [2019-10-02 17:37:40,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:37:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 882 transitions. [2019-10-02 17:37:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 17:37:40,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:40,376 INFO L411 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] [2019-10-02 17:37:40,376 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 206908097, now seen corresponding path program 1 times [2019-10-02 17:37:40,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:40,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:40,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:40,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:37:40,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:37:40,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:37:40,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:37:40,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:37:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:37:40,607 INFO L87 Difference]: Start difference. First operand 632 states and 882 transitions. Second operand 5 states. [2019-10-02 17:37:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:37:41,272 INFO L93 Difference]: Finished difference Result 718 states and 968 transitions. [2019-10-02 17:37:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:37:41,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-02 17:37:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:37:41,275 INFO L225 Difference]: With dead ends: 718 [2019-10-02 17:37:41,275 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 17:37:41,276 INFO L640 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-10-02 17:37:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 17:37:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 630. [2019-10-02 17:37:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 17:37:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 861 transitions. [2019-10-02 17:37:41,292 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 861 transitions. Word has length 139 [2019-10-02 17:37:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:37:41,293 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 861 transitions. [2019-10-02 17:37:41,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:37:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 861 transitions. [2019-10-02 17:37:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 17:37:41,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:37:41,296 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 17:37:41,296 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:37:41,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:37:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash -441378269, now seen corresponding path program 1 times [2019-10-02 17:37:41,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:37:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:41,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:37:41,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:37:41,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:37:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:37:41,371 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 36 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:37:41,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:37:41,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:37:41,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 147 with the following transitions: [2019-10-02 17:37:41,375 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [45], [50], [52], [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], [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], [583], [585], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:37:41,423 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:37:41,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:44:25,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:44:25,389 INFO L272 AbstractInterpreter]: Visited 117 different actions 228 times. Merged at 4 different actions 4 times. Never widened. Performed 484 root evaluator evaluations with a maximum evaluation depth of 18. Performed 484 inverse root evaluator evaluations with a maximum inverse evaluation depth of 18. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2019-10-02 17:44:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:44:25,393 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:48:15,117 INFO L227 lantSequenceWeakener]: Weakened 141 states. On average, predicates are now at 80.83% of their original sizes. [2019-10-02 17:48:15,118 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:48:15,295 INFO L420 sIntCurrentIteration]: We unified 145 AI predicates to 145 [2019-10-02 17:48:15,295 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:48:15,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:48:15,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-10-02 17:48:15,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:48:15,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 17:48:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 17:48:15,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-10-02 17:48:15,298 INFO L87 Difference]: Start difference. First operand 630 states and 861 transitions. Second operand 16 states. [2019-10-02 17:48:38,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:48:38,731 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:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) 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-10-02 17:48:38,737 INFO L168 Benchmark]: Toolchain (without parser) took 665226.04 ms. Allocated memory was 142.6 MB in the beginning and 308.3 MB in the end (delta: 165.7 MB). Free memory was 88.3 MB in the beginning and 119.6 MB in the end (delta: -31.3 MB). Peak memory consumption was 134.3 MB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,738 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 142.6 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.57 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 88.1 MB in the beginning and 159.0 MB in the end (delta: -70.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,740 INFO L168 Benchmark]: Boogie Preprocessor took 103.83 ms. Allocated memory is still 200.3 MB. Free memory was 159.0 MB in the beginning and 154.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,741 INFO L168 Benchmark]: RCFGBuilder took 1164.89 ms. Allocated memory was 200.3 MB in the beginning and 230.7 MB in the end (delta: 30.4 MB). Free memory was 154.3 MB in the beginning and 168.7 MB in the end (delta: -14.4 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,742 INFO L168 Benchmark]: TraceAbstraction took 663275.37 ms. Allocated memory was 230.7 MB in the beginning and 308.3 MB in the end (delta: 77.6 MB). Free memory was 168.7 MB in the beginning and 119.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 126.7 MB. Max. memory is 7.1 GB. [2019-10-02 17:48:38,747 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.23 ms. Allocated memory is still 142.6 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 677.57 ms. Allocated memory was 142.6 MB in the beginning and 200.3 MB in the end (delta: 57.7 MB). Free memory was 88.1 MB in the beginning and 159.0 MB in the end (delta: -70.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.83 ms. Allocated memory is still 200.3 MB. Free memory was 159.0 MB in the beginning and 154.3 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1164.89 ms. Allocated memory was 200.3 MB in the beginning and 230.7 MB in the end (delta: 30.4 MB). Free memory was 154.3 MB in the beginning and 168.7 MB in the end (delta: -14.4 MB). Peak memory consumption was 78.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 663275.37 ms. Allocated memory was 230.7 MB in the beginning and 308.3 MB in the end (delta: 77.6 MB). Free memory was 168.7 MB in the beginning and 119.6 MB in the end (delta: 49.1 MB). Peak memory consumption was 126.7 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...