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_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 17:38:11,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 17:38:11,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 17:38:11,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 17:38:11,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 17:38:11,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 17:38:11,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 17:38:11,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 17:38:11,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 17:38:11,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 17:38:11,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 17:38:11,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 17:38:11,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 17:38:11,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 17:38:11,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 17:38:11,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 17:38:11,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 17:38:11,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 17:38:11,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 17:38:11,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 17:38:11,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 17:38:11,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 17:38:11,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 17:38:11,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 17:38:11,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 17:38:11,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 17:38:11,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 17:38:11,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 17:38:11,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 17:38:11,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 17:38:11,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 17:38:11,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 17:38:11,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 17:38:11,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 17:38:11,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 17:38:11,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 17:38:11,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 17:38:11,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 17:38:11,535 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 17:38:11,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 17:38:11,536 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 17:38:11,537 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:38:11,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 17:38:11,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 17:38:11,552 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 17:38:11,553 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 17:38:11,553 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 17:38:11,554 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 17:38:11,554 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 17:38:11,554 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 17:38:11,554 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 17:38:11,554 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 17:38:11,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 17:38:11,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 17:38:11,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 17:38:11,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 17:38:11,556 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 17:38:11,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 17:38:11,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 17:38:11,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 17:38:11,557 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 17:38:11,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 17:38:11,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 17:38:11,557 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 17:38:11,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 17:38:11,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 17:38:11,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 17:38:11,558 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 17:38:11,558 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 17:38:11,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 17:38:11,559 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 17:38:11,559 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 17:38:11,587 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 17:38:11,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 17:38:11,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 17:38:11,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 17:38:11,605 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 17:38:11,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-02 17:38:11,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac390cf5/594e129f862c4e889366187a60a3b18a/FLAG6aa57aaa3 [2019-10-02 17:38:12,162 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 17:38:12,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label49.c [2019-10-02 17:38:12,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac390cf5/594e129f862c4e889366187a60a3b18a/FLAG6aa57aaa3 [2019-10-02 17:38:12,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dac390cf5/594e129f862c4e889366187a60a3b18a [2019-10-02 17:38:12,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 17:38:12,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 17:38:12,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 17:38:12,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 17:38:12,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 17:38:12,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc689a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:12, skipping insertion in model container [2019-10-02 17:38:12,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 05:38:12" (1/1) ... [2019-10-02 17:38:12,452 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 17:38:12,508 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 17:38:13,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:38:13,050 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 17:38:13,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 17:38:13,178 INFO L192 MainTranslator]: Completed translation [2019-10-02 17:38:13,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13 WrapperNode [2019-10-02 17:38:13,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 17:38:13,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 17:38:13,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 17:38:13,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 17:38:13,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (1/1) ... [2019-10-02 17:38:13,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (1/1) ... [2019-10-02 17:38:13,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:38:13" (1/1) ... [2019-10-02 17:38:13,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:38:13" (1/1) ... [2019-10-02 17:38:13,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (1/1) ... [2019-10-02 17:38:13,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (1/1) ... [2019-10-02 17:38:13,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (1/1) ... [2019-10-02 17:38:13,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 17:38:13,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 17:38:13,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 17:38:13,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 17:38:13,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (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:38:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 17:38:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 17:38:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 17:38:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 17:38:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 17:38:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 17:38:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 17:38:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 17:38:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 17:38:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 17:38:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 17:38:14,598 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 17:38:14,599 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 17:38:14,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:38:14 BoogieIcfgContainer [2019-10-02 17:38:14,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 17:38:14,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 17:38:14,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 17:38:14,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 17:38:14,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 05:38:12" (1/3) ... [2019-10-02 17:38:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2cea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:38:14, skipping insertion in model container [2019-10-02 17:38:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 05:38:13" (2/3) ... [2019-10-02 17:38:14,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2cea46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 05:38:14, skipping insertion in model container [2019-10-02 17:38:14,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 05:38:14" (3/3) ... [2019-10-02 17:38:14,611 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label49.c [2019-10-02 17:38:14,622 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 17:38:14,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 17:38:14,649 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 17:38:14,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 17:38:14,690 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 17:38:14,691 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 17:38:14,691 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 17:38:14,691 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 17:38:14,692 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 17:38:14,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 17:38:14,692 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 17:38:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 17:38:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 17:38:14,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:14,757 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:14,760 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 2010725689, now seen corresponding path program 1 times [2019-10-02 17:38:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:14,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:14,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:14,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:15,327 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:38:15,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:15,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 17:38:15,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:15,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 17:38:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 17:38:15,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 17:38:15,356 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 17:38:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:16,363 INFO L93 Difference]: Finished difference Result 388 states and 554 transitions. [2019-10-02 17:38:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 17:38:16,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-02 17:38:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:16,382 INFO L225 Difference]: With dead ends: 388 [2019-10-02 17:38:16,382 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:16,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:38:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 17:38:16,487 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 131 [2019-10-02 17:38:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:16,487 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 17:38:16,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 17:38:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 17:38:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 17:38:16,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:16,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:16,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2056186306, now seen corresponding path program 1 times [2019-10-02 17:38:16,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:16,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:16,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:16,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:16,785 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:38:16,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:16,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:16,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:16,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:16,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:16,789 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 17:38:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:17,534 INFO L93 Difference]: Finished difference Result 407 states and 552 transitions. [2019-10-02 17:38:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:17,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-02 17:38:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:17,541 INFO L225 Difference]: With dead ends: 407 [2019-10-02 17:38:17,541 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:17,542 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:38:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 17:38:17,560 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 139 [2019-10-02 17:38:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:17,560 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 17:38:17,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 17:38:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 17:38:17,563 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:17,563 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:38:17,563 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:17,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1041677834, now seen corresponding path program 1 times [2019-10-02 17:38:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:17,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:17,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:17,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:17,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:17,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:17,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:17,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:17,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:17,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:17,871 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 17:38:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:18,601 INFO L93 Difference]: Finished difference Result 403 states and 544 transitions. [2019-10-02 17:38:18,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:18,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-02 17:38:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:18,606 INFO L225 Difference]: With dead ends: 403 [2019-10-02 17:38:18,606 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 17:38:18,606 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:38:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 17:38:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 17:38:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 17:38:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 17:38:18,620 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 145 [2019-10-02 17:38:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:18,620 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 17:38:18,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 17:38:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 17:38:18,623 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:18,623 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 17:38:18,623 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -33342687, now seen corresponding path program 1 times [2019-10-02 17:38:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:18,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:18,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:18,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:18,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:18,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:38:18,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:18,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:38:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:38:18,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:38:18,716 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 17:38:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:19,514 INFO L93 Difference]: Finished difference Result 637 states and 893 transitions. [2019-10-02 17:38:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:38:19,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-10-02 17:38:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:19,519 INFO L225 Difference]: With dead ends: 637 [2019-10-02 17:38:19,519 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 17:38:19,519 INFO L640 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-10-02 17:38:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 17:38:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 17:38:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 17:38:19,544 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 153 [2019-10-02 17:38:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:19,544 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 17:38:19,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:38:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 17:38:19,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 17:38:19,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:19,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:19,549 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1756128357, now seen corresponding path program 1 times [2019-10-02 17:38:19,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:19,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:19,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:19,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:19,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:19,747 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:38:19,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:19,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:19,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:19,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:19,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:19,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:19,749 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 17:38:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:20,467 INFO L93 Difference]: Finished difference Result 710 states and 956 transitions. [2019-10-02 17:38:20,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:20,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-02 17:38:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:20,471 INFO L225 Difference]: With dead ends: 710 [2019-10-02 17:38:20,472 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:38:20,472 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:38:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:38:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:38:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 17:38:20,491 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 155 [2019-10-02 17:38:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:20,491 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 17:38:20,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 17:38:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 17:38:20,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:20,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 17:38:20,495 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:20,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1935651415, now seen corresponding path program 1 times [2019-10-02 17:38:20,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:20,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:20,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:20,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:20,714 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:38:20,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:20,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 17:38:20,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:20,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 17:38:20,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 17:38:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 17:38:20,716 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 17:38:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:21,550 INFO L93 Difference]: Finished difference Result 712 states and 946 transitions. [2019-10-02 17:38:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 17:38:21,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-02 17:38:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:21,554 INFO L225 Difference]: With dead ends: 712 [2019-10-02 17:38:21,554 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 17:38:21,554 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:38:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 17:38:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 17:38:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 17:38:21,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 17:38:21,572 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 157 [2019-10-02 17:38:21,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:21,572 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 17:38:21,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 17:38:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 17:38:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 17:38:21,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:21,576 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, 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] [2019-10-02 17:38:21,576 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:21,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1918345167, now seen corresponding path program 1 times [2019-10-02 17:38:21,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:21,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:21,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:21,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:21,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 17:38:21,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 17:38:21,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:38:21,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 17:38:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 17:38:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 17:38:21,676 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 17:38:22,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 17:38:22,560 INFO L93 Difference]: Finished difference Result 1238 states and 1702 transitions. [2019-10-02 17:38:22,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 17:38:22,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 17:38:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 17:38:22,575 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 17:38:22,576 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 17:38:22,576 INFO L640 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-10-02 17:38:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 17:38:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 17:38:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 17:38:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 17:38:22,653 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 161 [2019-10-02 17:38:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 17:38:22,653 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 17:38:22,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 17:38:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 17:38:22,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 17:38:22,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 17:38:22,664 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:38:22,665 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 17:38:22,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:38:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 264500657, now seen corresponding path program 1 times [2019-10-02 17:38:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 17:38:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:22,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 17:38:22,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 17:38:22,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 17:38:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 17:38:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 17:38:22,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 17:38:22,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 17:38:22,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 196 with the following transitions: [2019-10-02 17:38:22,817 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], [107], [108], [112], [116], [120], [123], [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], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [727], [729], [863], [867], [876], [880], [882], [887], [888], [889], [891], [892] [2019-10-02 17:38:22,902 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 17:38:22,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 17:45:00,041 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 17:45:00,044 INFO L272 AbstractInterpreter]: Visited 135 different actions 264 times. Merged at 4 different actions 4 times. Never widened. Performed 538 root evaluator evaluations with a maximum evaluation depth of 18. Performed 538 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:45:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 17:45:00,049 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 17:50:16,585 INFO L227 lantSequenceWeakener]: Weakened 192 states. On average, predicates are now at 81.02% of their original sizes. [2019-10-02 17:50:16,585 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 17:50:16,778 INFO L420 sIntCurrentIteration]: We unified 194 AI predicates to 194 [2019-10-02 17:50:16,778 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 17:50:16,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 17:50:16,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [6] total 20 [2019-10-02 17:50:16,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 17:50:16,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 17:50:16,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 17:50:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-10-02 17:50:16,781 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 16 states. [2019-10-02 17:50:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 17:50:34,082 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:50:34,090 INFO L168 Benchmark]: Toolchain (without parser) took 741652.89 ms. Allocated memory was 136.8 MB in the beginning and 328.2 MB in the end (delta: 191.4 MB). Free memory was 82.6 MB in the beginning and 249.8 MB in the end (delta: -167.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:50:34,091 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.6 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:50:34,092 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.02 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 82.4 MB in the beginning and 167.2 MB in the end (delta: -84.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:50:34,093 INFO L168 Benchmark]: Boogie Preprocessor took 116.27 ms. Allocated memory is still 201.9 MB. Free memory was 167.2 MB in the beginning and 162.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-02 17:50:34,094 INFO L168 Benchmark]: RCFGBuilder took 1306.15 ms. Allocated memory was 201.9 MB in the beginning and 220.2 MB in the end (delta: 18.4 MB). Free memory was 162.3 MB in the beginning and 177.9 MB in the end (delta: -15.6 MB). Peak memory consumption was 97.2 MB. Max. memory is 7.1 GB. [2019-10-02 17:50:34,095 INFO L168 Benchmark]: TraceAbstraction took 739483.44 ms. Allocated memory was 220.2 MB in the beginning and 328.2 MB in the end (delta: 108.0 MB). Free memory was 177.9 MB in the beginning and 249.8 MB in the end (delta: -71.9 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-10-02 17:50:34,099 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 102.9 MB in the beginning and 102.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.02 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 82.4 MB in the beginning and 167.2 MB in the end (delta: -84.8 MB). Peak memory consumption was 31.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.27 ms. Allocated memory is still 201.9 MB. Free memory was 167.2 MB in the beginning and 162.3 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1306.15 ms. Allocated memory was 201.9 MB in the beginning and 220.2 MB in the end (delta: 18.4 MB). Free memory was 162.3 MB in the beginning and 177.9 MB in the end (delta: -15.6 MB). Peak memory consumption was 97.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 739483.44 ms. Allocated memory was 220.2 MB in the beginning and 328.2 MB in the end (delta: 108.0 MB). Free memory was 177.9 MB in the beginning and 249.8 MB in the end (delta: -71.9 MB). Peak memory consumption was 36.1 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...