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/Problem16_label35.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:09:52,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:09:52,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:09:52,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:09:52,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:09:52,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:09:52,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:09:52,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:09:52,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:09:52,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:09:52,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:09:52,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:09:52,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:09:52,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:09:52,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:09:52,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:09:52,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:09:52,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:09:52,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:09:52,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:09:52,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:09:52,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:09:52,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:09:52,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:09:52,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:09:52,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:09:52,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:09:52,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:09:52,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:09:52,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:09:52,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:09:52,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:09:52,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:09:52,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:09:52,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:09:52,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:09:52,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:09:52,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:09:52,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:09:52,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:09:52,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:09:52,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:09:52,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:09:52,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:09:52,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:09:52,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:09:52,271 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:09:52,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:09:52,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:09:52,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:09:52,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:09:52,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:09:52,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:09:52,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:09:52,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:09:52,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:09:52,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:09:52,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:09:52,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:09:52,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:09:52,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:09:52,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:09:52,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:09:52,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:09:52,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:09:52,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:09:52,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:09:52,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:09:52,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:09:52,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:09:52,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:09:52,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:09:52,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:09:52,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:09:52,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:09:52,647 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:09:52,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label35.c [2019-10-13 20:09:52,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff40afec/659d9fa626074fa8864466db90710e4b/FLAG5446e88c2 [2019-10-13 20:09:53,405 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:09:53,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label35.c [2019-10-13 20:09:53,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff40afec/659d9fa626074fa8864466db90710e4b/FLAG5446e88c2 [2019-10-13 20:09:53,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff40afec/659d9fa626074fa8864466db90710e4b [2019-10-13 20:09:53,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:09:53,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:09:53,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:09:53,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:09:53,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:09:53,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:53" (1/1) ... [2019-10-13 20:09:53,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4f7f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:53, skipping insertion in model container [2019-10-13 20:09:53,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:53" (1/1) ... [2019-10-13 20:09:53,587 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:09:53,670 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:09:54,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:09:54,441 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:09:54,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:09:54,800 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:09:54,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54 WrapperNode [2019-10-13 20:09:54,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:09:54,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:09:54,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:09:54,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:09:54,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:54,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:54,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:54,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:54,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:54,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:55,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... [2019-10-13 20:09:55,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:09:55,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:09:55,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:09:55,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:09:55,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:09:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:09:55,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:09:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-13 20:09:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-13 20:09:55,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:09:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-13 20:09:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-13 20:09:55,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:09:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:09:55,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:09:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:09:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:09:55,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:09:57,723 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:09:57,724 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 20:09:57,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:57 BoogieIcfgContainer [2019-10-13 20:09:57,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:09:57,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:09:57,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:09:57,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:09:57,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:09:53" (1/3) ... [2019-10-13 20:09:57,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf2f4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:57, skipping insertion in model container [2019-10-13 20:09:57,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:54" (2/3) ... [2019-10-13 20:09:57,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bf2f4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:57, skipping insertion in model container [2019-10-13 20:09:57,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:57" (3/3) ... [2019-10-13 20:09:57,747 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label35.c [2019-10-13 20:09:57,758 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:09:57,771 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 20:09:57,783 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 20:09:57,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:09:57,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:09:57,833 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:09:57,833 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:09:57,833 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:09:57,833 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:09:57,833 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:09:57,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:09:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-13 20:09:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 20:09:57,884 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:09:57,885 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] [2019-10-13 20:09:57,887 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:09:57,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:09:57,895 INFO L82 PathProgramCache]: Analyzing trace with hash 338381554, now seen corresponding path program 1 times [2019-10-13 20:09:57,905 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:09:57,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004648724] [2019-10-13 20:09:57,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:09:57,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:09:57,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:09:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:09:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:09:58,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004648724] [2019-10-13 20:09:58,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:09:58,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:09:58,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78837649] [2019-10-13 20:09:58,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:09:58,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:09:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:09:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:09:58,382 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-10-13 20:10:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:03,313 INFO L93 Difference]: Finished difference Result 1509 states and 2834 transitions. [2019-10-13 20:10:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:10:03,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-13 20:10:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:03,342 INFO L225 Difference]: With dead ends: 1509 [2019-10-13 20:10:03,342 INFO L226 Difference]: Without dead ends: 1019 [2019-10-13 20:10:03,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:10:03,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-13 20:10:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 682. [2019-10-13 20:10:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-13 20:10:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1190 transitions. [2019-10-13 20:10:03,464 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1190 transitions. Word has length 47 [2019-10-13 20:10:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:03,465 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1190 transitions. [2019-10-13 20:10:03,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:10:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1190 transitions. [2019-10-13 20:10:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 20:10:03,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:03,471 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:10:03,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash -8457825, now seen corresponding path program 1 times [2019-10-13 20:10:03,472 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:03,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109643994] [2019-10-13 20:10:03,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:03,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:03,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:03,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109643994] [2019-10-13 20:10:03,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:10:03,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:10:03,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602117220] [2019-10-13 20:10:03,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:10:03,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:03,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:10:03,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:10:03,711 INFO L87 Difference]: Start difference. First operand 682 states and 1190 transitions. Second operand 5 states. [2019-10-13 20:10:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:07,286 INFO L93 Difference]: Finished difference Result 2068 states and 3645 transitions. [2019-10-13 20:10:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:10:07,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-13 20:10:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:07,308 INFO L225 Difference]: With dead ends: 2068 [2019-10-13 20:10:07,308 INFO L226 Difference]: Without dead ends: 1392 [2019-10-13 20:10:07,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:10:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-10-13 20:10:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1374. [2019-10-13 20:10:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-10-13 20:10:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2277 transitions. [2019-10-13 20:10:07,402 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2277 transitions. Word has length 116 [2019-10-13 20:10:07,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:07,404 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2277 transitions. [2019-10-13 20:10:07,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:10:07,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2277 transitions. [2019-10-13 20:10:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 20:10:07,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:07,419 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:10:07,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:07,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1750756938, now seen corresponding path program 1 times [2019-10-13 20:10:07,421 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:07,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448212714] [2019-10-13 20:10:07,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:07,423 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:07,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:07,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448212714] [2019-10-13 20:10:07,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:10:07,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:10:07,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373281422] [2019-10-13 20:10:07,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:10:07,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:10:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:07,645 INFO L87 Difference]: Start difference. First operand 1374 states and 2277 transitions. Second operand 6 states. [2019-10-13 20:10:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:11,050 INFO L93 Difference]: Finished difference Result 3463 states and 5746 transitions. [2019-10-13 20:10:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:10:11,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 20:10:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:11,064 INFO L225 Difference]: With dead ends: 3463 [2019-10-13 20:10:11,064 INFO L226 Difference]: Without dead ends: 2095 [2019-10-13 20:10:11,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:10:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2019-10-13 20:10:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2077. [2019-10-13 20:10:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-10-13 20:10:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3299 transitions. [2019-10-13 20:10:11,144 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3299 transitions. Word has length 119 [2019-10-13 20:10:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:11,145 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 3299 transitions. [2019-10-13 20:10:11,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:10:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3299 transitions. [2019-10-13 20:10:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 20:10:11,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:11,147 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:10:11,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:11,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:11,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1833499239, now seen corresponding path program 1 times [2019-10-13 20:10:11,148 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:11,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261902859] [2019-10-13 20:10:11,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:11,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:11,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:11,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261902859] [2019-10-13 20:10:11,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:10:11,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:10:11,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086800277] [2019-10-13 20:10:11,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:10:11,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:11,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:10:11,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:11,308 INFO L87 Difference]: Start difference. First operand 2077 states and 3299 transitions. Second operand 6 states. [2019-10-13 20:10:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:14,096 INFO L93 Difference]: Finished difference Result 4874 states and 7768 transitions. [2019-10-13 20:10:14,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:10:14,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-13 20:10:14,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:14,123 INFO L225 Difference]: With dead ends: 4874 [2019-10-13 20:10:14,123 INFO L226 Difference]: Without dead ends: 2803 [2019-10-13 20:10:14,130 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:10:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2019-10-13 20:10:14,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2790. [2019-10-13 20:10:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-10-13 20:10:14,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 4061 transitions. [2019-10-13 20:10:14,229 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 4061 transitions. Word has length 120 [2019-10-13 20:10:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:14,230 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 4061 transitions. [2019-10-13 20:10:14,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:10:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 4061 transitions. [2019-10-13 20:10:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-13 20:10:14,233 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:14,233 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:10:14,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 2059459070, now seen corresponding path program 1 times [2019-10-13 20:10:14,234 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:14,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031004221] [2019-10-13 20:10:14,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:14,235 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:14,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031004221] [2019-10-13 20:10:14,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:10:14,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:10:14,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647570988] [2019-10-13 20:10:14,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:10:14,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:14,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:10:14,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:14,388 INFO L87 Difference]: Start difference. First operand 2790 states and 4061 transitions. Second operand 6 states. [2019-10-13 20:10:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:17,843 INFO L93 Difference]: Finished difference Result 7362 states and 11039 transitions. [2019-10-13 20:10:17,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:10:17,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-13 20:10:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:17,870 INFO L225 Difference]: With dead ends: 7362 [2019-10-13 20:10:17,870 INFO L226 Difference]: Without dead ends: 4578 [2019-10-13 20:10:17,878 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-13 20:10:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2019-10-13 20:10:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4526. [2019-10-13 20:10:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4526 states. [2019-10-13 20:10:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 6572 transitions. [2019-10-13 20:10:18,010 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 6572 transitions. Word has length 123 [2019-10-13 20:10:18,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:18,011 INFO L462 AbstractCegarLoop]: Abstraction has 4526 states and 6572 transitions. [2019-10-13 20:10:18,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:10:18,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 6572 transitions. [2019-10-13 20:10:18,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 20:10:18,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:18,013 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-13 20:10:18,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:18,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:18,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1922288270, now seen corresponding path program 1 times [2019-10-13 20:10:18,014 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:18,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824022752] [2019-10-13 20:10:18,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:18,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:18,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:18,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824022752] [2019-10-13 20:10:18,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:10:18,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 20:10:18,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679457496] [2019-10-13 20:10:18,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 20:10:18,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:18,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 20:10:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:18,124 INFO L87 Difference]: Start difference. First operand 4526 states and 6572 transitions. Second operand 6 states. [2019-10-13 20:10:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:20,962 INFO L93 Difference]: Finished difference Result 12150 states and 17943 transitions. [2019-10-13 20:10:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 20:10:20,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-13 20:10:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:21,000 INFO L225 Difference]: With dead ends: 12150 [2019-10-13 20:10:21,000 INFO L226 Difference]: Without dead ends: 7630 [2019-10-13 20:10:21,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-13 20:10:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7630 states. [2019-10-13 20:10:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7630 to 6239. [2019-10-13 20:10:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6239 states. [2019-10-13 20:10:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8457 transitions. [2019-10-13 20:10:21,197 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8457 transitions. Word has length 131 [2019-10-13 20:10:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:21,198 INFO L462 AbstractCegarLoop]: Abstraction has 6239 states and 8457 transitions. [2019-10-13 20:10:21,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 20:10:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8457 transitions. [2019-10-13 20:10:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 20:10:21,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:21,210 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:10:21,211 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1219597803, now seen corresponding path program 1 times [2019-10-13 20:10:21,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:21,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600958906] [2019-10-13 20:10:21,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:21,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:21,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 20:10:21,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600958906] [2019-10-13 20:10:21,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151550489] [2019-10-13 20:10:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:10:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:21,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:10:21,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:10:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:21,663 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:10:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:10:21,747 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:10:21,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-13 20:10:21,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767524910] [2019-10-13 20:10:21,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:10:21,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:21,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:10:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:21,749 INFO L87 Difference]: Start difference. First operand 6239 states and 8457 transitions. Second operand 4 states. [2019-10-13 20:10:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:25,158 INFO L93 Difference]: Finished difference Result 18582 states and 25420 transitions. [2019-10-13 20:10:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:10:25,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 20:10:25,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:25,220 INFO L225 Difference]: With dead ends: 18582 [2019-10-13 20:10:25,220 INFO L226 Difference]: Without dead ends: 12349 [2019-10-13 20:10:25,235 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:25,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12349 states. [2019-10-13 20:10:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12349 to 11001. [2019-10-13 20:10:25,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11001 states. [2019-10-13 20:10:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11001 states to 11001 states and 14348 transitions. [2019-10-13 20:10:25,507 INFO L78 Accepts]: Start accepts. Automaton has 11001 states and 14348 transitions. Word has length 138 [2019-10-13 20:10:25,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:25,508 INFO L462 AbstractCegarLoop]: Abstraction has 11001 states and 14348 transitions. [2019-10-13 20:10:25,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:10:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11001 states and 14348 transitions. [2019-10-13 20:10:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-13 20:10:25,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:25,515 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:10:25,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:10:25,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:25,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1641735738, now seen corresponding path program 1 times [2019-10-13 20:10:25,721 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:25,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742748887] [2019-10-13 20:10:25,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:25,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:25,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-13 20:10:26,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742748887] [2019-10-13 20:10:26,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556282883] [2019-10-13 20:10:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:10:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:26,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:10:26,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:10:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-13 20:10:26,272 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:10:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-13 20:10:26,347 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 20:10:26,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-13 20:10:26,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594404654] [2019-10-13 20:10:26,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:10:26,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:10:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:10:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:26,349 INFO L87 Difference]: Start difference. First operand 11001 states and 14348 transitions. Second operand 4 states. [2019-10-13 20:10:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:10:28,964 INFO L93 Difference]: Finished difference Result 25037 states and 32209 transitions. [2019-10-13 20:10:28,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:10:28,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-10-13 20:10:28,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:10:29,016 INFO L225 Difference]: With dead ends: 25037 [2019-10-13 20:10:29,016 INFO L226 Difference]: Without dead ends: 14042 [2019-10-13 20:10:29,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 622 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 20:10:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-10-13 20:10:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 10999. [2019-10-13 20:10:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10999 states. [2019-10-13 20:10:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 14189 transitions. [2019-10-13 20:10:29,394 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 14189 transitions. Word has length 309 [2019-10-13 20:10:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:10:29,395 INFO L462 AbstractCegarLoop]: Abstraction has 10999 states and 14189 transitions. [2019-10-13 20:10:29,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:10:29,395 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 14189 transitions. [2019-10-13 20:10:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-10-13 20:10:29,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:10:29,432 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 20:10:29,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:10:29,639 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:10:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:10:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1051190182, now seen corresponding path program 1 times [2019-10-13 20:10:29,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:10:29,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400716743] [2019-10-13 20:10:29,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:29,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:10:29,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:10:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 266 proven. 256 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2019-10-13 20:10:30,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400716743] [2019-10-13 20:10:30,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871942421] [2019-10-13 20:10:30,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:10:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:10:31,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 20:10:31,140 INFO L279 TraceCheckSpWp]: Computing forward predicates...