/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_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:50:57,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:50:57,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:50:57,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:50:57,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:50:57,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:50:57,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:50:57,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:50:57,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:50:57,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:50:57,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:50:57,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:50:57,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:50:57,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:50:57,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:50:57,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:50:57,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:50:57,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:50:57,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:50:57,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:50:57,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:50:57,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:50:57,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:50:57,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:50:57,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:50:57,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:50:57,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:50:57,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:50:57,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:50:57,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:50:57,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:50:57,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:50:57,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:50:57,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:50:57,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:50:57,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:50:57,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:50:57,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:50:57,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:50:57,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:50:57,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:50:57,112 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,126 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:50:57,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:50:57,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:50:57,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:50:57,128 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:50:57,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:50:57,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:50:57,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:50:57,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:50:57,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:50:57,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:50:57,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:50:57,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:50:57,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:50:57,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:50:57,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:50:57,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:50:57,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:50:57,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:50:57,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:50:57,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:50:57,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:50:57,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:50:57,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:50:57,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:50:57,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:50:57,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:50:57,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:50:57,134 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,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:50:57,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:50:57,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:50:57,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:50:57,428 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:50:57,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label29.c [2019-11-06 22:50:57,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eef42523/9312f30cb90e42a69a7889c663ada927/FLAG5497b6336 [2019-11-06 22:50:58,116 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:50:58,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label29.c [2019-11-06 22:50:58,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eef42523/9312f30cb90e42a69a7889c663ada927/FLAG5497b6336 [2019-11-06 22:50:58,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eef42523/9312f30cb90e42a69a7889c663ada927 [2019-11-06 22:50:58,382 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:50:58,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:50:58,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:58,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:50:58,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:50:58,389 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,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c85a186 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,392 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,400 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:50:58,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:50:59,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:59,031 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:50:59,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:59,270 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:50:59,271 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,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:59,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:50:59,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:50:59,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:50:59,289 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,289 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,311 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,311 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,371 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,407 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,421 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,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:50:59,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:50:59,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:50:59,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:50:59,440 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,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:50:59,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:50:59,552 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:50:59,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:50:59,553 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:50:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:50:59,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:50:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:50:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:50:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:50:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:01,051 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:01,051 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:01,053 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,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:01,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:01,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:01,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:01,059 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,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac80400 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,060 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,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac80400 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,061 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,063 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label29.c [2019-11-06 22:51:01,073 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:01,082 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:01,093 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:01,123 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:01,123 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:01,123 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:01,123 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:01,123 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:01,124 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:01,124 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:01,124 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:01,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:51:01,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:01,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:01,159 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:01,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1085195851, now seen corresponding path program 1 times [2019-11-06 22:51:01,174 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:01,174 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857663222] [2019-11-06 22:51:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:01,454 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,454 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857663222] [2019-11-06 22:51:01,458 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:01,458 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:01,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844277222] [2019-11-06 22:51:01,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:01,467 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:01,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:01,490 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-11-06 22:51:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:03,332 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2019-11-06 22:51:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:03,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-06 22:51:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:03,354 INFO L225 Difference]: With dead ends: 890 [2019-11-06 22:51:03,355 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:51:03,365 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,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:51:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-11-06 22:51:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-06 22:51:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2019-11-06 22:51:03,456 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 22 [2019-11-06 22:51:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:03,457 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2019-11-06 22:51:03,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2019-11-06 22:51:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-06 22:51:03,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:03,465 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:03,465 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:03,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:03,466 INFO L82 PathProgramCache]: Analyzing trace with hash 503601434, now seen corresponding path program 1 times [2019-11-06 22:51:03,466 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:03,466 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561967172] [2019-11-06 22:51:03,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:03,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561967172] [2019-11-06 22:51:03,756 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:03,756 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:03,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096858011] [2019-11-06 22:51:03,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:03,759 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:03,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:03,760 INFO L87 Difference]: Start difference. First operand 554 states and 776 transitions. Second operand 4 states. [2019-11-06 22:51:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:05,402 INFO L93 Difference]: Finished difference Result 2012 states and 2904 transitions. [2019-11-06 22:51:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:05,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-06 22:51:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:05,412 INFO L225 Difference]: With dead ends: 2012 [2019-11-06 22:51:05,413 INFO L226 Difference]: Without dead ends: 1464 [2019-11-06 22:51:05,415 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:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2019-11-06 22:51:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1282. [2019-11-06 22:51:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-11-06 22:51:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1767 transitions. [2019-11-06 22:51:05,483 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1767 transitions. Word has length 134 [2019-11-06 22:51:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:05,484 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 1767 transitions. [2019-11-06 22:51:05,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1767 transitions. [2019-11-06 22:51:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-06 22:51:05,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:05,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,506 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash -906411563, now seen corresponding path program 1 times [2019-11-06 22:51:05,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:05,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656696544] [2019-11-06 22:51:05,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:06,171 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:06,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656696544] [2019-11-06 22:51:06,172 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3564799] [2019-11-06 22:51:06,172 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:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:06,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:51:06,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:06,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:51:06,462 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:06,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:51:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 30 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:06,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:06,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 5] total 14 [2019-11-06 22:51:06,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563397192] [2019-11-06 22:51:06,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:06,993 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-06 22:51:06,993 INFO L87 Difference]: Start difference. First operand 1282 states and 1767 transitions. Second operand 5 states. [2019-11-06 22:51:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:08,340 INFO L93 Difference]: Finished difference Result 2958 states and 4059 transitions. [2019-11-06 22:51:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:51:08,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-11-06 22:51:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:08,355 INFO L225 Difference]: With dead ends: 2958 [2019-11-06 22:51:08,355 INFO L226 Difference]: Without dead ends: 1682 [2019-11-06 22:51:08,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 411 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-06 22:51:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2019-11-06 22:51:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1672. [2019-11-06 22:51:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-06 22:51:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2238 transitions. [2019-11-06 22:51:08,434 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2238 transitions. Word has length 208 [2019-11-06 22:51:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:08,434 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2238 transitions. [2019-11-06 22:51:08,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2238 transitions. [2019-11-06 22:51:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-11-06 22:51:08,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:08,447 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-06 22:51:08,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:08,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -616807464, now seen corresponding path program 1 times [2019-11-06 22:51:08,654 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:08,655 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731882453] [2019-11-06 22:51:08,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 45 proven. 132 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-06 22:51:08,857 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731882453] [2019-11-06 22:51:08,857 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77375065] [2019-11-06 22:51:08,857 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:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:08,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 22:51:08,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-06 22:51:09,043 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:09,226 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 45 proven. 132 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-06 22:51:09,227 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:51:09,227 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-11-06 22:51:09,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905873175] [2019-11-06 22:51:09,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:51:09,231 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:09,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:51:09,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:51:09,232 INFO L87 Difference]: Start difference. First operand 1672 states and 2238 transitions. Second operand 5 states. [2019-11-06 22:51:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:10,354 INFO L93 Difference]: Finished difference Result 3008 states and 4166 transitions. [2019-11-06 22:51:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:10,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 278 [2019-11-06 22:51:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:10,364 INFO L225 Difference]: With dead ends: 3008 [2019-11-06 22:51:10,364 INFO L226 Difference]: Without dead ends: 1342 [2019-11-06 22:51:10,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 550 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:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-06 22:51:10,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1318. [2019-11-06 22:51:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-11-06 22:51:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1669 transitions. [2019-11-06 22:51:10,412 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1669 transitions. Word has length 278 [2019-11-06 22:51:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:10,414 INFO L462 AbstractCegarLoop]: Abstraction has 1318 states and 1669 transitions. [2019-11-06 22:51:10,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:51:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1669 transitions. [2019-11-06 22:51:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-06 22:51:10,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:10,420 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:10,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:10,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1461451740, now seen corresponding path program 1 times [2019-11-06 22:51:10,629 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:10,629 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508211419] [2019-11-06 22:51:10,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 131 proven. 142 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:11,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508211419] [2019-11-06 22:51:11,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504965049] [2019-11-06 22:51:11,336 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:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:11,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:51:11,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:11,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 208 proven. 53 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 22:51:11,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:51:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 53 proven. 220 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:51:12,178 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2095722595] [2019-11-06 22:51:12,183 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 293 [2019-11-06 22:51:12,246 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:12,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:25,095 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:25,098 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 485 root evaluator evaluations with a maximum evaluation depth of 13. Performed 485 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:25,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:25,101 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:51:29,087 INFO L227 lantSequenceWeakener]: Weakened 289 states. On average, predicates are now at 77.35% of their original sizes. [2019-11-06 22:51:29,087 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:51:29,169 INFO L553 sIntCurrentIteration]: We unified 291 AI predicates to 291 [2019-11-06 22:51:29,170 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:51:29,170 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:51:29,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:51:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957383530] [2019-11-06 22:51:29,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:51:29,172 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:51:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:51:29,173 INFO L87 Difference]: Start difference. First operand 1318 states and 1669 transitions. Second operand 11 states. [2019-11-06 22:51:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:51:29,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:29,386 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: 17167#true or 19524#(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 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~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:29,397 INFO L168 Benchmark]: Toolchain (without parser) took 31010.37 ms. Allocated memory was 138.9 MB in the beginning and 1.5 GB in the end (delta: 1.4 GB). Free memory was 100.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 297.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:29,401 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:51:29,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 887.11 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 162.2 MB in the end (delta: -61.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:29,406 INFO L168 Benchmark]: Boogie Preprocessor took 161.50 ms. Allocated memory is still 205.0 MB. Free memory was 162.2 MB in the beginning and 156.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:29,411 INFO L168 Benchmark]: RCFGBuilder took 1619.57 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 156.1 MB in the beginning and 150.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:29,412 INFO L168 Benchmark]: TraceAbstraction took 28338.00 ms. Allocated memory was 238.6 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 150.7 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 247.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:29,417 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 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 887.11 ms. Allocated memory was 138.9 MB in the beginning and 205.0 MB in the end (delta: 66.1 MB). Free memory was 100.8 MB in the beginning and 162.2 MB in the end (delta: -61.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 161.50 ms. Allocated memory is still 205.0 MB. Free memory was 162.2 MB in the beginning and 156.1 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1619.57 ms. Allocated memory was 205.0 MB in the beginning and 238.6 MB in the end (delta: 33.6 MB). Free memory was 156.1 MB in the beginning and 150.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28338.00 ms. Allocated memory was 238.6 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 150.7 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 247.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: 17167#true or 19524#(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 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~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: 17167#true or 19524#(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 = [7;7]; ~a12~0 = [-49;-49]; ~a15~0 = [8;8]; ~a24~0 = [1;1]; }, {~a21~0 = [6;6]; ~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...