/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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:50:57,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:50:57,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:50:57,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:50:57,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:50:57,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:50:57,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:50:57,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:50:57,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:50:57,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:50:57,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:50:57,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:50:57,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:50:57,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:50:57,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:50:57,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:50:57,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:50:57,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:50:57,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:50:57,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:50:57,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:50:57,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:50:57,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:50:57,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:50:57,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:50:57,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:50:57,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:50:57,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:50:57,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:50:57,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:50:57,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:50:57,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:50:57,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:50:57,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:50:57,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:50:57,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:50:57,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:50:57,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:50:57,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:50:57,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:50:57,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:50:57,223 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:50:57,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:50:57,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:50:57,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:50:57,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:50:57,245 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:50:57,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:50:57,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:50:57,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:50:57,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:50:57,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:50:57,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:50:57,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:50:57,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:50:57,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:50:57,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:50:57,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:50:57,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:50:57,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:50:57,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:50:57,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:50:57,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:50:57,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:50:57,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:50:57,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:50:57,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:50:57,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:50:57,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:50:57,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:50:57,252 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:50:57,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:50:57,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:50:57,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:50:57,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:50:57,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:50:57,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label28.c [2019-11-06 22:50:57,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4591aa3/79ad55c15d624064b893c46dc3afca17/FLAG0c22c8c67 [2019-11-06 22:50:58,135 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:50:58,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label28.c [2019-11-06 22:50:58,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4591aa3/79ad55c15d624064b893c46dc3afca17/FLAG0c22c8c67 [2019-11-06 22:50:58,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b4591aa3/79ad55c15d624064b893c46dc3afca17 [2019-11-06 22:50:58,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:50:58,418 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:50:58,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:58,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:50:58,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:50:58,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:58" (1/1) ... [2019-11-06 22:50:58,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5ac96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:58, skipping insertion in model container [2019-11-06 22:50:58,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:58" (1/1) ... [2019-11-06 22:50:58,437 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:50:58,508 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:50:59,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:59,141 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:50:59,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:59,334 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:50:59,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59 WrapperNode [2019-11-06 22:50:59,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:59,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:50:59,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:50:59,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:50:59,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (1/1) ... [2019-11-06 22:50:59,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:50:59,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:50:59,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:50:59,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:50:59,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (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:50:59,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:50:59,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:50:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:50:59,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:50:59,568 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:50:59,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:50:59,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:50:59,570 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:50:59,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:50:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:50:59,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:01,047 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:01,048 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:01,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:01 BoogieIcfgContainer [2019-11-06 22:51:01,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:01,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:01,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:01,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:01,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:58" (1/3) ... [2019-11-06 22:51:01,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f67470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:01, skipping insertion in model container [2019-11-06 22:51:01,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:59" (2/3) ... [2019-11-06 22:51:01,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75f67470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:01, skipping insertion in model container [2019-11-06 22:51:01,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:01" (3/3) ... [2019-11-06 22:51:01,067 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label28.c [2019-11-06 22:51:01,082 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:01,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:01,109 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:01,149 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:01,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:01,150 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:01,150 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:01,150 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:01,150 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:01,150 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:01,151 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:01,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 22:51:01,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:01,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:01,197 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1694474349, now seen corresponding path program 1 times [2019-11-06 22:51:01,216 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:01,216 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873752111] [2019-11-06 22:51:01,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:01,455 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:01,457 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873752111] [2019-11-06 22:51:01,459 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:01,459 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:01,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98737322] [2019-11-06 22:51:01,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:01,470 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:01,493 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-11-06 22:51:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:03,389 INFO L93 Difference]: Finished difference Result 890 states and 1606 transitions. [2019-11-06 22:51:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:03,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-06 22:51:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:03,414 INFO L225 Difference]: With dead ends: 890 [2019-11-06 22:51:03,415 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:51:03,423 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:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:51:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-11-06 22:51:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:51:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-11-06 22:51:03,500 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 16 [2019-11-06 22:51:03,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:03,501 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-11-06 22:51:03,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-11-06 22:51:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:51:03,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:03,506 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:51:03,507 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:03,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1881013151, now seen corresponding path program 1 times [2019-11-06 22:51:03,507 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:03,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622981872] [2019-11-06 22:51:03,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:03,990 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622981872] [2019-11-06 22:51:03,990 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:03,990 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:51:03,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837505716] [2019-11-06 22:51:03,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:51:03,993 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:03,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:51:03,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:51:03,994 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 6 states. [2019-11-06 22:51:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:05,504 INFO L93 Difference]: Finished difference Result 948 states and 1313 transitions. [2019-11-06 22:51:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 22:51:05,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-06 22:51:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:05,511 INFO L225 Difference]: With dead ends: 948 [2019-11-06 22:51:05,511 INFO L226 Difference]: Without dead ends: 582 [2019-11-06 22:51:05,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:51:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-06 22:51:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2019-11-06 22:51:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-11-06 22:51:05,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 747 transitions. [2019-11-06 22:51:05,556 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 747 transitions. Word has length 99 [2019-11-06 22:51:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:05,557 INFO L462 AbstractCegarLoop]: Abstraction has 566 states and 747 transitions. [2019-11-06 22:51:05,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:51:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 747 transitions. [2019-11-06 22:51:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-06 22:51:05,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:05,561 INFO L410 BasicCegarLoop]: trace histogram [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-11-06 22:51:05,561 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:05,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:05,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2144779955, now seen corresponding path program 1 times [2019-11-06 22:51:05,562 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:05,562 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823330818] [2019-11-06 22:51:05,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:05,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823330818] [2019-11-06 22:51:05,688 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:05,688 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:51:05,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304319098] [2019-11-06 22:51:05,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:51:05,691 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:51:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:51:05,692 INFO L87 Difference]: Start difference. First operand 566 states and 747 transitions. Second operand 3 states. [2019-11-06 22:51:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:06,593 INFO L93 Difference]: Finished difference Result 1494 states and 2014 transitions. [2019-11-06 22:51:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:51:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-06 22:51:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:06,599 INFO L225 Difference]: With dead ends: 1494 [2019-11-06 22:51:06,599 INFO L226 Difference]: Without dead ends: 934 [2019-11-06 22:51:06,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:51:06,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-06 22:51:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-11-06 22:51:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-11-06 22:51:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1192 transitions. [2019-11-06 22:51:06,641 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1192 transitions. Word has length 125 [2019-11-06 22:51:06,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:06,642 INFO L462 AbstractCegarLoop]: Abstraction has 934 states and 1192 transitions. [2019-11-06 22:51:06,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:51:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1192 transitions. [2019-11-06 22:51:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:51:06,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:06,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:06,647 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:06,647 INFO L82 PathProgramCache]: Analyzing trace with hash 386406922, now seen corresponding path program 1 times [2019-11-06 22:51:06,648 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:06,648 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107310968] [2019-11-06 22:51:06,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:06,885 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107310968] [2019-11-06 22:51:06,885 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:06,886 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:51:06,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370484233] [2019-11-06 22:51:06,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:51:06,887 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:51:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:51:06,887 INFO L87 Difference]: Start difference. First operand 934 states and 1192 transitions. Second operand 6 states. [2019-11-06 22:51:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:08,121 INFO L93 Difference]: Finished difference Result 2266 states and 3056 transitions. [2019-11-06 22:51:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:08,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-11-06 22:51:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:08,133 INFO L225 Difference]: With dead ends: 2266 [2019-11-06 22:51:08,134 INFO L226 Difference]: Without dead ends: 1520 [2019-11-06 22:51:08,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:51:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-11-06 22:51:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1498. [2019-11-06 22:51:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2019-11-06 22:51:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1870 transitions. [2019-11-06 22:51:08,188 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1870 transitions. Word has length 156 [2019-11-06 22:51:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:08,189 INFO L462 AbstractCegarLoop]: Abstraction has 1498 states and 1870 transitions. [2019-11-06 22:51:08,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:51:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1870 transitions. [2019-11-06 22:51:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-11-06 22:51:08,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:08,194 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:51:08,194 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -380685670, now seen corresponding path program 1 times [2019-11-06 22:51:08,195 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:08,195 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175006885] [2019-11-06 22:51:08,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:08,752 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:08,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175006885] [2019-11-06 22:51:08,752 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803450147] [2019-11-06 22:51:08,753 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:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:08,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:08,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:08,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:09,135 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:09,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:09,485 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [37675434] [2019-11-06 22:51:09,490 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 184 [2019-11-06 22:51:09,532 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:09,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:14,645 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:14,649 INFO L272 AbstractInterpreter]: Visited 92 different actions 179 times. Merged at 4 different actions 5 times. Never widened. Performed 398 root evaluator evaluations with a maximum evaluation depth of 13. Performed 398 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:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:14,655 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:51:16,284 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 77.22% of their original sizes. [2019-11-06 22:51:16,285 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:51:16,373 INFO L553 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2019-11-06 22:51:16,373 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:51:16,374 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:51:16,374 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:51:16,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441295395] [2019-11-06 22:51:16,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:51:16,376 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:51:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:51:16,377 INFO L87 Difference]: Start difference. First operand 1498 states and 1870 transitions. Second operand 11 states. [2019-11-06 22:51:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:51:16,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:16,588 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: 9443#true or 10928#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~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:16,600 INFO L168 Benchmark]: Toolchain (without parser) took 18176.88 ms. Allocated memory was 135.3 MB in the beginning and 866.6 MB in the end (delta: 731.4 MB). Free memory was 97.7 MB in the beginning and 141.7 MB in the end (delta: -44.0 MB). Peak memory consumption was 687.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:16,605 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 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:16,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.09 ms. Allocated memory was 135.3 MB in the beginning and 203.4 MB in the end (delta: 68.2 MB). Free memory was 97.5 MB in the beginning and 165.7 MB in the end (delta: -68.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:16,610 INFO L168 Benchmark]: Boogie Preprocessor took 152.39 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 160.3 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:16,611 INFO L168 Benchmark]: RCFGBuilder took 1561.62 ms. Allocated memory was 203.4 MB in the beginning and 230.2 MB in the end (delta: 26.7 MB). Free memory was 160.3 MB in the beginning and 154.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:16,614 INFO L168 Benchmark]: TraceAbstraction took 15541.69 ms. Allocated memory was 230.2 MB in the beginning and 866.6 MB in the end (delta: 636.5 MB). Free memory was 154.9 MB in the beginning and 141.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 649.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:16,624 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 916.09 ms. Allocated memory was 135.3 MB in the beginning and 203.4 MB in the end (delta: 68.2 MB). Free memory was 97.5 MB in the beginning and 165.7 MB in the end (delta: -68.2 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.39 ms. Allocated memory is still 203.4 MB. Free memory was 165.7 MB in the beginning and 160.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1561.62 ms. Allocated memory was 203.4 MB in the beginning and 230.2 MB in the end (delta: 26.7 MB). Free memory was 160.3 MB in the beginning and 154.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15541.69 ms. Allocated memory was 230.2 MB in the beginning and 866.6 MB in the end (delta: 636.5 MB). Free memory was 154.9 MB in the beginning and 141.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 649.7 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: 9443#true or 10928#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 9443#true or 10928#(or (and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) (and (= ~a21~0 6) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a15~0 5))) ([#2{~a21~0 = [6;6]; ~a12~0 = [-49;-49]; ~a15~0 = [5;5]; ~a24~0 = [1;1]; }, {~a21~0 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~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...