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/Problem11_label47.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:05:00,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:05:00,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:05:00,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:05:00,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:05:00,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:05:00,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:05:00,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:05:00,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:05:00,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:05:00,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:05:00,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:05:00,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:05:00,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:05:00,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:05:00,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:05:00,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:05:00,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:05:00,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:05:00,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:05:00,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:05:00,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:05:00,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:05:00,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:05:00,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:05:00,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:05:00,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:05:00,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:05:00,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:05:00,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:05:00,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:05:00,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:05:00,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:05:00,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:05:00,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:05:00,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:05:00,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:05:00,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:05:00,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:05:00,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:05:00,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:05:00,549 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-10-13 20:05:00,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:05:00,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:05:00,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:05:00,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:05:00,586 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:05:00,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:05:00,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:05:00,587 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:05:00,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:05:00,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:05:00,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:05:00,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:05:00,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:05:00,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:05:00,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:05:00,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:05:00,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:05:00,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:05:00,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:05:00,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:05:00,591 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:05:00,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:05:00,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:05:00,591 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-10-13 20:05:00,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:05:00,892 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:05:00,896 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:05:00,897 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:05:00,898 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:05:00,898 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label47.c [2019-10-13 20:05:00,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fe185bf/36501ac22cf3401eb40cd8bacdef106b/FLAGca31e8d1f [2019-10-13 20:05:01,538 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:05:01,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label47.c [2019-10-13 20:05:01,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fe185bf/36501ac22cf3401eb40cd8bacdef106b/FLAGca31e8d1f [2019-10-13 20:05:01,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4fe185bf/36501ac22cf3401eb40cd8bacdef106b [2019-10-13 20:05:01,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:05:01,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:05:01,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:05:01,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:05:01,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:05:01,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:05:01" (1/1) ... [2019-10-13 20:05:01,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404140b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:01, skipping insertion in model container [2019-10-13 20:05:01,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:05:01" (1/1) ... [2019-10-13 20:05:01,886 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:05:01,957 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:05:02,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:05:02,662 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:05:02,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:05:02,841 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:05:02,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02 WrapperNode [2019-10-13 20:05:02,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:05:02,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:05:02,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:05:02,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:05:02,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... [2019-10-13 20:05:02,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:05:02,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:05:02,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:05:02,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:05:02,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:05:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:05:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:05:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 20:05:03,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:05:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 20:05:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:05:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:05:03,047 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:05:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:05:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:05:03,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:05:04,738 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:05:04,738 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:05:04,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:05:04 BoogieIcfgContainer [2019-10-13 20:05:04,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:05:04,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:05:04,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:05:04,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:05:04,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:05:01" (1/3) ... [2019-10-13 20:05:04,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c6584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:05:04, skipping insertion in model container [2019-10-13 20:05:04,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:05:02" (2/3) ... [2019-10-13 20:05:04,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405c6584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:05:04, skipping insertion in model container [2019-10-13 20:05:04,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:05:04" (3/3) ... [2019-10-13 20:05:04,766 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2019-10-13 20:05:04,779 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:05:04,790 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:05:04,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:05:04,851 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:05:04,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:05:04,851 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:05:04,851 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:05:04,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:05:04,852 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:05:04,852 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:05:04,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:05:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-13 20:05:04,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 20:05:04,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:04,899 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:04,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:04,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:04,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1102823458, now seen corresponding path program 1 times [2019-10-13 20:05:04,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:04,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767757570] [2019-10-13 20:05:04,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:04,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:04,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:05,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:05,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767757570] [2019-10-13 20:05:05,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:05,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:05:05,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250297654] [2019-10-13 20:05:05,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:05:05,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:05:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:05,303 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-10-13 20:05:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:06,727 INFO L93 Difference]: Finished difference Result 787 states and 1379 transitions. [2019-10-13 20:05:06,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:05:06,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-13 20:05:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:06,761 INFO L225 Difference]: With dead ends: 787 [2019-10-13 20:05:06,762 INFO L226 Difference]: Without dead ends: 433 [2019-10-13 20:05:06,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-13 20:05:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2019-10-13 20:05:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-13 20:05:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 678 transitions. [2019-10-13 20:05:06,856 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 678 transitions. Word has length 41 [2019-10-13 20:05:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 678 transitions. [2019-10-13 20:05:06,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:05:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 678 transitions. [2019-10-13 20:05:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 20:05:06,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:06,863 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:05:06,864 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash -659313835, now seen corresponding path program 1 times [2019-10-13 20:05:06,864 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:06,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517224310] [2019-10-13 20:05:06,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:06,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:06,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:07,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517224310] [2019-10-13 20:05:07,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:07,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:05:07,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511385203] [2019-10-13 20:05:07,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:07,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:07,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:05:07,060 INFO L87 Difference]: Start difference. First operand 426 states and 678 transitions. Second operand 5 states. [2019-10-13 20:05:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:08,659 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-10-13 20:05:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:05:08,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-13 20:05:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:08,670 INFO L225 Difference]: With dead ends: 1259 [2019-10-13 20:05:08,671 INFO L226 Difference]: Without dead ends: 839 [2019-10-13 20:05:08,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-13 20:05:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 627. [2019-10-13 20:05:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 20:05:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2019-10-13 20:05:08,722 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 116 [2019-10-13 20:05:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:08,723 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2019-10-13 20:05:08,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2019-10-13 20:05:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 20:05:08,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:08,730 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:05:08,730 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash -548845122, now seen corresponding path program 1 times [2019-10-13 20:05:08,731 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:08,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823641823] [2019-10-13 20:05:08,731 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:08,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:08,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:08,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823641823] [2019-10-13 20:05:08,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:08,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:05:08,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24746919] [2019-10-13 20:05:08,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:08,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:08,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:05:08,907 INFO L87 Difference]: Start difference. First operand 627 states and 934 transitions. Second operand 5 states. [2019-10-13 20:05:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:10,602 INFO L93 Difference]: Finished difference Result 1872 states and 2846 transitions. [2019-10-13 20:05:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 20:05:10,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-13 20:05:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:10,610 INFO L225 Difference]: With dead ends: 1872 [2019-10-13 20:05:10,611 INFO L226 Difference]: Without dead ends: 1251 [2019-10-13 20:05:10,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-13 20:05:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1032. [2019-10-13 20:05:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-13 20:05:10,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1433 transitions. [2019-10-13 20:05:10,655 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1433 transitions. Word has length 127 [2019-10-13 20:05:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:10,656 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1433 transitions. [2019-10-13 20:05:10,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1433 transitions. [2019-10-13 20:05:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-13 20:05:10,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:10,666 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-13 20:05:10,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:10,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1324114650, now seen corresponding path program 1 times [2019-10-13 20:05:10,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:10,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91032700] [2019-10-13 20:05:10,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:10,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:10,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:10,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91032700] [2019-10-13 20:05:10,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22124451] [2019-10-13 20:05:10,938 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-10-13 20:05:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:11,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:05:11,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:11,175 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:11,270 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:05:11,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-13 20:05:11,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374714827] [2019-10-13 20:05:11,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:05:11,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:11,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:05:11,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:05:11,274 INFO L87 Difference]: Start difference. First operand 1032 states and 1433 transitions. Second operand 3 states. [2019-10-13 20:05:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:12,370 INFO L93 Difference]: Finished difference Result 2662 states and 3820 transitions. [2019-10-13 20:05:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:05:12,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-13 20:05:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:12,380 INFO L225 Difference]: With dead ends: 2662 [2019-10-13 20:05:12,380 INFO L226 Difference]: Without dead ends: 1636 [2019-10-13 20:05:12,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:05:12,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-10-13 20:05:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1629. [2019-10-13 20:05:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-10-13 20:05:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2257 transitions. [2019-10-13 20:05:12,432 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2257 transitions. Word has length 172 [2019-10-13 20:05:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:12,433 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 2257 transitions. [2019-10-13 20:05:12,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:05:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2257 transitions. [2019-10-13 20:05:12,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-13 20:05:12,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:12,438 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:12,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:12,643 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:12,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1322201221, now seen corresponding path program 1 times [2019-10-13 20:05:12,645 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:12,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679905239] [2019-10-13 20:05:12,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:12,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:12,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 68 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:12,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679905239] [2019-10-13 20:05:12,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897961663] [2019-10-13 20:05:12,916 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-10-13 20:05:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:13,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 20:05:13,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 20:05:13,079 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 68 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:13,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:05:13,178 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-13 20:05:13,178 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466886009] [2019-10-13 20:05:13,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:13,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:13,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:13,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 20:05:13,180 INFO L87 Difference]: Start difference. First operand 1629 states and 2257 transitions. Second operand 5 states. [2019-10-13 20:05:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:14,664 INFO L93 Difference]: Finished difference Result 4500 states and 6394 transitions. [2019-10-13 20:05:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:05:14,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-10-13 20:05:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:14,685 INFO L225 Difference]: With dead ends: 4500 [2019-10-13 20:05:14,686 INFO L226 Difference]: Without dead ends: 2877 [2019-10-13 20:05:14,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:05:14,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2019-10-13 20:05:14,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2825. [2019-10-13 20:05:14,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-10-13 20:05:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3849 transitions. [2019-10-13 20:05:14,776 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3849 transitions. Word has length 196 [2019-10-13 20:05:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:14,777 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3849 transitions. [2019-10-13 20:05:14,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3849 transitions. [2019-10-13 20:05:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-13 20:05:14,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:14,782 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:14,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:14,994 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 951446006, now seen corresponding path program 1 times [2019-10-13 20:05:14,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:14,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571017040] [2019-10-13 20:05:14,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:14,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:14,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:15,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571017040] [2019-10-13 20:05:15,155 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649477087] [2019-10-13 20:05:15,155 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-10-13 20:05:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:15,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:05:15,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 20:05:15,323 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-13 20:05:15,383 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:05:15,383 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-13 20:05:15,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197513387] [2019-10-13 20:05:15,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:05:15,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:05:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:15,385 INFO L87 Difference]: Start difference. First operand 2825 states and 3849 transitions. Second operand 4 states. [2019-10-13 20:05:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:17,126 INFO L93 Difference]: Finished difference Result 8893 states and 12908 transitions. [2019-10-13 20:05:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:05:17,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-10-13 20:05:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:17,159 INFO L225 Difference]: With dead ends: 8893 [2019-10-13 20:05:17,160 INFO L226 Difference]: Without dead ends: 6262 [2019-10-13 20:05:17,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:17,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2019-10-13 20:05:17,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 6260. [2019-10-13 20:05:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2019-10-13 20:05:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 8575 transitions. [2019-10-13 20:05:17,332 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 8575 transitions. Word has length 197 [2019-10-13 20:05:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:17,333 INFO L462 AbstractCegarLoop]: Abstraction has 6260 states and 8575 transitions. [2019-10-13 20:05:17,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:05:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 8575 transitions. [2019-10-13 20:05:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-13 20:05:17,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:17,344 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:17,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:17,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:17,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:17,554 INFO L82 PathProgramCache]: Analyzing trace with hash -694803308, now seen corresponding path program 1 times [2019-10-13 20:05:17,554 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:17,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595797862] [2019-10-13 20:05:17,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:17,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:17,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-10-13 20:05:17,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595797862] [2019-10-13 20:05:17,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:05:17,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:05:17,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314968440] [2019-10-13 20:05:17,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:05:17,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:05:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:17,730 INFO L87 Difference]: Start difference. First operand 6260 states and 8575 transitions. Second operand 3 states. [2019-10-13 20:05:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:18,737 INFO L93 Difference]: Finished difference Result 13085 states and 18325 transitions. [2019-10-13 20:05:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:05:18,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-13 20:05:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:18,770 INFO L225 Difference]: With dead ends: 13085 [2019-10-13 20:05:18,770 INFO L226 Difference]: Without dead ends: 7019 [2019-10-13 20:05:18,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:05:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7019 states. [2019-10-13 20:05:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7019 to 7017. [2019-10-13 20:05:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7017 states. [2019-10-13 20:05:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7017 states to 7017 states and 9616 transitions. [2019-10-13 20:05:18,965 INFO L78 Accepts]: Start accepts. Automaton has 7017 states and 9616 transitions. Word has length 251 [2019-10-13 20:05:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:18,966 INFO L462 AbstractCegarLoop]: Abstraction has 7017 states and 9616 transitions. [2019-10-13 20:05:18,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:05:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7017 states and 9616 transitions. [2019-10-13 20:05:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-13 20:05:18,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:18,981 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:18,981 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:18,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:18,982 INFO L82 PathProgramCache]: Analyzing trace with hash -165869244, now seen corresponding path program 1 times [2019-10-13 20:05:18,982 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:18,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135914971] [2019-10-13 20:05:18,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:18,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:18,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:19,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135914971] [2019-10-13 20:05:19,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442993066] [2019-10-13 20:05:19,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:19,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 20:05:19,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 20:05:19,514 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-13 20:05:19,680 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:05:19,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-13 20:05:19,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010725217] [2019-10-13 20:05:19,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:05:19,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:19,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:05:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:19,685 INFO L87 Difference]: Start difference. First operand 7017 states and 9616 transitions. Second operand 4 states. [2019-10-13 20:05:21,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:21,704 INFO L93 Difference]: Finished difference Result 17286 states and 24236 transitions. [2019-10-13 20:05:21,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:05:21,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-10-13 20:05:21,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:21,775 INFO L225 Difference]: With dead ends: 17286 [2019-10-13 20:05:21,775 INFO L226 Difference]: Without dead ends: 10463 [2019-10-13 20:05:21,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:05:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10463 states. [2019-10-13 20:05:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10463 to 10244. [2019-10-13 20:05:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-10-13 20:05:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 13884 transitions. [2019-10-13 20:05:22,130 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 13884 transitions. Word has length 262 [2019-10-13 20:05:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:22,130 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 13884 transitions. [2019-10-13 20:05:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:05:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 13884 transitions. [2019-10-13 20:05:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-13 20:05:22,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:22,156 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:22,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:22,363 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:22,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash -909757423, now seen corresponding path program 1 times [2019-10-13 20:05:22,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:22,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931413825] [2019-10-13 20:05:22,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:22,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:22,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 144 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:22,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931413825] [2019-10-13 20:05:22,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133682586] [2019-10-13 20:05:22,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:22,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 20:05:22,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:22,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 20:05:22,933 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:23,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,296 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-10-13 20:05:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:05:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 68 proven. 105 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 20:05:23,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 20:05:23,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-10-13 20:05:23,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575766707] [2019-10-13 20:05:23,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:05:23,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:05:23,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:05:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-13 20:05:23,542 INFO L87 Difference]: Start difference. First operand 10244 states and 13884 transitions. Second operand 5 states. [2019-10-13 20:05:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:05:25,519 INFO L93 Difference]: Finished difference Result 20379 states and 27815 transitions. [2019-10-13 20:05:25,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:05:25,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 316 [2019-10-13 20:05:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:05:25,552 INFO L225 Difference]: With dead ends: 20379 [2019-10-13 20:05:25,552 INFO L226 Difference]: Without dead ends: 10329 [2019-10-13 20:05:25,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 20:05:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10329 states. [2019-10-13 20:05:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10329 to 9554. [2019-10-13 20:05:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-10-13 20:05:25,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 13049 transitions. [2019-10-13 20:05:25,786 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 13049 transitions. Word has length 316 [2019-10-13 20:05:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:05:25,786 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 13049 transitions. [2019-10-13 20:05:25,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:05:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 13049 transitions. [2019-10-13 20:05:25,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-13 20:05:25,808 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:05:25,808 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:05:26,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:26,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:05:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:05:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1210048352, now seen corresponding path program 1 times [2019-10-13 20:05:26,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:05:26,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133239052] [2019-10-13 20:05:26,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:26,014 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:05:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:05:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:26,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133239052] [2019-10-13 20:05:26,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603614603] [2019-10-13 20:05:26,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:05:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:05:26,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 20:05:27,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:05:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:28,085 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:05:28,230 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-10-13 20:05:28,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:05:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 182 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:05:28,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1344906349] [2019-10-13 20:05:28,930 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 324 [2019-10-13 20:05:28,981 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:05:28,981 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)