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-13a467a-m [2019-10-15 00:03:58,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:03:58,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:03:58,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:03:58,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:03:58,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:03:58,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:03:58,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:03:58,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:03:58,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:03:58,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:03:58,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:03:58,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:03:58,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:03:58,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:03:58,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:03:58,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:03:58,932 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:03:58,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:03:58,936 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:03:58,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:03:58,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:03:58,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:03:58,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:03:58,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:03:58,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:03:58,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:03:58,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:03:58,948 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:03:58,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:03:58,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:03:58,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:03:58,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:03:58,954 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:03:58,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:03:58,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:03:58,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:03:58,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:03:58,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:03:58,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:03:58,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:03:58,959 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-15 00:03:58,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:03:58,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:03:58,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:03:58,974 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:03:58,974 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:03:58,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:03:58,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:03:58,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:03:58,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:03:58,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:03:58,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:03:58,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:03:58,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:03:58,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:03:58,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:03:58,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:03:58,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:03:58,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:03:58,977 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:03:58,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:03:58,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:03:58,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:03:58,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:03:58,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:03:58,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:03:58,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:03:58,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:03:58,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:03:58,979 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-15 00:03:59,278 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:03:59,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:03:59,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:03:59,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:03:59,303 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:03:59,303 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-15 00:03:59,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2af4d479/290e5debce1a4cfca965f73136a1102e/FLAG0361410ca [2019-10-15 00:04:00,004 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:04:00,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label47.c [2019-10-15 00:04:00,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2af4d479/290e5debce1a4cfca965f73136a1102e/FLAG0361410ca [2019-10-15 00:04:00,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2af4d479/290e5debce1a4cfca965f73136a1102e [2019-10-15 00:04:00,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:04:00,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:04:00,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:04:00,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:04:00,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:04:00,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:04:00" (1/1) ... [2019-10-15 00:04:00,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2068c01a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:00, skipping insertion in model container [2019-10-15 00:04:00,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:04:00" (1/1) ... [2019-10-15 00:04:00,235 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:04:00,290 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:04:01,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:04:01,071 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:04:01,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:04:01,261 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:04:01,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01 WrapperNode [2019-10-15 00:04:01,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:04:01,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:04:01,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:04:01,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:04:01,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (1/1) ... [2019-10-15 00:04:01,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:04:01,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:04:01,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:04:01,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:04:01,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (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-15 00:04:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:04:01,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:04:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:04:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:04:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:04:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:04:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:04:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:04:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:04:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:04:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:04:03,093 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:04:03,093 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:04:03,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:04:03 BoogieIcfgContainer [2019-10-15 00:04:03,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:04:03,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:04:03,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:04:03,101 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:04:03,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:04:00" (1/3) ... [2019-10-15 00:04:03,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e79789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:04:03, skipping insertion in model container [2019-10-15 00:04:03,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:04:01" (2/3) ... [2019-10-15 00:04:03,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e79789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:04:03, skipping insertion in model container [2019-10-15 00:04:03,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:04:03" (3/3) ... [2019-10-15 00:04:03,105 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2019-10-15 00:04:03,115 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:04:03,124 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:04:03,136 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:04:03,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:04:03,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:04:03,166 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:04:03,166 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:04:03,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:04:03,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:04:03,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:04:03,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:04:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-15 00:04:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 00:04:03,202 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:03,203 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-15 00:04:03,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:03,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1102823458, now seen corresponding path program 1 times [2019-10-15 00:04:03,221 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:03,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270898337] [2019-10-15 00:04:03,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:03,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:03,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:03,583 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-15 00:04:03,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270898337] [2019-10-15 00:04:03,584 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:03,585 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:04:03,585 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817601799] [2019-10-15 00:04:03,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:03,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:03,608 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-10-15 00:04:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:04,942 INFO L93 Difference]: Finished difference Result 787 states and 1379 transitions. [2019-10-15 00:04:04,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:04,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 00:04:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:04,961 INFO L225 Difference]: With dead ends: 787 [2019-10-15 00:04:04,961 INFO L226 Difference]: Without dead ends: 433 [2019-10-15 00:04:04,970 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-15 00:04:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-10-15 00:04:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 426. [2019-10-15 00:04:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-10-15 00:04:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 678 transitions. [2019-10-15 00:04:05,057 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 678 transitions. Word has length 41 [2019-10-15 00:04:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:05,057 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 678 transitions. [2019-10-15 00:04:05,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 678 transitions. [2019-10-15 00:04:05,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 00:04:05,065 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:05,065 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-15 00:04:05,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:05,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash -659313835, now seen corresponding path program 1 times [2019-10-15 00:04:05,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:05,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035313436] [2019-10-15 00:04:05,067 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:05,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:05,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:05,320 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-15 00:04:05,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035313436] [2019-10-15 00:04:05,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:05,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:04:05,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410618123] [2019-10-15 00:04:05,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:05,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:05,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:04:05,325 INFO L87 Difference]: Start difference. First operand 426 states and 678 transitions. Second operand 5 states. [2019-10-15 00:04:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:06,931 INFO L93 Difference]: Finished difference Result 1259 states and 2034 transitions. [2019-10-15 00:04:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:04:06,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-15 00:04:06,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:06,942 INFO L225 Difference]: With dead ends: 1259 [2019-10-15 00:04:06,942 INFO L226 Difference]: Without dead ends: 839 [2019-10-15 00:04:06,945 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-15 00:04:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-15 00:04:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 627. [2019-10-15 00:04:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-15 00:04:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 934 transitions. [2019-10-15 00:04:07,022 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 934 transitions. Word has length 116 [2019-10-15 00:04:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:07,024 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 934 transitions. [2019-10-15 00:04:07,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:07,025 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 934 transitions. [2019-10-15 00:04:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 00:04:07,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:07,037 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-15 00:04:07,037 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash -548845122, now seen corresponding path program 1 times [2019-10-15 00:04:07,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:07,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334010328] [2019-10-15 00:04:07,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:07,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:07,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:07,255 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-15 00:04:07,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334010328] [2019-10-15 00:04:07,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:07,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:04:07,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074549778] [2019-10-15 00:04:07,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:07,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:07,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:07,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:04:07,258 INFO L87 Difference]: Start difference. First operand 627 states and 934 transitions. Second operand 5 states. [2019-10-15 00:04:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:09,021 INFO L93 Difference]: Finished difference Result 1872 states and 2846 transitions. [2019-10-15 00:04:09,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 00:04:09,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-15 00:04:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:09,030 INFO L225 Difference]: With dead ends: 1872 [2019-10-15 00:04:09,031 INFO L226 Difference]: Without dead ends: 1251 [2019-10-15 00:04:09,033 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-15 00:04:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-10-15 00:04:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1032. [2019-10-15 00:04:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-15 00:04:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1433 transitions. [2019-10-15 00:04:09,069 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1433 transitions. Word has length 127 [2019-10-15 00:04:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:09,070 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1433 transitions. [2019-10-15 00:04:09,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1433 transitions. [2019-10-15 00:04:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-15 00:04:09,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:09,072 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-15 00:04:09,072 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:09,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:09,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1324114650, now seen corresponding path program 1 times [2019-10-15 00:04:09,073 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:09,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654516436] [2019-10-15 00:04:09,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:09,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:09,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:09,318 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-15 00:04:09,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654516436] [2019-10-15 00:04:09,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912844219] [2019-10-15 00:04:09,319 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-15 00:04:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:09,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 00:04:09,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:09,533 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-15 00:04:09,534 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:09,666 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-15 00:04:09,667 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:04:09,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 9 [2019-10-15 00:04:09,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865442741] [2019-10-15 00:04:09,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:09,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:09,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:09,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:04:09,670 INFO L87 Difference]: Start difference. First operand 1032 states and 1433 transitions. Second operand 3 states. [2019-10-15 00:04:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:10,777 INFO L93 Difference]: Finished difference Result 2662 states and 3820 transitions. [2019-10-15 00:04:10,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:10,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-15 00:04:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:10,786 INFO L225 Difference]: With dead ends: 2662 [2019-10-15 00:04:10,786 INFO L226 Difference]: Without dead ends: 1636 [2019-10-15 00:04:10,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 00:04:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-10-15 00:04:10,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1629. [2019-10-15 00:04:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-10-15 00:04:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2257 transitions. [2019-10-15 00:04:10,845 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2257 transitions. Word has length 172 [2019-10-15 00:04:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:10,847 INFO L462 AbstractCegarLoop]: Abstraction has 1629 states and 2257 transitions. [2019-10-15 00:04:10,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2257 transitions. [2019-10-15 00:04:10,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-15 00:04:10,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:10,853 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-15 00:04:11,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:11,067 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1322201221, now seen corresponding path program 1 times [2019-10-15 00:04:11,067 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:11,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887287574] [2019-10-15 00:04:11,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:11,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:11,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:11,308 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-15 00:04:11,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887287574] [2019-10-15 00:04:11,309 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964730180] [2019-10-15 00:04:11,309 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-15 00:04:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:11,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 00:04:11,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:11,482 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-15 00:04:11,483 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:11,571 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-15 00:04:11,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:11,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2019-10-15 00:04:11,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954782258] [2019-10-15 00:04:11,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:11,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:11,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:11,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-15 00:04:11,574 INFO L87 Difference]: Start difference. First operand 1629 states and 2257 transitions. Second operand 5 states. [2019-10-15 00:04:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:13,040 INFO L93 Difference]: Finished difference Result 4500 states and 6394 transitions. [2019-10-15 00:04:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:04:13,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 196 [2019-10-15 00:04:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:13,057 INFO L225 Difference]: With dead ends: 4500 [2019-10-15 00:04:13,058 INFO L226 Difference]: Without dead ends: 2877 [2019-10-15 00:04:13,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-15 00:04:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2019-10-15 00:04:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2825. [2019-10-15 00:04:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2825 states. [2019-10-15 00:04:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3849 transitions. [2019-10-15 00:04:13,141 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 3849 transitions. Word has length 196 [2019-10-15 00:04:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:13,142 INFO L462 AbstractCegarLoop]: Abstraction has 2825 states and 3849 transitions. [2019-10-15 00:04:13,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 3849 transitions. [2019-10-15 00:04:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-15 00:04:13,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:13,146 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-15 00:04:13,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:13,351 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 951446006, now seen corresponding path program 1 times [2019-10-15 00:04:13,352 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:13,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569743577] [2019-10-15 00:04:13,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:13,353 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:13,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:13,502 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-15 00:04:13,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569743577] [2019-10-15 00:04:13,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099880001] [2019-10-15 00:04:13,503 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-15 00:04:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:13,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 00:04:13,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:13,677 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-15 00:04:13,677 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:13,730 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-15 00:04:13,731 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:04:13,739 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-15 00:04:13,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466514136] [2019-10-15 00:04:13,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:04:13,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:13,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:04:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-15 00:04:13,743 INFO L87 Difference]: Start difference. First operand 2825 states and 3849 transitions. Second operand 4 states. [2019-10-15 00:04:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:15,323 INFO L93 Difference]: Finished difference Result 8893 states and 12908 transitions. [2019-10-15 00:04:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:15,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-10-15 00:04:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:15,358 INFO L225 Difference]: With dead ends: 8893 [2019-10-15 00:04:15,358 INFO L226 Difference]: Without dead ends: 6262 [2019-10-15 00:04:15,367 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-15 00:04:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6262 states. [2019-10-15 00:04:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6262 to 6260. [2019-10-15 00:04:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6260 states. [2019-10-15 00:04:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6260 states to 6260 states and 8575 transitions. [2019-10-15 00:04:15,546 INFO L78 Accepts]: Start accepts. Automaton has 6260 states and 8575 transitions. Word has length 197 [2019-10-15 00:04:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:15,547 INFO L462 AbstractCegarLoop]: Abstraction has 6260 states and 8575 transitions. [2019-10-15 00:04:15,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 6260 states and 8575 transitions. [2019-10-15 00:04:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-15 00:04:15,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:15,557 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-15 00:04:15,763 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:15,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:15,764 INFO L82 PathProgramCache]: Analyzing trace with hash -694803308, now seen corresponding path program 1 times [2019-10-15 00:04:15,764 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:15,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391359814] [2019-10-15 00:04:15,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:15,764 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:15,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:15,933 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-15 00:04:15,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391359814] [2019-10-15 00:04:15,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:04:15,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 00:04:15,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976667086] [2019-10-15 00:04:15,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 00:04:15,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 00:04:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 00:04:15,936 INFO L87 Difference]: Start difference. First operand 6260 states and 8575 transitions. Second operand 3 states. [2019-10-15 00:04:16,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:16,961 INFO L93 Difference]: Finished difference Result 13085 states and 18325 transitions. [2019-10-15 00:04:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 00:04:16,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-15 00:04:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:16,993 INFO L225 Difference]: With dead ends: 13085 [2019-10-15 00:04:16,994 INFO L226 Difference]: Without dead ends: 7019 [2019-10-15 00:04:17,009 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-15 00:04:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7019 states. [2019-10-15 00:04:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7019 to 7017. [2019-10-15 00:04:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7017 states. [2019-10-15 00:04:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7017 states to 7017 states and 9616 transitions. [2019-10-15 00:04:17,177 INFO L78 Accepts]: Start accepts. Automaton has 7017 states and 9616 transitions. Word has length 251 [2019-10-15 00:04:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:17,178 INFO L462 AbstractCegarLoop]: Abstraction has 7017 states and 9616 transitions. [2019-10-15 00:04:17,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 00:04:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7017 states and 9616 transitions. [2019-10-15 00:04:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-15 00:04:17,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:17,190 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-15 00:04:17,190 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:17,191 INFO L82 PathProgramCache]: Analyzing trace with hash -165869244, now seen corresponding path program 1 times [2019-10-15 00:04:17,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:17,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796463072] [2019-10-15 00:04:17,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:17,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:17,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:17,451 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-15 00:04:17,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796463072] [2019-10-15 00:04:17,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950642138] [2019-10-15 00:04:17,452 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-15 00:04:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:17,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 00:04:17,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:17,643 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-15 00:04:17,644 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:17,779 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-15 00:04:17,779 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:04:17,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-15 00:04:17,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804615247] [2019-10-15 00:04:17,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:04:17,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:17,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:04:17,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 00:04:17,782 INFO L87 Difference]: Start difference. First operand 7017 states and 9616 transitions. Second operand 4 states. [2019-10-15 00:04:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:19,526 INFO L93 Difference]: Finished difference Result 17286 states and 24236 transitions. [2019-10-15 00:04:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:04:19,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-10-15 00:04:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:19,571 INFO L225 Difference]: With dead ends: 17286 [2019-10-15 00:04:19,571 INFO L226 Difference]: Without dead ends: 10463 [2019-10-15 00:04:19,590 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-15 00:04:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10463 states. [2019-10-15 00:04:19,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10463 to 10244. [2019-10-15 00:04:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-10-15 00:04:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 13884 transitions. [2019-10-15 00:04:19,910 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 13884 transitions. Word has length 262 [2019-10-15 00:04:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:19,911 INFO L462 AbstractCegarLoop]: Abstraction has 10244 states and 13884 transitions. [2019-10-15 00:04:19,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:04:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 13884 transitions. [2019-10-15 00:04:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-15 00:04:19,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:19,941 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-15 00:04:20,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:20,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:20,154 INFO L82 PathProgramCache]: Analyzing trace with hash -909757423, now seen corresponding path program 1 times [2019-10-15 00:04:20,154 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:20,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550924622] [2019-10-15 00:04:20,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:20,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:20,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:20,427 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-15 00:04:20,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550924622] [2019-10-15 00:04:20,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473402915] [2019-10-15 00:04:20,428 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-15 00:04:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:20,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 00:04:20,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:20,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:20,710 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-15 00:04:20,711 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:20,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:20,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:20,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:20,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:21,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 00:04:21,319 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-15 00:04:21,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 00:04:21,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 5] total 12 [2019-10-15 00:04:21,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203287526] [2019-10-15 00:04:21,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:04:21,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:04:21,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:04:21,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-10-15 00:04:21,322 INFO L87 Difference]: Start difference. First operand 10244 states and 13884 transitions. Second operand 5 states. [2019-10-15 00:04:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:04:22,806 INFO L93 Difference]: Finished difference Result 20379 states and 27815 transitions. [2019-10-15 00:04:22,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:04:22,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 316 [2019-10-15 00:04:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:04:22,844 INFO L225 Difference]: With dead ends: 20379 [2019-10-15 00:04:22,844 INFO L226 Difference]: Without dead ends: 10329 [2019-10-15 00:04:22,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-15 00:04:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10329 states. [2019-10-15 00:04:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10329 to 9554. [2019-10-15 00:04:23,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-10-15 00:04:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 13049 transitions. [2019-10-15 00:04:23,073 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 13049 transitions. Word has length 316 [2019-10-15 00:04:23,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:04:23,074 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 13049 transitions. [2019-10-15 00:04:23,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:04:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 13049 transitions. [2019-10-15 00:04:23,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-15 00:04:23,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:04:23,092 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-15 00:04:23,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:04:23,296 INFO L410 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:04:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:04:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1210048352, now seen corresponding path program 1 times [2019-10-15 00:04:23,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:04:23,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360109931] [2019-10-15 00:04:23,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:23,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:04:23,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:04:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:24,151 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-15 00:04:24,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360109931] [2019-10-15 00:04:24,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968939323] [2019-10-15 00:04:24,152 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-15 00:04:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:04:24,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-15 00:04:24,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:04:24,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:24,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:25,443 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-15 00:04:25,444 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:04:25,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:25,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:25,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:25,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:25,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 00:04:26,210 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-15 00:04:26,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [289953901] [2019-10-15 00:04:26,217 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 324 [2019-10-15 00:04:26,275 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 00:04:26,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)