/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label44.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:27,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:27,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:27,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:27,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:27,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:27,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:27,210 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:27,214 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:27,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:27,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:27,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:27,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:27,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:27,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:27,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:27,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:27,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:27,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:27,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:27,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:27,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:27,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:27,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:27,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:27,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:27,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:27,253 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:27,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:27,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:27,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:27,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:27,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:27,258 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:27,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:27,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:27,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:27,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:27,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:27,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:27,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:27,263 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:51:27,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:27,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:27,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:27,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:27,302 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:27,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:27,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:27,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:27,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:27,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:27,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:27,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:27,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:27,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:27,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:27,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:27,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:27,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:27,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:27,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:27,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:27,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:27,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:27,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:27,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:27,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:27,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:27,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:27,313 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:51:27,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:27,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:27,622 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:27,624 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:27,624 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:27,625 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label44.c [2019-11-06 22:51:27,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf630b6c/a1bd5708c5db45f2a567339f8b1e30b1/FLAGd1983ca1b [2019-11-06 22:51:28,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:28,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label44.c [2019-11-06 22:51:28,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf630b6c/a1bd5708c5db45f2a567339f8b1e30b1/FLAGd1983ca1b [2019-11-06 22:51:28,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf630b6c/a1bd5708c5db45f2a567339f8b1e30b1 [2019-11-06 22:51:28,551 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:28,553 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:28,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:28,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:28,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:28,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:28" (1/1) ... [2019-11-06 22:51:28,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d002de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:28, skipping insertion in model container [2019-11-06 22:51:28,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:28" (1/1) ... [2019-11-06 22:51:28,570 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:28,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:51:29,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:29,232 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:51:29,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:29,479 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:51:29,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29 WrapperNode [2019-11-06 22:51:29,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:29,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:51:29,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:51:29,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:51:29,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (1/1) ... [2019-11-06 22:51:29,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:51:29,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:51:29,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:51:29,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:51:29,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (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-11-06 22:51:29,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:51:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:51:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:51:29,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:51:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:51:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:51:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:51:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:51:29,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:51:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:51:29,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:31,439 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:31,439 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:31,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:31 BoogieIcfgContainer [2019-11-06 22:51:31,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:31,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:31,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:31,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:31,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:28" (1/3) ... [2019-11-06 22:51:31,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1935823f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:31, skipping insertion in model container [2019-11-06 22:51:31,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:29" (2/3) ... [2019-11-06 22:51:31,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1935823f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:31, skipping insertion in model container [2019-11-06 22:51:31,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:31" (3/3) ... [2019-11-06 22:51:31,458 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label44.c [2019-11-06 22:51:31,472 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:31,481 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:31,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:31,531 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:31,531 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:31,531 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:31,531 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:31,532 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:31,532 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:31,532 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:31,532 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 22:51:31,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:31,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:31,566 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash -989093190, now seen corresponding path program 1 times [2019-11-06 22:51:31,582 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:31,582 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779632321] [2019-11-06 22:51:31,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:31,825 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779632321] [2019-11-06 22:51:31,826 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:31,826 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:31,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864240627] [2019-11-06 22:51:31,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:31,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:31,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:31,854 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-11-06 22:51:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:33,828 INFO L93 Difference]: Finished difference Result 890 states and 1606 transitions. [2019-11-06 22:51:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:33,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-06 22:51:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:33,851 INFO L225 Difference]: With dead ends: 890 [2019-11-06 22:51:33,851 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:51:33,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:51:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-11-06 22:51:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:51:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-11-06 22:51:33,950 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 17 [2019-11-06 22:51:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:33,950 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-11-06 22:51:33,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-11-06 22:51:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-06 22:51:33,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:33,958 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:51:33,958 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:33,960 INFO L82 PathProgramCache]: Analyzing trace with hash 649942285, now seen corresponding path program 1 times [2019-11-06 22:51:33,960 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:33,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812645095] [2019-11-06 22:51:33,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:34,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812645095] [2019-11-06 22:51:34,233 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:34,233 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:34,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872877830] [2019-11-06 22:51:34,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:34,240 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:34,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:34,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:34,241 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 4 states. [2019-11-06 22:51:35,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:35,891 INFO L93 Difference]: Finished difference Result 1466 states and 2091 transitions. [2019-11-06 22:51:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:35,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-06 22:51:35,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:35,899 INFO L225 Difference]: With dead ends: 1466 [2019-11-06 22:51:35,900 INFO L226 Difference]: Without dead ends: 736 [2019-11-06 22:51:35,902 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-06 22:51:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 554. [2019-11-06 22:51:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-06 22:51:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 809 transitions. [2019-11-06 22:51:35,937 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 809 transitions. Word has length 100 [2019-11-06 22:51:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:35,938 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 809 transitions. [2019-11-06 22:51:35,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 809 transitions. [2019-11-06 22:51:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-06 22:51:35,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:35,943 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:51:35,943 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2036174565, now seen corresponding path program 1 times [2019-11-06 22:51:35,944 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:35,944 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379841961] [2019-11-06 22:51:35,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:36,347 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379841961] [2019-11-06 22:51:36,347 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:36,347 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:51:36,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035142901] [2019-11-06 22:51:36,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:51:36,348 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:51:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:51:36,349 INFO L87 Difference]: Start difference. First operand 554 states and 809 transitions. Second operand 7 states. [2019-11-06 22:51:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:37,819 INFO L93 Difference]: Finished difference Result 1328 states and 1948 transitions. [2019-11-06 22:51:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:51:37,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-11-06 22:51:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:37,828 INFO L225 Difference]: With dead ends: 1328 [2019-11-06 22:51:37,828 INFO L226 Difference]: Without dead ends: 780 [2019-11-06 22:51:37,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:51:37,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2019-11-06 22:51:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 750. [2019-11-06 22:51:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2019-11-06 22:51:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1044 transitions. [2019-11-06 22:51:37,882 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1044 transitions. Word has length 112 [2019-11-06 22:51:37,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:37,891 INFO L462 AbstractCegarLoop]: Abstraction has 750 states and 1044 transitions. [2019-11-06 22:51:37,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:51:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1044 transitions. [2019-11-06 22:51:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-06 22:51:37,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:37,911 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:51:37,911 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:37,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1918057, now seen corresponding path program 1 times [2019-11-06 22:51:37,912 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:37,912 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838814269] [2019-11-06 22:51:37,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:38,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838814269] [2019-11-06 22:51:38,107 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687883260] [2019-11-06 22:51:38,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:38,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 22:51:38,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-06 22:51:38,325 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:38,469 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:38,469 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-11-06 22:51:38,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973461258] [2019-11-06 22:51:38,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:38,471 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:51:38,471 INFO L87 Difference]: Start difference. First operand 750 states and 1044 transitions. Second operand 5 states. [2019-11-06 22:51:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:39,653 INFO L93 Difference]: Finished difference Result 1888 states and 2684 transitions. [2019-11-06 22:51:39,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:39,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2019-11-06 22:51:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:39,661 INFO L225 Difference]: With dead ends: 1888 [2019-11-06 22:51:39,661 INFO L226 Difference]: Without dead ends: 1144 [2019-11-06 22:51:39,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 358 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:51:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-11-06 22:51:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1124. [2019-11-06 22:51:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-06 22:51:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1464 transitions. [2019-11-06 22:51:39,701 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1464 transitions. Word has length 182 [2019-11-06 22:51:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:39,701 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1464 transitions. [2019-11-06 22:51:39,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1464 transitions. [2019-11-06 22:51:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-06 22:51:39,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:39,705 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:51:39,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:39,910 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1202443494, now seen corresponding path program 1 times [2019-11-06 22:51:39,911 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:39,911 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204890964] [2019-11-06 22:51:39,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:40,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204890964] [2019-11-06 22:51:40,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126117740] [2019-11-06 22:51:40,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:40,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:51:40,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:40,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-06 22:51:41,020 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:41,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 20 proven. 69 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:41,345 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:41,346 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 5] total 16 [2019-11-06 22:51:41,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577928638] [2019-11-06 22:51:41,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:41,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:41,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-06 22:51:41,348 INFO L87 Difference]: Start difference. First operand 1124 states and 1464 transitions. Second operand 5 states. [2019-11-06 22:51:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:42,617 INFO L93 Difference]: Finished difference Result 2636 states and 3392 transitions. [2019-11-06 22:51:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:51:42,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2019-11-06 22:51:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:42,627 INFO L225 Difference]: With dead ends: 2636 [2019-11-06 22:51:42,628 INFO L226 Difference]: Without dead ends: 1518 [2019-11-06 22:51:42,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-06 22:51:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2019-11-06 22:51:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1314. [2019-11-06 22:51:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-06 22:51:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1684 transitions. [2019-11-06 22:51:42,669 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1684 transitions. Word has length 185 [2019-11-06 22:51:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:42,670 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1684 transitions. [2019-11-06 22:51:42,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1684 transitions. [2019-11-06 22:51:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-06 22:51:42,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:42,673 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:51:42,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:42,876 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:42,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash -438667603, now seen corresponding path program 1 times [2019-11-06 22:51:42,877 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:42,877 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894240145] [2019-11-06 22:51:42,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:43,600 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894240145] [2019-11-06 22:51:43,601 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930066705] [2019-11-06 22:51:43,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:43,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:43,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 51 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:43,867 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:43,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 24 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:44,267 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1906148208] [2019-11-06 22:51:44,274 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 197 [2019-11-06 22:51:44,322 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:44,323 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:51,248 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:51,251 INFO L272 AbstractInterpreter]: Visited 103 different actions 201 times. Merged at 4 different actions 5 times. Never widened. Performed 431 root evaluator evaluations with a maximum evaluation depth of 13. Performed 431 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-11-06 22:51:51,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:51,255 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:51:53,176 INFO L227 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 77.24% of their original sizes. [2019-11-06 22:51:53,176 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:51:53,248 INFO L553 sIntCurrentIteration]: We unified 195 AI predicates to 195 [2019-11-06 22:51:53,248 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:51:53,249 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:51:53,249 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:51:53,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555242430] [2019-11-06 22:51:53,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:51:53,250 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:51:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:51:53,251 INFO L87 Difference]: Start difference. First operand 1314 states and 1684 transitions. Second operand 11 states. [2019-11-06 22:51:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:51:53,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:53,462 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 15090#true or 16769#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |main_#t~ret3| 1) 0)) ([#1{~a21~0 = [6;6]; main_#t~ret3 = [-1;-1]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) 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.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) 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:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) 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-11-06 22:51:53,468 INFO L168 Benchmark]: Toolchain (without parser) took 24914.31 ms. Allocated memory was 146.3 MB in the beginning and 1.1 GB in the end (delta: 916.5 MB). Free memory was 101.9 MB in the beginning and 826.3 MB in the end (delta: -724.4 MB). Peak memory consumption was 192.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,469 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 926.74 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 158.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,471 INFO L168 Benchmark]: Boogie Preprocessor took 160.43 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 152.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,472 INFO L168 Benchmark]: RCFGBuilder took 1799.71 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 152.9 MB in the beginning and 143.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,473 INFO L168 Benchmark]: TraceAbstraction took 22021.64 ms. Allocated memory was 236.5 MB in the beginning and 1.1 GB in the end (delta: 826.3 MB). Free memory was 142.5 MB in the beginning and 826.3 MB in the end (delta: -683.9 MB). Peak memory consumption was 142.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:53,477 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 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 926.74 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.5 MB in the beginning and 158.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.43 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 152.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1799.71 ms. Allocated memory was 204.5 MB in the beginning and 236.5 MB in the end (delta: 32.0 MB). Free memory was 152.9 MB in the beginning and 143.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 22021.64 ms. Allocated memory was 236.5 MB in the beginning and 1.1 GB in the end (delta: 826.3 MB). Free memory was 142.5 MB in the beginning and 826.3 MB in the end (delta: -683.9 MB). Peak memory consumption was 142.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 15090#true or 16769#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |main_#t~ret3| 1) 0)) ([#1{~a21~0 = [6;6]; main_#t~ret3 = [-1;-1]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 15090#true or 16769#(and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5) (= (+ |main_#t~ret3| 1) 0)) ([#1{~a21~0 = [6;6]; main_#t~ret3 = [-1;-1]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...