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_label53.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:57:50,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:57:50,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:57:50,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:57:50,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:57:50,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:57:50,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:57:50,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:57:50,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:57:50,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:57:50,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:57:50,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:57:50,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:57:50,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:57:50,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:57:50,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:57:50,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:57:50,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:57:50,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:57:50,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:57:50,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:57:50,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:57:50,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:57:50,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:57:50,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:57:50,672 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:57:50,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:57:50,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:57:50,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:57:50,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:57:50,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:57:50,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:57:50,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:57:50,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:57:50,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:57:50,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:57:50,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:57:50,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:57:50,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:57:50,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:57:50,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:57:50,684 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:57:50,711 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:57:50,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:57:50,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:57:50,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:57:50,713 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:57:50,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:57:50,714 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:57:50,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:57:50,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:57:50,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:57:50,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:57:50,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:57:50,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:57:50,715 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:57:50,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:57:50,715 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:57:50,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:57:50,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:57:50,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:57:50,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:57:50,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:57:50,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:57:50,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:57:50,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:57:50,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:57:50,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:57:50,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:57:50,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:57:50,718 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:57:50,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:57:51,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:57:51,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:57:51,023 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:57:51,023 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:57:51,024 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-10-14 23:57:51,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7fc3e4/577098b9387f4ee89e87b33dc5e4c8eb/FLAGd9413197d [2019-10-14 23:57:51,684 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:57:51,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label53.c [2019-10-14 23:57:51,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7fc3e4/577098b9387f4ee89e87b33dc5e4c8eb/FLAGd9413197d [2019-10-14 23:57:51,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c7fc3e4/577098b9387f4ee89e87b33dc5e4c8eb [2019-10-14 23:57:51,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:57:51,964 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:57:51,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:51,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:57:51,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:57:51,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:51" (1/1) ... [2019-10-14 23:57:51,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24303b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:51, skipping insertion in model container [2019-10-14 23:57:51,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:51" (1/1) ... [2019-10-14 23:57:51,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:57:52,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:57:52,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:52,567 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:57:52,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:57:52,699 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:57:52,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52 WrapperNode [2019-10-14 23:57:52,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:57:52,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:57:52,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:57:52,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:57:52,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (1/1) ... [2019-10-14 23:57:52,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:57:52,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:57:52,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:57:52,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:57:52,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (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:57:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:57:52,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:57:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-14 23:57:52,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:57:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-14 23:57:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:57:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:57:52,875 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:57:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:57:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:57:52,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:57:53,958 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:57:53,958 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:57:53,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:53 BoogieIcfgContainer [2019-10-14 23:57:53,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:57:53,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:57:53,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:57:53,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:57:53,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:57:51" (1/3) ... [2019-10-14 23:57:53,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:53, skipping insertion in model container [2019-10-14 23:57:53,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:52" (2/3) ... [2019-10-14 23:57:53,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b5a219b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:53, skipping insertion in model container [2019-10-14 23:57:53,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:53" (3/3) ... [2019-10-14 23:57:53,969 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label53.c [2019-10-14 23:57:53,978 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:57:53,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:57:53,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:57:54,026 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:57:54,027 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:57:54,027 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:57:54,027 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:57:54,027 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:57:54,028 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:57:54,028 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:57:54,028 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:57:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-14 23:57:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-14 23:57:54,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:54,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:54,070 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:54,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1422395146, now seen corresponding path program 1 times [2019-10-14 23:57:54,086 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:54,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194831331] [2019-10-14 23:57:54,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:54,087 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:54,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:54,619 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:57:54,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194831331] [2019-10-14 23:57:54,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:54,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:57:54,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444657836] [2019-10-14 23:57:54,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:57:54,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:57:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:57:54,652 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-14 23:57:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:55,590 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-14 23:57:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:57:55,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-10-14 23:57:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:55,626 INFO L225 Difference]: With dead ends: 618 [2019-10-14 23:57:55,627 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:55,640 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:57:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-14 23:57:55,746 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 144 [2019-10-14 23:57:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:55,747 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-14 23:57:55,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:57:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-14 23:57:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-14 23:57:55,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:55,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:55,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash 339587089, now seen corresponding path program 1 times [2019-10-14 23:57:55,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:55,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268487773] [2019-10-14 23:57:55,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:55,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:55,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:56,119 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:57:56,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268487773] [2019-10-14 23:57:56,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:56,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:56,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945417984] [2019-10-14 23:57:56,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:56,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:56,124 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-14 23:57:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:56,933 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-14 23:57:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:56,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-14 23:57:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:56,943 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:57:56,944 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:56,946 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:57:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:56,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-14 23:57:56,968 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 152 [2019-10-14 23:57:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:56,968 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-14 23:57:56,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-14 23:57:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-14 23:57:56,971 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:56,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:56,972 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash -84143163, now seen corresponding path program 1 times [2019-10-14 23:57:56,973 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:56,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552323655] [2019-10-14 23:57:56,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:56,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:57,294 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:57:57,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552323655] [2019-10-14 23:57:57,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:57,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:57,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076439425] [2019-10-14 23:57:57,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:57,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:57,298 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-14 23:57:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:58,042 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-14 23:57:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:58,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-14 23:57:58,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:58,046 INFO L225 Difference]: With dead ends: 717 [2019-10-14 23:57:58,046 INFO L226 Difference]: Without dead ends: 320 [2019-10-14 23:57:58,048 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:57:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-14 23:57:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-14 23:57:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-14 23:57:58,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-14 23:57:58,066 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 158 [2019-10-14 23:57:58,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:58,067 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-14 23:57:58,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:58,067 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-14 23:57:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-14 23:57:58,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:58,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:58,070 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 284152846, now seen corresponding path program 1 times [2019-10-14 23:57:58,070 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:58,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339424461] [2019-10-14 23:57:58,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,071 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:58,168 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:57:58,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339424461] [2019-10-14 23:57:58,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:58,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:57:58,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788999691] [2019-10-14 23:57:58,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:57:58,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:57:58,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:57:58,171 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-14 23:57:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:58,902 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-14 23:57:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:57:58,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-14 23:57:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:58,907 INFO L225 Difference]: With dead ends: 951 [2019-10-14 23:57:58,908 INFO L226 Difference]: Without dead ends: 637 [2019-10-14 23:57:58,909 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:57:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-14 23:57:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-14 23:57:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-14 23:57:58,940 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 166 [2019-10-14 23:57:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:58,940 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-14 23:57:58,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:57:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-14 23:57:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-14 23:57:58,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:58,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:58,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2061838006, now seen corresponding path program 1 times [2019-10-14 23:57:58,947 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:58,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408552561] [2019-10-14 23:57:58,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:58,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:57:59,224 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:57:59,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408552561] [2019-10-14 23:57:59,226 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:57:59,226 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:57:59,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572416067] [2019-10-14 23:57:59,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:57:59,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:57:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:57:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:57:59,229 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-14 23:57:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:57:59,866 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-14 23:57:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:57:59,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-14 23:57:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:57:59,871 INFO L225 Difference]: With dead ends: 1330 [2019-10-14 23:57:59,871 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:57:59,873 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:57:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:57:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:57:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:57:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-14 23:57:59,894 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 168 [2019-10-14 23:57:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:57:59,894 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-14 23:57:59,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:57:59,894 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-14 23:57:59,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-14 23:57:59,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:57:59,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:57:59,898 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:57:59,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:57:59,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2138250886, now seen corresponding path program 1 times [2019-10-14 23:57:59,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:57:59,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022058470] [2019-10-14 23:57:59,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:59,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:57:59,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:57:59,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:00,103 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:58:00,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022058470] [2019-10-14 23:58:00,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:58:00,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:58:00,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639279489] [2019-10-14 23:58:00,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:58:00,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:58:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:58:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:58:00,106 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-14 23:58:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:58:00,781 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-14 23:58:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:58:00,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-14 23:58:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:58:00,787 INFO L225 Difference]: With dead ends: 1332 [2019-10-14 23:58:00,787 INFO L226 Difference]: Without dead ends: 626 [2019-10-14 23:58:00,789 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:58:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-14 23:58:00,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-14 23:58:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-14 23:58:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-14 23:58:00,809 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 170 [2019-10-14 23:58:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:58:00,809 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-14 23:58:00,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:58:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-14 23:58:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-14 23:58:00,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:58:00,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:58:00,813 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:58:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:58:00,814 INFO L82 PathProgramCache]: Analyzing trace with hash 23816446, now seen corresponding path program 1 times [2019-10-14 23:58:00,814 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:58:00,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801619404] [2019-10-14 23:58:00,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:00,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:00,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:58:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:00,902 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:58:00,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801619404] [2019-10-14 23:58:00,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:58:00,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:58:00,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535866263] [2019-10-14 23:58:00,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:58:00,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:58:00,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:58:00,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:58:00,905 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-14 23:58:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:58:01,727 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-14 23:58:01,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:58:01,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-10-14 23:58:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:58:01,736 INFO L225 Difference]: With dead ends: 1858 [2019-10-14 23:58:01,736 INFO L226 Difference]: Without dead ends: 1238 [2019-10-14 23:58:01,738 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:58:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-14 23:58:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-14 23:58:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-14 23:58:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1634 transitions. [2019-10-14 23:58:01,781 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1634 transitions. Word has length 174 [2019-10-14 23:58:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:58:01,781 INFO L462 AbstractCegarLoop]: Abstraction has 1218 states and 1634 transitions. [2019-10-14 23:58:01,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:58:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1634 transitions. [2019-10-14 23:58:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-14 23:58:01,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:58:01,789 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, 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] [2019-10-14 23:58:01,790 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:58:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:58:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash 141476734, now seen corresponding path program 1 times [2019-10-14 23:58:01,791 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:58:01,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915579733] [2019-10-14 23:58:01,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:01,791 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:01,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:58:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:58:01,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915579733] [2019-10-14 23:58:01,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427440537] [2019-10-14 23:58:01,915 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:58:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:02,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:58:02,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:58:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:58:02,185 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:58:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-14 23:58:02,322 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:58:02,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-14 23:58:02,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745191055] [2019-10-14 23:58:02,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:58:02,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:58:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:58:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:02,326 INFO L87 Difference]: Start difference. First operand 1218 states and 1634 transitions. Second operand 3 states. [2019-10-14 23:58:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:58:02,826 INFO L93 Difference]: Finished difference Result 3012 states and 4061 transitions. [2019-10-14 23:58:02,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:58:02,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-14 23:58:02,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:58:02,837 INFO L225 Difference]: With dead ends: 3012 [2019-10-14 23:58:02,838 INFO L226 Difference]: Without dead ends: 1060 [2019-10-14 23:58:02,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 414 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:58:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-14 23:58:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2019-10-14 23:58:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-10-14 23:58:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1378 transitions. [2019-10-14 23:58:02,887 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1378 transitions. Word has length 208 [2019-10-14 23:58:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:58:02,887 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 1378 transitions. [2019-10-14 23:58:02,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:58:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1378 transitions. [2019-10-14 23:58:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-14 23:58:02,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:58:02,893 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:03,103 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:58:03,104 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:58:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:58:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1442717386, now seen corresponding path program 1 times [2019-10-14 23:58:03,104 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:58:03,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908054716] [2019-10-14 23:58:03,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:03,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:58:03,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:58:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 104 proven. 33 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-14 23:58:03,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908054716] [2019-10-14 23:58:03,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529223249] [2019-10-14 23:58:03,264 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:58:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:58:03,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:58:03,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:58:03,595 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 136 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:03,596 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:58:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 136 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:58:03,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1976900226] [2019-10-14 23:58:03,767 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 245 [2019-10-14 23:58:03,857 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:58:03,857 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)