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-13a467a-m [2019-10-15 00:08:52,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 00:08:52,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 00:08:52,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 00:08:52,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 00:08:52,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 00:08:52,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 00:08:52,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 00:08:52,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 00:08:52,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 00:08:52,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 00:08:52,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 00:08:52,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 00:08:52,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 00:08:52,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 00:08:52,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 00:08:52,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 00:08:52,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 00:08:52,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 00:08:52,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 00:08:52,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 00:08:52,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 00:08:52,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 00:08:52,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 00:08:53,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 00:08:53,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 00:08:53,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 00:08:53,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 00:08:53,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 00:08:53,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 00:08:53,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 00:08:53,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 00:08:53,004 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 00:08:53,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 00:08:53,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 00:08:53,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 00:08:53,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 00:08:53,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 00:08:53,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 00:08:53,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 00:08:53,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 00:08:53,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 00:08:53,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 00:08:53,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 00:08:53,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 00:08:53,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 00:08:53,027 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 00:08:53,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 00:08:53,027 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 00:08:53,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 00:08:53,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 00:08:53,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 00:08:53,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 00:08:53,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 00:08:53,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 00:08:53,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 00:08:53,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 00:08:53,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 00:08:53,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 00:08:53,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 00:08:53,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 00:08:53,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 00:08:53,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 00:08:53,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:08:53,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 00:08:53,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 00:08:53,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 00:08:53,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 00:08:53,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 00:08:53,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 00:08:53,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 00:08:53,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 00:08:53,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 00:08:53,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 00:08:53,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 00:08:53,347 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 00:08:53,348 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-15 00:08:53,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95e7b78/abc10d222fbc45d3889524caa51110f0/FLAG2e49423eb [2019-10-15 00:08:54,228 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 00:08:54,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label35.c [2019-10-15 00:08:54,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95e7b78/abc10d222fbc45d3889524caa51110f0/FLAG2e49423eb [2019-10-15 00:08:54,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb95e7b78/abc10d222fbc45d3889524caa51110f0 [2019-10-15 00:08:54,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 00:08:54,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 00:08:54,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 00:08:54,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 00:08:54,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 00:08:54,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:54" (1/1) ... [2019-10-15 00:08:54,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:54, skipping insertion in model container [2019-10-15 00:08:54,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 12:08:54" (1/1) ... [2019-10-15 00:08:54,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 00:08:54,394 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 00:08:55,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:08:55,271 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 00:08:55,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 00:08:55,552 INFO L192 MainTranslator]: Completed translation [2019-10-15 00:08:55,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55 WrapperNode [2019-10-15 00:08:55,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 00:08:55,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 00:08:55,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 00:08:55,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 00:08:55,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... [2019-10-15 00:08:55,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 00:08:55,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 00:08:55,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 00:08:55,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 00:08:55,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 00:08:55,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 00:08:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 00:08:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-15 00:08:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-15 00:08:55,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 00:08:55,845 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-15 00:08:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-15 00:08:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 00:08:55,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 00:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 00:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 00:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 00:08:55,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 00:08:58,414 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 00:08:58,414 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 00:08:58,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:58 BoogieIcfgContainer [2019-10-15 00:08:58,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 00:08:58,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 00:08:58,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 00:08:58,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 00:08:58,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 12:08:54" (1/3) ... [2019-10-15 00:08:58,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adb1e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:08:58, skipping insertion in model container [2019-10-15 00:08:58,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 12:08:55" (2/3) ... [2019-10-15 00:08:58,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6adb1e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:08:58, skipping insertion in model container [2019-10-15 00:08:58,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:08:58" (3/3) ... [2019-10-15 00:08:58,424 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label35.c [2019-10-15 00:08:58,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 00:08:58,448 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 00:08:58,460 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 00:08:58,510 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 00:08:58,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 00:08:58,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 00:08:58,511 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 00:08:58,511 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 00:08:58,511 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 00:08:58,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 00:08:58,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 00:08:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-15 00:08:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 00:08:58,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:08:58,550 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-15 00:08:58,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:08:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:08:58,559 INFO L82 PathProgramCache]: Analyzing trace with hash 338381554, now seen corresponding path program 1 times [2019-10-15 00:08:58,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:08:58,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688162327] [2019-10-15 00:08:58,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:08:58,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:08:58,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:08:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:08:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 00:08:58,898 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688162327] [2019-10-15 00:08:58,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:08:58,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 00:08:58,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659349804] [2019-10-15 00:08:58,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:08:58,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:08:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:08:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 00:08:58,933 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-10-15 00:09:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:03,960 INFO L93 Difference]: Finished difference Result 1509 states and 2834 transitions. [2019-10-15 00:09:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:09:03,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-10-15 00:09:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:03,991 INFO L225 Difference]: With dead ends: 1509 [2019-10-15 00:09:03,992 INFO L226 Difference]: Without dead ends: 1019 [2019-10-15 00:09:04,002 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-15 00:09:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-15 00:09:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 682. [2019-10-15 00:09:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-15 00:09:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1190 transitions. [2019-10-15 00:09:04,106 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1190 transitions. Word has length 47 [2019-10-15 00:09:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:04,107 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1190 transitions. [2019-10-15 00:09:04,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:09:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1190 transitions. [2019-10-15 00:09:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 00:09:04,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:04,113 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-15 00:09:04,114 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:04,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:04,114 INFO L82 PathProgramCache]: Analyzing trace with hash -8457825, now seen corresponding path program 1 times [2019-10-15 00:09:04,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:04,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663779674] [2019-10-15 00:09:04,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:04,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:04,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:04,284 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-15 00:09:04,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663779674] [2019-10-15 00:09:04,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:09:04,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 00:09:04,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912548611] [2019-10-15 00:09:04,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 00:09:04,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:04,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 00:09:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 00:09:04,289 INFO L87 Difference]: Start difference. First operand 682 states and 1190 transitions. Second operand 5 states. [2019-10-15 00:09:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:07,670 INFO L93 Difference]: Finished difference Result 2068 states and 3645 transitions. [2019-10-15 00:09:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:09:07,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-15 00:09:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:07,683 INFO L225 Difference]: With dead ends: 2068 [2019-10-15 00:09:07,683 INFO L226 Difference]: Without dead ends: 1392 [2019-10-15 00:09:07,686 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-15 00:09:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-10-15 00:09:07,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1374. [2019-10-15 00:09:07,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-10-15 00:09:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2277 transitions. [2019-10-15 00:09:07,754 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2277 transitions. Word has length 116 [2019-10-15 00:09:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:07,755 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2277 transitions. [2019-10-15 00:09:07,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 00:09:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2277 transitions. [2019-10-15 00:09:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 00:09:07,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:07,767 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-15 00:09:07,768 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:07,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1750756938, now seen corresponding path program 1 times [2019-10-15 00:09:07,769 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:07,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708770147] [2019-10-15 00:09:07,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:07,771 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:07,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:07,938 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-15 00:09:07,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708770147] [2019-10-15 00:09:07,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:09:07,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:09:07,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412750881] [2019-10-15 00:09:07,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:09:07,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:09:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:07,941 INFO L87 Difference]: Start difference. First operand 1374 states and 2277 transitions. Second operand 6 states. [2019-10-15 00:09:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:11,154 INFO L93 Difference]: Finished difference Result 3463 states and 5746 transitions. [2019-10-15 00:09:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:09:11,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 00:09:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:11,171 INFO L225 Difference]: With dead ends: 3463 [2019-10-15 00:09:11,179 INFO L226 Difference]: Without dead ends: 2095 [2019-10-15 00:09:11,184 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-15 00:09:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2019-10-15 00:09:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 2077. [2019-10-15 00:09:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-10-15 00:09:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 3299 transitions. [2019-10-15 00:09:11,275 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 3299 transitions. Word has length 119 [2019-10-15 00:09:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:11,277 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 3299 transitions. [2019-10-15 00:09:11,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:09:11,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 3299 transitions. [2019-10-15 00:09:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 00:09:11,280 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:11,280 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-15 00:09:11,281 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1833499239, now seen corresponding path program 1 times [2019-10-15 00:09:11,281 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:11,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54523597] [2019-10-15 00:09:11,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:11,282 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:11,471 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-15 00:09:11,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54523597] [2019-10-15 00:09:11,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:09:11,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:09:11,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988529015] [2019-10-15 00:09:11,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:09:11,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:11,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:09:11,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:11,474 INFO L87 Difference]: Start difference. First operand 2077 states and 3299 transitions. Second operand 6 states. [2019-10-15 00:09:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:14,233 INFO L93 Difference]: Finished difference Result 4874 states and 7768 transitions. [2019-10-15 00:09:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:09:14,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-15 00:09:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:14,253 INFO L225 Difference]: With dead ends: 4874 [2019-10-15 00:09:14,253 INFO L226 Difference]: Without dead ends: 2803 [2019-10-15 00:09:14,258 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-15 00:09:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2019-10-15 00:09:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2790. [2019-10-15 00:09:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-10-15 00:09:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 4061 transitions. [2019-10-15 00:09:14,337 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 4061 transitions. Word has length 120 [2019-10-15 00:09:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:14,338 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 4061 transitions. [2019-10-15 00:09:14,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:09:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 4061 transitions. [2019-10-15 00:09:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 00:09:14,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:14,340 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-15 00:09:14,340 INFO L410 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:14,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2059459070, now seen corresponding path program 1 times [2019-10-15 00:09:14,341 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:14,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83821686] [2019-10-15 00:09:14,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:14,341 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:14,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:14,447 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-15 00:09:14,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83821686] [2019-10-15 00:09:14,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:09:14,448 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:09:14,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7582435] [2019-10-15 00:09:14,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:09:14,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:14,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:09:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:14,450 INFO L87 Difference]: Start difference. First operand 2790 states and 4061 transitions. Second operand 6 states. [2019-10-15 00:09:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:17,910 INFO L93 Difference]: Finished difference Result 7362 states and 11039 transitions. [2019-10-15 00:09:17,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 00:09:17,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-15 00:09:17,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:17,948 INFO L225 Difference]: With dead ends: 7362 [2019-10-15 00:09:17,948 INFO L226 Difference]: Without dead ends: 4578 [2019-10-15 00:09:17,956 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-15 00:09:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4578 states. [2019-10-15 00:09:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4578 to 4526. [2019-10-15 00:09:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4526 states. [2019-10-15 00:09:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4526 states to 4526 states and 6572 transitions. [2019-10-15 00:09:18,080 INFO L78 Accepts]: Start accepts. Automaton has 4526 states and 6572 transitions. Word has length 123 [2019-10-15 00:09:18,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:18,081 INFO L462 AbstractCegarLoop]: Abstraction has 4526 states and 6572 transitions. [2019-10-15 00:09:18,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:09:18,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4526 states and 6572 transitions. [2019-10-15 00:09:18,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-15 00:09:18,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:18,083 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-15 00:09:18,083 INFO L410 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1922288270, now seen corresponding path program 1 times [2019-10-15 00:09:18,084 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:18,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733928999] [2019-10-15 00:09:18,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:18,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:18,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:18,219 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-15 00:09:18,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733928999] [2019-10-15 00:09:18,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 00:09:18,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 00:09:18,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116908779] [2019-10-15 00:09:18,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 00:09:18,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:18,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 00:09:18,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:18,223 INFO L87 Difference]: Start difference. First operand 4526 states and 6572 transitions. Second operand 6 states. [2019-10-15 00:09:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:21,221 INFO L93 Difference]: Finished difference Result 12150 states and 17943 transitions. [2019-10-15 00:09:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 00:09:21,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-10-15 00:09:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:21,266 INFO L225 Difference]: With dead ends: 12150 [2019-10-15 00:09:21,266 INFO L226 Difference]: Without dead ends: 7630 [2019-10-15 00:09:21,282 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-15 00:09:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7630 states. [2019-10-15 00:09:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7630 to 6239. [2019-10-15 00:09:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6239 states. [2019-10-15 00:09:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6239 states to 6239 states and 8457 transitions. [2019-10-15 00:09:21,466 INFO L78 Accepts]: Start accepts. Automaton has 6239 states and 8457 transitions. Word has length 131 [2019-10-15 00:09:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:21,467 INFO L462 AbstractCegarLoop]: Abstraction has 6239 states and 8457 transitions. [2019-10-15 00:09:21,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 00:09:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6239 states and 8457 transitions. [2019-10-15 00:09:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 00:09:21,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:21,474 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-15 00:09:21,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1219597803, now seen corresponding path program 1 times [2019-10-15 00:09:21,475 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:21,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665459553] [2019-10-15 00:09:21,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:21,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:21,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:21,641 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-15 00:09:21,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665459553] [2019-10-15 00:09:21,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813019661] [2019-10-15 00:09:21,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:09:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:21,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 00:09:21,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:09:21,976 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-15 00:09:21,977 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:09:22,051 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-15 00:09:22,052 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:09:22,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 00:09:22,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522506494] [2019-10-15 00:09:22,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:09:22,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:09:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:22,055 INFO L87 Difference]: Start difference. First operand 6239 states and 8457 transitions. Second operand 4 states. [2019-10-15 00:09:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:25,678 INFO L93 Difference]: Finished difference Result 18582 states and 25420 transitions. [2019-10-15 00:09:25,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:09:25,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 00:09:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:25,744 INFO L225 Difference]: With dead ends: 18582 [2019-10-15 00:09:25,744 INFO L226 Difference]: Without dead ends: 12349 [2019-10-15 00:09:25,760 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-15 00:09:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12349 states. [2019-10-15 00:09:26,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12349 to 11001. [2019-10-15 00:09:26,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11001 states. [2019-10-15 00:09:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11001 states to 11001 states and 14348 transitions. [2019-10-15 00:09:26,091 INFO L78 Accepts]: Start accepts. Automaton has 11001 states and 14348 transitions. Word has length 138 [2019-10-15 00:09:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:26,091 INFO L462 AbstractCegarLoop]: Abstraction has 11001 states and 14348 transitions. [2019-10-15 00:09:26,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:09:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11001 states and 14348 transitions. [2019-10-15 00:09:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-15 00:09:26,100 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:26,101 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-15 00:09:26,309 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:09:26,309 INFO L410 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:26,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1641735738, now seen corresponding path program 1 times [2019-10-15 00:09:26,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:26,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659428626] [2019-10-15 00:09:26,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:26,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:26,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:26,644 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-15 00:09:26,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659428626] [2019-10-15 00:09:26,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491431559] [2019-10-15 00:09:26,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:09:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 00:09:26,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 00:09:26,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 00:09:27,040 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-15 00:09:27,041 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 00:09:27,176 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-15 00:09:27,176 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 00:09:27,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-10-15 00:09:27,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315752230] [2019-10-15 00:09:27,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 00:09:27,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 00:09:27,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 00:09:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-15 00:09:27,181 INFO L87 Difference]: Start difference. First operand 11001 states and 14348 transitions. Second operand 4 states. [2019-10-15 00:09:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 00:09:29,882 INFO L93 Difference]: Finished difference Result 25037 states and 32209 transitions. [2019-10-15 00:09:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 00:09:29,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-10-15 00:09:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 00:09:29,940 INFO L225 Difference]: With dead ends: 25037 [2019-10-15 00:09:29,940 INFO L226 Difference]: Without dead ends: 14042 [2019-10-15 00:09:29,970 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-15 00:09:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-10-15 00:09:30,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 10999. [2019-10-15 00:09:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10999 states. [2019-10-15 00:09:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10999 states to 10999 states and 14189 transitions. [2019-10-15 00:09:30,349 INFO L78 Accepts]: Start accepts. Automaton has 10999 states and 14189 transitions. Word has length 309 [2019-10-15 00:09:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 00:09:30,351 INFO L462 AbstractCegarLoop]: Abstraction has 10999 states and 14189 transitions. [2019-10-15 00:09:30,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 00:09:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 10999 states and 14189 transitions. [2019-10-15 00:09:30,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-10-15 00:09:30,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 00:09:30,391 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-15 00:09:30,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 00:09:30,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 00:09:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 00:09:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1051190182, now seen corresponding path program 1 times [2019-10-15 00:09:30,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 00:09:30,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100514090] [2019-10-15 00:09:30,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:30,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 00:09:30,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 00:09:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat