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/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:06:08,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:06:08,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:06:08,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:06:08,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:06:08,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:06:08,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:06:08,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:06:08,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:06:08,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:06:08,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:06:08,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:06:08,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:06:08,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:06:08,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:06:08,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:06:08,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:06:08,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:06:08,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:06:08,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:06:08,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:06:08,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:06:08,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:06:08,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:06:08,291 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:06:08,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:06:08,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:06:08,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:06:08,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:06:08,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:06:08,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:06:08,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:06:08,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:06:08,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:06:08,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:06:08,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:06:08,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:06:08,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:06:08,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:06:08,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:06:08,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:06:08,313 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 21:06:08,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:06:08,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:06:08,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:06:08,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:06:08,333 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:06:08,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:06:08,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:06:08,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:06:08,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:06:08,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:06:08,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:06:08,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:06:08,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:06:08,336 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:06:08,336 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:06:08,337 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:06:08,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:06:08,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:06:08,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:06:08,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:06:08,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:06:08,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:06:08,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:06:08,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:06:08,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:06:08,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:06:08,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:06:08,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:06:08,339 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 21:06:08,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:06:08,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:06:08,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:06:08,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:06:08,649 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:06:08,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-13 21:06:08,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ef267b4/c3a1681dc3e5408a8af372ee7135afcc/FLAG2d000bea8 [2019-10-13 21:06:09,264 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:06:09,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-13 21:06:09,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ef267b4/c3a1681dc3e5408a8af372ee7135afcc/FLAG2d000bea8 [2019-10-13 21:06:09,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19ef267b4/c3a1681dc3e5408a8af372ee7135afcc [2019-10-13 21:06:09,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:06:09,602 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:06:09,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:09,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:06:09,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:06:09,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:09" (1/1) ... [2019-10-13 21:06:09,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703a7aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:09, skipping insertion in model container [2019-10-13 21:06:09,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:09" (1/1) ... [2019-10-13 21:06:09,617 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:06:09,649 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:06:09,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:09,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:06:09,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:10,037 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:06:10,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10 WrapperNode [2019-10-13 21:06:10,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:10,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:06:10,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:06:10,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:06:10,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (1/1) ... [2019-10-13 21:06:10,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:06:10,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:06:10,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:06:10,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:06:10,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (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 21:06:10,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:06:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:06:10,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:06:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:06:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:06:10,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:06:10,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:06:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:06:10,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:06:10,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:06:10,609 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:06:10,609 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:06:10,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:10 BoogieIcfgContainer [2019-10-13 21:06:10,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:06:10,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:06:10,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:06:10,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:06:10,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:09" (1/3) ... [2019-10-13 21:06:10,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777013a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:10, skipping insertion in model container [2019-10-13 21:06:10,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:10" (2/3) ... [2019-10-13 21:06:10,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777013a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:10, skipping insertion in model container [2019-10-13 21:06:10,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:10" (3/3) ... [2019-10-13 21:06:10,625 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-13 21:06:10,636 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:06:10,646 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-13 21:06:10,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-13 21:06:10,689 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:06:10,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:06:10,690 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:06:10,690 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:06:10,690 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:06:10,690 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:06:10,691 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:06:10,691 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:06:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-13 21:06:10,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:06:10,715 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:10,715 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:10,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:10,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:10,722 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-10-13 21:06:10,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:10,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966353790] [2019-10-13 21:06:10,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:10,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:10,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:10,932 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 21:06:10,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966353790] [2019-10-13 21:06:10,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:10,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:06:10,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724650281] [2019-10-13 21:06:10,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:06:10,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:06:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:06:10,963 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 4 states. [2019-10-13 21:06:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:11,170 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2019-10-13 21:06:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:11,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-13 21:06:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:11,185 INFO L225 Difference]: With dead ends: 131 [2019-10-13 21:06:11,185 INFO L226 Difference]: Without dead ends: 111 [2019-10-13 21:06:11,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-13 21:06:11,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-10-13 21:06:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-13 21:06:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-13 21:06:11,241 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-10-13 21:06:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:11,241 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-13 21:06:11,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:06:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-13 21:06:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:06:11,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:11,243 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:11,244 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:11,244 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-10-13 21:06:11,245 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:11,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030864379] [2019-10-13 21:06:11,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,246 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:11,294 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 21:06:11,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030864379] [2019-10-13 21:06:11,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:11,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:06:11,295 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553101338] [2019-10-13 21:06:11,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:06:11,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:11,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:06:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:06:11,298 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2019-10-13 21:06:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:11,396 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-10-13 21:06:11,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:11,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-13 21:06:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:11,399 INFO L225 Difference]: With dead ends: 111 [2019-10-13 21:06:11,400 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 21:06:11,401 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 21:06:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-10-13 21:06:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-13 21:06:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-13 21:06:11,422 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-10-13 21:06:11,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:11,424 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-13 21:06:11,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:06:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-13 21:06:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:06:11,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:11,428 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:11,429 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-10-13 21:06:11,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:11,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490617455] [2019-10-13 21:06:11,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:11,543 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 21:06:11,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490617455] [2019-10-13 21:06:11,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:11,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:11,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174397917] [2019-10-13 21:06:11,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:11,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:11,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:11,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,549 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2019-10-13 21:06:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:11,675 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-13 21:06:11,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:11,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 21:06:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:11,677 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:06:11,678 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 21:06:11,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 21:06:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-13 21:06:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 21:06:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-13 21:06:11,705 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-10-13 21:06:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:11,705 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-13 21:06:11,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-13 21:06:11,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:06:11,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:11,707 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:11,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-10-13 21:06:11,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:11,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369528440] [2019-10-13 21:06:11,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:11,792 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 21:06:11,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369528440] [2019-10-13 21:06:11,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:11,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:11,794 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195436994] [2019-10-13 21:06:11,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:11,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,795 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-13 21:06:11,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:11,893 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-13 21:06:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:11,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 21:06:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:11,895 INFO L225 Difference]: With dead ends: 71 [2019-10-13 21:06:11,895 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 21:06:11,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 21:06:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-13 21:06:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 21:06:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-13 21:06:11,903 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-10-13 21:06:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:11,903 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-13 21:06:11,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-13 21:06:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:06:11,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:11,905 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:11,906 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:11,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:11,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-10-13 21:06:11,906 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:11,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474671844] [2019-10-13 21:06:11,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,907 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:11,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:11,980 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 21:06:11,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474671844] [2019-10-13 21:06:11,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:11,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:11,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130889193] [2019-10-13 21:06:11,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:11,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:11,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:11,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:11,984 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-13 21:06:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,128 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-10-13 21:06:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:12,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 21:06:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,130 INFO L225 Difference]: With dead ends: 116 [2019-10-13 21:06:12,130 INFO L226 Difference]: Without dead ends: 114 [2019-10-13 21:06:12,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-13 21:06:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-10-13 21:06:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 21:06:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-13 21:06:12,154 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-10-13 21:06:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,155 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-13 21:06:12,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-13 21:06:12,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:06:12,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,159 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,160 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-10-13 21:06:12,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443457251] [2019-10-13 21:06:12,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,255 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 21:06:12,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443457251] [2019-10-13 21:06:12,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:12,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307055198] [2019-10-13 21:06:12,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:12,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,260 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-13 21:06:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,390 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-10-13 21:06:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:12,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 21:06:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,393 INFO L225 Difference]: With dead ends: 101 [2019-10-13 21:06:12,394 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 21:06:12,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 21:06:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-10-13 21:06:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 21:06:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-13 21:06:12,414 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-10-13 21:06:12,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,414 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-13 21:06:12,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-13 21:06:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:06:12,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-10-13 21:06:12,420 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007449860] [2019-10-13 21:06:12,420 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,491 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 21:06:12,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007449860] [2019-10-13 21:06:12,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:06:12,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550893841] [2019-10-13 21:06:12,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:06:12,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:06:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:06:12,493 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-13 21:06:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,560 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-13 21:06:12,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:06:12,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-13 21:06:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,562 INFO L225 Difference]: With dead ends: 65 [2019-10-13 21:06:12,562 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 21:06:12,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 21:06:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-13 21:06:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:06:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-13 21:06:12,568 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-10-13 21:06:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,568 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-13 21:06:12,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:06:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-13 21:06:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 21:06:12,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,570 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-10-13 21:06:12,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28524497] [2019-10-13 21:06:12,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,605 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 21:06:12,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28524497] [2019-10-13 21:06:12,606 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:06:12,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239263493] [2019-10-13 21:06:12,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:06:12,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:06:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:06:12,607 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-13 21:06:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,672 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-13 21:06:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:06:12,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-13 21:06:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,673 INFO L225 Difference]: With dead ends: 61 [2019-10-13 21:06:12,673 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:06:12,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:06:12,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-13 21:06:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 21:06:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-13 21:06:12,679 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-10-13 21:06:12,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,680 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-13 21:06:12,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:06:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-13 21:06:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:06:12,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,681 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-10-13 21:06:12,682 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342625858] [2019-10-13 21:06:12,682 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,751 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 21:06:12,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342625858] [2019-10-13 21:06:12,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:12,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306306600] [2019-10-13 21:06:12,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:12,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:12,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,753 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-10-13 21:06:12,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:12,891 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-10-13 21:06:12,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:12,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 21:06:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:12,893 INFO L225 Difference]: With dead ends: 94 [2019-10-13 21:06:12,893 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 21:06:12,894 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 21:06:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-13 21:06:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 21:06:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-13 21:06:12,900 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-10-13 21:06:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:12,900 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-13 21:06:12,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:12,901 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-13 21:06:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:06:12,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:12,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:12,902 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:12,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-10-13 21:06:12,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:12,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048344887] [2019-10-13 21:06:12,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:12,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:12,975 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 21:06:12,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048344887] [2019-10-13 21:06:12,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:12,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:12,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246384658] [2019-10-13 21:06:12,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:12,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:12,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:12,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:12,982 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-10-13 21:06:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,110 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-13 21:06:13,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:13,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 21:06:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,112 INFO L225 Difference]: With dead ends: 84 [2019-10-13 21:06:13,113 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 21:06:13,113 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:13,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 21:06:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-10-13 21:06:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 21:06:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-13 21:06:13,121 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-10-13 21:06:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,122 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-13 21:06:13,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-13 21:06:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:06:13,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,126 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-10-13 21:06:13,127 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,127 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671615693] [2019-10-13 21:06:13,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,127 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,183 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 21:06:13,183 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671615693] [2019-10-13 21:06:13,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127862414] [2019-10-13 21:06:13,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,186 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-10-13 21:06:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,261 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-13 21:06:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:13,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 21:06:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,262 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:06:13,263 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 21:06:13,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 21:06:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-10-13 21:06:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 21:06:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-13 21:06:13,267 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-10-13 21:06:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,268 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-13 21:06:13,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-13 21:06:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:06:13,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,269 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-10-13 21:06:13,270 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144057720] [2019-10-13 21:06:13,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,311 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 21:06:13,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144057720] [2019-10-13 21:06:13,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292469230] [2019-10-13 21:06:13,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,313 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-10-13 21:06:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,384 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-10-13 21:06:13,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:13,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 21:06:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,386 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:06:13,386 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 21:06:13,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 21:06:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-13 21:06:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-13 21:06:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-13 21:06:13,390 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-10-13 21:06:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,391 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-13 21:06:13,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-13 21:06:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:06:13,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,391 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,392 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-10-13 21:06:13,393 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440201034] [2019-10-13 21:06:13,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,423 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 21:06:13,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440201034] [2019-10-13 21:06:13,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877157983] [2019-10-13 21:06:13,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,425 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2019-10-13 21:06:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,502 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-13 21:06:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:13,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 21:06:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,504 INFO L225 Difference]: With dead ends: 69 [2019-10-13 21:06:13,504 INFO L226 Difference]: Without dead ends: 67 [2019-10-13 21:06:13,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-13 21:06:13,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-10-13 21:06:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-13 21:06:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-13 21:06:13,510 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-13 21:06:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,510 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-13 21:06:13,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-13 21:06:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:06:13,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,512 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-10-13 21:06:13,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587355190] [2019-10-13 21:06:13,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,564 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 21:06:13,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587355190] [2019-10-13 21:06:13,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513507073] [2019-10-13 21:06:13,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,567 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-10-13 21:06:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,678 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-13 21:06:13,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:13,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 21:06:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,679 INFO L225 Difference]: With dead ends: 59 [2019-10-13 21:06:13,679 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 21:06:13,680 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:13,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 21:06:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-10-13 21:06:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 21:06:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-13 21:06:13,691 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-13 21:06:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,692 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-13 21:06:13,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-13 21:06:13,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:06:13,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,693 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,696 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-10-13 21:06:13,696 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144688235] [2019-10-13 21:06:13,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,773 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 21:06:13,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144688235] [2019-10-13 21:06:13,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350508646] [2019-10-13 21:06:13,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,775 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-10-13 21:06:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,838 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-13 21:06:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:06:13,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 21:06:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,839 INFO L225 Difference]: With dead ends: 43 [2019-10-13 21:06:13,839 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:06:13,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:06:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-13 21:06:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 21:06:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-13 21:06:13,844 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-10-13 21:06:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,844 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-13 21:06:13,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-13 21:06:13,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:06:13,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:13,846 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-10-13 21:06:13,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127869744] [2019-10-13 21:06:13,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:13,893 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 21:06:13,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127869744] [2019-10-13 21:06:13,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:13,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:06:13,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057858246] [2019-10-13 21:06:13,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:13,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:13,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:13,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:13,895 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-10-13 21:06:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:13,983 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-13 21:06:13,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:13,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-13 21:06:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:13,984 INFO L225 Difference]: With dead ends: 54 [2019-10-13 21:06:13,985 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 21:06:13,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 21:06:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-10-13 21:06:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 21:06:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-13 21:06:13,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-10-13 21:06:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:13,993 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-13 21:06:13,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-13 21:06:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:06:13,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:13,994 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] [2019-10-13 21:06:13,994 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:13,995 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-10-13 21:06:13,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:13,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070568645] [2019-10-13 21:06:13,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:13,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,039 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 21:06:14,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070568645] [2019-10-13 21:06:14,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:14,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:06:14,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48169366] [2019-10-13 21:06:14,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:06:14,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:14,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:06:14,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:06:14,041 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2019-10-13 21:06:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:14,134 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-13 21:06:14,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:14,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-13 21:06:14,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:14,137 INFO L225 Difference]: With dead ends: 56 [2019-10-13 21:06:14,137 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 21:06:14,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:06:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 21:06:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-10-13 21:06:14,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 21:06:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-13 21:06:14,143 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-10-13 21:06:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:14,143 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-13 21:06:14,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:06:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-13 21:06:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 21:06:14,144 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:14,144 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] [2019-10-13 21:06:14,145 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:14,145 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-10-13 21:06:14,145 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:14,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797672071] [2019-10-13 21:06:14,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:14,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:14,185 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 21:06:14,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797672071] [2019-10-13 21:06:14,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:14,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:06:14,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204229341] [2019-10-13 21:06:14,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:06:14,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:14,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:06:14,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:06:14,187 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2019-10-13 21:06:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:14,228 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-13 21:06:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:06:14,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 21:06:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:14,228 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:06:14,229 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:06:14,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:06:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:06:14,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:06:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:06:14,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-13 21:06:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:14,231 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:06:14,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:06:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:06:14,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:06:14,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:06:14,515 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:14,516 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:14,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:14,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:06:14,516 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:06:14,516 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:06:14,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-10-13 21:06:14,517 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-10-13 21:06:14,518 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-10-13 21:06:14,519 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-10-13 21:06:14,519 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-10-13 21:06:14,519 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-10-13 21:06:14,520 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-10-13 21:06:14,520 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-10-13 21:06:14,520 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-10-13 21:06:14,520 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-10-13 21:06:14,520 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-10-13 21:06:14,521 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-13 21:06:14,521 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-10-13 21:06:14,521 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-13 21:06:14,522 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-10-13 21:06:14,522 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-13 21:06:14,522 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-10-13 21:06:14,522 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: true [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-10-13 21:06:14,523 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-10-13 21:06:14,524 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-10-13 21:06:14,525 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-10-13 21:06:14,525 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-10-13 21:06:14,525 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-10-13 21:06:14,525 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-10-13 21:06:14,525 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-13 21:06:14,525 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-13 21:06:14,526 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-13 21:06:14,527 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-10-13 21:06:14,528 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-13 21:06:14,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:06:14 BoogieIcfgContainer [2019-10-13 21:06:14,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:06:14,546 INFO L168 Benchmark]: Toolchain (without parser) took 4942.98 ms. Allocated memory was 138.4 MB in the beginning and 245.9 MB in the end (delta: 107.5 MB). Free memory was 101.9 MB in the beginning and 122.4 MB in the end (delta: -20.4 MB). Peak memory consumption was 87.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,547 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.60 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 180.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,548 INFO L168 Benchmark]: Boogie Preprocessor took 50.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,549 INFO L168 Benchmark]: RCFGBuilder took 523.01 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 153.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,550 INFO L168 Benchmark]: TraceAbstraction took 3930.24 ms. Allocated memory was 201.9 MB in the beginning and 245.9 MB in the end (delta: 44.0 MB). Free memory was 153.6 MB in the beginning and 122.4 MB in the end (delta: 31.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. [2019-10-13 21:06:14,554 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 435.60 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 101.7 MB in the beginning and 180.4 MB in the end (delta: -78.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.05 ms. Allocated memory is still 201.9 MB. Free memory was 180.4 MB in the beginning and 178.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 523.01 ms. Allocated memory is still 201.9 MB. Free memory was 178.4 MB in the beginning and 153.6 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3930.24 ms. Allocated memory was 201.9 MB in the beginning and 245.9 MB in the end (delta: 44.0 MB). Free memory was 153.6 MB in the beginning and 122.4 MB in the end (delta: 31.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 852 SDtfs, 1396 SDslu, 908 SDs, 0 SdLazy, 1094 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 50 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2628 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 11162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...