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/Problem02_label18.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:56:13,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:56:13,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:56:13,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:56:13,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:56:13,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:56:13,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:56:13,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:56:13,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:56:13,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:56:13,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:56:13,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:56:13,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:56:13,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:56:13,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:56:13,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:56:13,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:56:13,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:56:13,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:56:13,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:56:13,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:56:13,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:56:13,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:56:13,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:56:13,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:56:13,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:56:13,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:56:13,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:56:13,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:56:13,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:56:13,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:56:13,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:56:13,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:56:13,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:56:13,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:56:13,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:56:13,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:56:13,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:56:13,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:56:13,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:56:13,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:56:13,776 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-14 23:56:13,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:56:13,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:56:13,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:56:13,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:56:13,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:56:13,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:56:13,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:56:13,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:56:13,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:56:13,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:56:13,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:56:13,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:56:13,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:56:13,795 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:56:13,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:56:13,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:56:13,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:56:13,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:56:13,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:56:13,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:56:13,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:56:13,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:56:13,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:56:13,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:56:13,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:56:13,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:56:13,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:56:13,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:56:13,798 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-14 23:56:14,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:56:14,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:56:14,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:56:14,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:56:14,101 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:56:14,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label18.c [2019-10-14 23:56:14,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406aa4b6e/bcb78ebe380b4c3bb57d959ef3753507/FLAG055d8eab8 [2019-10-14 23:56:14,796 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:56:14,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label18.c [2019-10-14 23:56:14,811 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406aa4b6e/bcb78ebe380b4c3bb57d959ef3753507/FLAG055d8eab8 [2019-10-14 23:56:15,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406aa4b6e/bcb78ebe380b4c3bb57d959ef3753507 [2019-10-14 23:56:15,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:56:15,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:56:15,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:56:15,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:56:15,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:56:15,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641eaed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15, skipping insertion in model container [2019-10-14 23:56:15,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:56:15,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:56:15,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:56:15,708 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:56:15,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:56:15,831 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:56:15,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15 WrapperNode [2019-10-14 23:56:15,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:56:15,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:56:15,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:56:15,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:56:15,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (1/1) ... [2019-10-14 23:56:15,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:56:15,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:56:15,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:56:15,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:56:15,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (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-14 23:56:16,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:56:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:56:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:56:16,009 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:56:16,009 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:56:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:56:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:56:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:56:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:56:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:56:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:56:17,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:56:17,105 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:56:17,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:17 BoogieIcfgContainer [2019-10-14 23:56:17,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:56:17,108 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:56:17,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:56:17,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:56:17,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:56:15" (1/3) ... [2019-10-14 23:56:17,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177c8907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:17, skipping insertion in model container [2019-10-14 23:56:17,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:15" (2/3) ... [2019-10-14 23:56:17,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177c8907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:17, skipping insertion in model container [2019-10-14 23:56:17,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:17" (3/3) ... [2019-10-14 23:56:17,115 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label18.c [2019-10-14 23:56:17,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:56:17,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:56:17,145 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:56:17,175 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:56:17,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:56:17,176 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:56:17,176 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:56:17,176 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:56:17,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:56:17,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:56:17,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:56:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:56:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-14 23:56:17,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:17,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:56:17,221 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:17,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash -427743519, now seen corresponding path program 1 times [2019-10-14 23:56:17,236 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:17,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070528266] [2019-10-14 23:56:17,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:17,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:17,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:17,745 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-14 23:56:17,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070528266] [2019-10-14 23:56:17,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:17,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:56:17,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256401002] [2019-10-14 23:56:17,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:17,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:56:17,774 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:56:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:18,626 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:56:18,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:18,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-14 23:56:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:18,654 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:56:18,654 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:18,666 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-14 23:56:18,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:56:18,789 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 133 [2019-10-14 23:56:18,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:18,794 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:56:18,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:18,795 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:56:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-14 23:56:18,810 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:18,810 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:18,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:18,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -309931354, now seen corresponding path program 1 times [2019-10-14 23:56:18,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:18,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78652131] [2019-10-14 23:56:18,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:18,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:18,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:19,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78652131] [2019-10-14 23:56:19,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:19,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:19,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532559212] [2019-10-14 23:56:19,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:19,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:19,215 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:56:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:19,825 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:56:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:19,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-14 23:56:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:19,829 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:56:19,829 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:19,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:56:19,850 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 141 [2019-10-14 23:56:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:19,850 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:56:19,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:56:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-14 23:56:19,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:19,853 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:19,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 325171058, now seen corresponding path program 1 times [2019-10-14 23:56:19,854 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:19,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187319276] [2019-10-14 23:56:19,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:19,854 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:19,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:20,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187319276] [2019-10-14 23:56:20,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:20,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:20,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694065300] [2019-10-14 23:56:20,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:20,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:20,127 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:56:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:20,830 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:56:20,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:20,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-14 23:56:20,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:20,838 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:56:20,838 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:56:20,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:56:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:56:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:56:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:56:20,856 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 147 [2019-10-14 23:56:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:20,856 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:56:20,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:56:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:56:20,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:20,861 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:20,861 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:20,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:20,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1977398583, now seen corresponding path program 1 times [2019-10-14 23:56:20,862 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:20,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6002463] [2019-10-14 23:56:20,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:20,863 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:20,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:20,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6002463] [2019-10-14 23:56:20,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:20,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:20,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209589687] [2019-10-14 23:56:20,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:20,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:20,947 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:56:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:21,733 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:56:21,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:56:21,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-10-14 23:56:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:21,738 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:56:21,739 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:56:21,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:56:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:56:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:56:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-14 23:56:21,772 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 155 [2019-10-14 23:56:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:21,773 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-14 23:56:21,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-14 23:56:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:56:21,776 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:21,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:56:21,777 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash -282643699, now seen corresponding path program 1 times [2019-10-14 23:56:21,778 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:21,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885394052] [2019-10-14 23:56:21,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:21,778 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:21,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:22,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885394052] [2019-10-14 23:56:22,028 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:22,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:22,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041429205] [2019-10-14 23:56:22,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:22,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:22,030 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-14 23:56:22,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:22,695 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-14 23:56:22,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:22,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-14 23:56:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:22,700 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:56:22,700 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:56:22,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:56:22,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:56:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-14 23:56:22,722 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 157 [2019-10-14 23:56:22,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:22,723 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-14 23:56:22,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:22,723 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-14 23:56:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-14 23:56:22,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:22,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:56:22,727 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:22,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:22,727 INFO L82 PathProgramCache]: Analyzing trace with hash -440018095, now seen corresponding path program 1 times [2019-10-14 23:56:22,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:22,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114291465] [2019-10-14 23:56:22,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:22,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:22,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:22,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114291465] [2019-10-14 23:56:22,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:22,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:56:22,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40074041] [2019-10-14 23:56:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:56:22,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:56:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:22,916 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-14 23:56:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:23,511 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-14 23:56:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:56:23,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-14 23:56:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:23,515 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:56:23,515 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:56:23,517 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:56:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:56:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:56:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:56:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-14 23:56:23,577 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 159 [2019-10-14 23:56:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:23,577 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-14 23:56:23,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:56:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-14 23:56:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-14 23:56:23,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:23,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:56:23,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:23,591 INFO L82 PathProgramCache]: Analyzing trace with hash -988582951, now seen corresponding path program 1 times [2019-10-14 23:56:23,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:23,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879236950] [2019-10-14 23:56:23,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:23,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:23,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:23,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879236950] [2019-10-14 23:56:23,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:56:23,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:56:23,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244409918] [2019-10-14 23:56:23,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:56:23,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:23,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:56:23,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:56:23,684 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-14 23:56:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:24,499 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-14 23:56:24,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:56:24,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-14 23:56:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:24,508 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:56:24,509 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:56:24,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:56:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:56:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:56:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:56:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-14 23:56:24,558 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 163 [2019-10-14 23:56:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:24,559 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-14 23:56:24,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:56:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-14 23:56:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-14 23:56:24,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:24,564 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:56:24,564 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:24,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1094001216, now seen corresponding path program 1 times [2019-10-14 23:56:24,565 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:24,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814929642] [2019-10-14 23:56:24,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:24,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:24,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:24,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814929642] [2019-10-14 23:56:24,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376259860] [2019-10-14 23:56:24,995 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-14 23:56:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:25,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:56:25,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:56:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:25,280 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:56:25,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:25,367 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:56:25,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-14 23:56:25,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951308997] [2019-10-14 23:56:25,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:56:25,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:56:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:56:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:56:25,370 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 3 states. [2019-10-14 23:56:25,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:56:25,837 INFO L93 Difference]: Finished difference Result 2869 states and 3879 transitions. [2019-10-14 23:56:25,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:56:25,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-14 23:56:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:56:25,847 INFO L225 Difference]: With dead ends: 2869 [2019-10-14 23:56:25,847 INFO L226 Difference]: Without dead ends: 1657 [2019-10-14 23:56:25,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 336 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:56:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-10-14 23:56:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1654. [2019-10-14 23:56:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-10-14 23:56:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2171 transitions. [2019-10-14 23:56:25,903 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2171 transitions. Word has length 168 [2019-10-14 23:56:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:56:25,904 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 2171 transitions. [2019-10-14 23:56:25,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:56:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2171 transitions. [2019-10-14 23:56:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-14 23:56:25,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:56:25,944 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 23:56:26,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:56:26,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:56:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:56:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2028700589, now seen corresponding path program 1 times [2019-10-14 23:56:26,150 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:56:26,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428621630] [2019-10-14 23:56:26,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:26,150 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:56:26,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:56:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 123 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:56:26,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428621630] [2019-10-14 23:56:26,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885960693] [2019-10-14 23:56:26,389 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-14 23:56:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:56:26,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:56:26,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:56:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:26,598 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:56:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:56:26,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1207923798] [2019-10-14 23:56:26,779 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 246 [2019-10-14 23:56:26,826 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:56:26,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)