/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_label52.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:57,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:57,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:57,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:57,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:57,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:57,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:57,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:57,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:57,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:57,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:57,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:57,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:57,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:57,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:57,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:57,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:57,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:57,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:57,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:57,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:57,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:57,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:57,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:57,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:57,655 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:57,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:57,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:57,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:57,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:57,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:57,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:57,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:57,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:57,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:57,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:57,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:57,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:57,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:57,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:57,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:57,664 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:51:57,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:57,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:57,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:57,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:57,679 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:57,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:57,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:57,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:57,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:57,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:57,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:57,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:57,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:57,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:57,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:57,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:57,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:57,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:57,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:57,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:57,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:57,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:57,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:57,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:51:57,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:57,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:57,972 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:57,973 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:57,973 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:57,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label52.c [2019-11-06 22:51:58,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb874353/b10593b33c0e41c3b8f2eade20e9927d/FLAGf77a6ae22 [2019-11-06 22:51:58,601 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:58,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label52.c [2019-11-06 22:51:58,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb874353/b10593b33c0e41c3b8f2eade20e9927d/FLAGf77a6ae22 [2019-11-06 22:51:58,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccb874353/b10593b33c0e41c3b8f2eade20e9927d [2019-11-06 22:51:58,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:58,835 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:58,836 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:58,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:58,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:58,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:58" (1/1) ... [2019-11-06 22:51:58,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ccd342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:58, skipping insertion in model container [2019-11-06 22:51:58,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:58" (1/1) ... [2019-11-06 22:51:58,851 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:58,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:51:59,438 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:59,443 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:51:59,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:59,694 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:51:59,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59 WrapperNode [2019-11-06 22:51:59,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:59,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:51:59,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:51:59,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:51:59,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (1/1) ... [2019-11-06 22:51:59,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:51:59,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:51:59,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:51:59,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:51:59,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51: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:51:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:51:59,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:51:59,953 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:51:59,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:51:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:51:59,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:51:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:51:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:51:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:51:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:51:59,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:52:01,621 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:52:01,622 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:52:01,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:01 BoogieIcfgContainer [2019-11-06 22:52:01,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:52:01,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:52:01,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:52:01,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:52:01,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:58" (1/3) ... [2019-11-06 22:52:01,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b21a17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:01, skipping insertion in model container [2019-11-06 22:52:01,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:59" (2/3) ... [2019-11-06 22:52:01,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b21a17e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:52:01, skipping insertion in model container [2019-11-06 22:52:01,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:52:01" (3/3) ... [2019-11-06 22:52:01,632 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label52.c [2019-11-06 22:52:01,641 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:52:01,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:52:01,662 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:52:01,693 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:52:01,693 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:52:01,693 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:52:01,693 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:52:01,694 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:52:01,694 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:52:01,694 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:52:01,694 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:52:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:52:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 22:52:01,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:01,726 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, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:01,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2120821501, now seen corresponding path program 1 times [2019-11-06 22:52:01,743 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:01,744 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485258128] [2019-11-06 22:52:01,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:02,034 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:52:02,035 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485258128] [2019-11-06 22:52:02,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:02,036 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:52:02,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111829835] [2019-11-06 22:52:02,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:52:02,047 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:02,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:52:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:02,069 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:52:03,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:03,391 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:52:03,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:52:03,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 22:52:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:03,410 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:52:03,411 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:52:03,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:52:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:52:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:52:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:52:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-11-06 22:52:03,535 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 28 [2019-11-06 22:52:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:03,536 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-11-06 22:52:03,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:52:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-11-06 22:52:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-06 22:52:03,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:03,542 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:03,543 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1199804154, now seen corresponding path program 1 times [2019-11-06 22:52:03,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:03,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144751051] [2019-11-06 22:52:03,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:03,804 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144751051] [2019-11-06 22:52:03,804 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:03,804 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:52:03,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655456802] [2019-11-06 22:52:03,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:52:03,807 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:52:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:52:03,807 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-11-06 22:52:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:05,185 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-11-06 22:52:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:52:05,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-11-06 22:52:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:05,192 INFO L225 Difference]: With dead ends: 936 [2019-11-06 22:52:05,192 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 22:52:05,195 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:52:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 22:52:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-06 22:52:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-06 22:52:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-11-06 22:52:05,226 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 114 [2019-11-06 22:52:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:05,227 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-11-06 22:52:05,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:52:05,228 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-11-06 22:52:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-06 22:52:05,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:05,231 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:05,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash 217144121, now seen corresponding path program 1 times [2019-11-06 22:52:05,232 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:05,232 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643238352] [2019-11-06 22:52:05,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:05,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:05,360 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643238352] [2019-11-06 22:52:05,360 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:52:05,360 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:52:05,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601815562] [2019-11-06 22:52:05,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:52:05,364 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:52:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:52:05,365 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-11-06 22:52:06,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:06,858 INFO L93 Difference]: Finished difference Result 2220 states and 3292 transitions. [2019-11-06 22:52:06,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:52:06,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-06 22:52:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:06,869 INFO L225 Difference]: With dead ends: 2220 [2019-11-06 22:52:06,870 INFO L226 Difference]: Without dead ends: 1664 [2019-11-06 22:52:06,872 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:52:06,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-11-06 22:52:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-11-06 22:52:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-06 22:52:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2287 transitions. [2019-11-06 22:52:06,975 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2287 transitions. Word has length 123 [2019-11-06 22:52:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:06,985 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2287 transitions. [2019-11-06 22:52:06,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:52:06,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2287 transitions. [2019-11-06 22:52:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-06 22:52:07,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:07,004 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:07,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1603017994, now seen corresponding path program 1 times [2019-11-06 22:52:07,005 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:07,005 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194133365] [2019-11-06 22:52:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 133 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:52:07,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194133365] [2019-11-06 22:52:07,361 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524348181] [2019-11-06 22:52:07,361 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:52:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:07,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-06 22:52:07,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:07,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:52:07,807 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:07,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:52:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 42 proven. 107 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:08,398 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:52:08,398 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-11-06 22:52:08,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644858600] [2019-11-06 22:52:08,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:52:08,399 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:52:08,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-06 22:52:08,400 INFO L87 Difference]: Start difference. First operand 1664 states and 2287 transitions. Second operand 5 states. [2019-11-06 22:52:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:52:09,838 INFO L93 Difference]: Finished difference Result 3726 states and 5163 transitions. [2019-11-06 22:52:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:52:09,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2019-11-06 22:52:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:52:09,854 INFO L225 Difference]: With dead ends: 3726 [2019-11-06 22:52:09,854 INFO L226 Difference]: Without dead ends: 2068 [2019-11-06 22:52:09,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 498 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:52:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-11-06 22:52:09,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1690. [2019-11-06 22:52:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-11-06 22:52:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2313 transitions. [2019-11-06 22:52:09,919 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2313 transitions. Word has length 251 [2019-11-06 22:52:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:52:09,919 INFO L462 AbstractCegarLoop]: Abstraction has 1690 states and 2313 transitions. [2019-11-06 22:52:09,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:52:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2313 transitions. [2019-11-06 22:52:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-06 22:52:09,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:52:09,928 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:52:10,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:10,133 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:52:10,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1140395773, now seen corresponding path program 1 times [2019-11-06 22:52:10,134 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:52:10,134 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910869346] [2019-11-06 22:52:10,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:52:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 149 proven. 189 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:11,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910869346] [2019-11-06 22:52:11,343 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999339825] [2019-11-06 22:52:11,343 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:52:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:52:11,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-06 22:52:11,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:52:11,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:52:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 267 proven. 53 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:52:11,772 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:52:11,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:52:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 71 proven. 267 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:52:12,416 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1498872134] [2019-11-06 22:52:12,422 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 336 [2019-11-06 22:52:12,475 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:52:12,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:52:25,029 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:52:25,031 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:52:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:52:25,034 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:30,722 INFO L227 lantSequenceWeakener]: Weakened 332 states. On average, predicates are now at 77.43% of their original sizes. [2019-11-06 22:52:30,722 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:30,804 INFO L553 sIntCurrentIteration]: We unified 334 AI predicates to 334 [2019-11-06 22:52:30,804 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:30,805 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:30,805 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 8, 8] total 29 [2019-11-06 22:52:30,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284609322] [2019-11-06 22:52:30,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:30,807 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:30,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:52:30,808 INFO L87 Difference]: Start difference. First operand 1690 states and 2313 transitions. Second operand 11 states. [2019-11-06 22:52:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:31,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:31,015 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: 13880#true or 16576#(and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) ([#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:52:31,022 INFO L168 Benchmark]: Toolchain (without parser) took 32186.03 ms. Allocated memory was 145.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 989.2 MB in the end (delta: -887.5 MB). Peak memory consumption was 407.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,027 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 858.50 ms. Allocated memory was 145.8 MB in the beginning and 206.0 MB in the end (delta: 60.3 MB). Free memory was 101.6 MB in the beginning and 164.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,036 INFO L168 Benchmark]: Boogie Preprocessor took 169.83 ms. Allocated memory is still 206.0 MB. Free memory was 164.6 MB in the beginning and 158.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,037 INFO L168 Benchmark]: RCFGBuilder took 1757.91 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 158.8 MB in the beginning and 153.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 74.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,038 INFO L168 Benchmark]: TraceAbstraction took 29395.35 ms. Allocated memory was 238.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 151.7 MB in the beginning and 989.2 MB in the end (delta: -837.5 MB). Peak memory consumption was 364.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:31,046 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 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 858.50 ms. Allocated memory was 145.8 MB in the beginning and 206.0 MB in the end (delta: 60.3 MB). Free memory was 101.6 MB in the beginning and 164.6 MB in the end (delta: -63.0 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 169.83 ms. Allocated memory is still 206.0 MB. Free memory was 164.6 MB in the beginning and 158.8 MB in the end (delta: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1757.91 ms. Allocated memory was 206.0 MB in the beginning and 238.6 MB in the end (delta: 32.5 MB). Free memory was 158.8 MB in the beginning and 153.2 MB in the end (delta: 5.7 MB). Peak memory consumption was 74.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29395.35 ms. Allocated memory was 238.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 151.7 MB in the beginning and 989.2 MB in the end (delta: -837.5 MB). Peak memory consumption was 364.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: 13880#true or 16576#(and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) ([#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: 13880#true or 16576#(and (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~a24~0 1) (= ~a21~0 7)) ([#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...