/usr/bin/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:07,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:07,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:07,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:07,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:07,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:07,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:07,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:07,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:07,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:07,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:07,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:07,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:07,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:07,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:07,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:07,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:07,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:07,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:07,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:07,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:07,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:07,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:07,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:07,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:07,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:07,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:07,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:07,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:07,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:07,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:07,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:07,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:07,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:07,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:07,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:07,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:07,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:07,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:07,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:07,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:07,857 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-11-07 00:34:07,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:07,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:07,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:07,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:07,893 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:07,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:07,896 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:07,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:07,896 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:07,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:07,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:07,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:07,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:07,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:07,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:07,899 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:07,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:07,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:07,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:07,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:07,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:07,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:07,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:07,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:07,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:07,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:07,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:07,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:07,902 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-11-07 00:34:08,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:08,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:08,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:08,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:08,214 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:08,215 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+nlh-reducer.c [2019-11-07 00:34:08,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b24e06f/4126167645f541028a35ed7d583b0730/FLAG7bbe5376f [2019-11-07 00:34:08,719 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:08,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-11-07 00:34:08,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b24e06f/4126167645f541028a35ed7d583b0730/FLAG7bbe5376f [2019-11-07 00:34:09,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b24e06f/4126167645f541028a35ed7d583b0730 [2019-11-07 00:34:09,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:09,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:09,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:09,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:09,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:09,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40852bb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09, skipping insertion in model container [2019-11-07 00:34:09,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,092 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:09,127 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:09,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:09,422 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:09,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:09,586 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:09,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09 WrapperNode [2019-11-07 00:34:09,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:09,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:09,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:09,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:09,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (1/1) ... [2019-11-07 00:34:09,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:09,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:09,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:09,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:09,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (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-11-07 00:34:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:09,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:09,705 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:09,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:09,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:09,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:10,126 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:10,127 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 00:34:10,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:10 BoogieIcfgContainer [2019-11-07 00:34:10,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:10,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:10,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:10,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:10,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:09" (1/3) ... [2019-11-07 00:34:10,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a916f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:10, skipping insertion in model container [2019-11-07 00:34:10,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:09" (2/3) ... [2019-11-07 00:34:10,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a916f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:10, skipping insertion in model container [2019-11-07 00:34:10,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:10" (3/3) ... [2019-11-07 00:34:10,137 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-11-07 00:34:10,145 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:10,152 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-11-07 00:34:10,163 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-11-07 00:34:10,190 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:10,191 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:10,191 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:10,191 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:10,192 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:10,193 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:10,193 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:10,193 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-07 00:34:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:34:10,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,227 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2019-11-07 00:34:10,241 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,241 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79456777] [2019-11-07 00:34:10,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:10,452 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79456777] [2019-11-07 00:34:10,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:10,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769818275] [2019-11-07 00:34:10,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:10,462 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:10,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:10,477 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-07 00:34:10,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,685 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2019-11-07 00:34:10,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:10,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 00:34:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,700 INFO L225 Difference]: With dead ends: 133 [2019-11-07 00:34:10,700 INFO L226 Difference]: Without dead ends: 113 [2019-11-07 00:34:10,704 INFO L630 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-11-07 00:34:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-07 00:34:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2019-11-07 00:34:10,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-07 00:34:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-07 00:34:10,759 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-11-07 00:34:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,760 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-07 00:34:10,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-07 00:34:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 00:34:10,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,764 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2019-11-07 00:34:10,765 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,765 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403083927] [2019-11-07 00:34:10,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:10,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:10,841 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403083927] [2019-11-07 00:34:10,841 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:10,841 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:10,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649097819] [2019-11-07 00:34:10,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:10,844 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:10,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:10,845 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2019-11-07 00:34:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:10,921 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-07 00:34:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:10,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 00:34:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:10,924 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:10,925 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:10,926 INFO L630 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-11-07 00:34:10,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-07 00:34:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-07 00:34:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-07 00:34:10,935 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2019-11-07 00:34:10,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:10,936 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-07 00:34:10,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-07 00:34:10,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 00:34:10,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:10,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:10,938 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:10,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:10,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2019-11-07 00:34:10,939 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:10,939 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886048693] [2019-11-07 00:34:10,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886048693] [2019-11-07 00:34:11,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:11,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047724168] [2019-11-07 00:34:11,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:11,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:11,019 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 4 states. [2019-11-07 00:34:11,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,109 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-07 00:34:11,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-07 00:34:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,111 INFO L225 Difference]: With dead ends: 73 [2019-11-07 00:34:11,111 INFO L226 Difference]: Without dead ends: 71 [2019-11-07 00:34:11,112 INFO L630 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-11-07 00:34:11,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-07 00:34:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-11-07 00:34:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-07 00:34:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-07 00:34:11,125 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2019-11-07 00:34:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,125 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-07 00:34:11,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-07 00:34:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:11,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,129 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2019-11-07 00:34:11,132 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,132 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760591185] [2019-11-07 00:34:11,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,229 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760591185] [2019-11-07 00:34:11,230 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,230 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579949119] [2019-11-07 00:34:11,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,231 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,232 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 5 states. [2019-11-07 00:34:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,320 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-07 00:34:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 00:34:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,322 INFO L225 Difference]: With dead ends: 71 [2019-11-07 00:34:11,322 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 00:34:11,323 INFO L630 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-11-07 00:34:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 00:34:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-11-07 00:34:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-07 00:34:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-11-07 00:34:11,331 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2019-11-07 00:34:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,331 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-11-07 00:34:11,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,331 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-11-07 00:34:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:11,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,333 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2019-11-07 00:34:11,334 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,334 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514194626] [2019-11-07 00:34:11,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,395 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514194626] [2019-11-07 00:34:11,397 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,397 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131013346] [2019-11-07 00:34:11,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,398 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,399 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2019-11-07 00:34:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,505 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-11-07 00:34:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 00:34:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,506 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:11,507 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:11,507 INFO L630 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-11-07 00:34:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-11-07 00:34:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 00:34:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-11-07 00:34:11,522 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2019-11-07 00:34:11,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,525 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-07 00:34:11,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-11-07 00:34:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,526 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2019-11-07 00:34:11,527 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,529 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366014111] [2019-11-07 00:34:11,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366014111] [2019-11-07 00:34:11,589 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,590 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:11,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486859619] [2019-11-07 00:34:11,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:11,591 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:11,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:11,591 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 5 states. [2019-11-07 00:34:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,708 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-11-07 00:34:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:11,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 00:34:11,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,710 INFO L225 Difference]: With dead ends: 112 [2019-11-07 00:34:11,710 INFO L226 Difference]: Without dead ends: 110 [2019-11-07 00:34:11,710 INFO L630 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-11-07 00:34:11,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-07 00:34:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 64. [2019-11-07 00:34:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 00:34:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-07 00:34:11,718 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2019-11-07 00:34:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,718 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-07 00:34:11,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-07 00:34:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,720 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,721 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2019-11-07 00:34:11,721 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,721 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029589225] [2019-11-07 00:34:11,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,769 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029589225] [2019-11-07 00:34:11,769 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,769 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:11,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628447305] [2019-11-07 00:34:11,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:11,771 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:11,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:11,772 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 4 states. [2019-11-07 00:34:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,833 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-07 00:34:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:11,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 00:34:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,835 INFO L225 Difference]: With dead ends: 65 [2019-11-07 00:34:11,835 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 00:34:11,835 INFO L630 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-11-07 00:34:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 00:34:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-07 00:34:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 00:34:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2019-11-07 00:34:11,842 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2019-11-07 00:34:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,843 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2019-11-07 00:34:11,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2019-11-07 00:34:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:11,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,845 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2019-11-07 00:34:11,846 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,846 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130012843] [2019-11-07 00:34:11,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:11,881 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130012843] [2019-11-07 00:34:11,882 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:11,882 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:11,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732436029] [2019-11-07 00:34:11,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:11,883 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:11,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:11,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:11,883 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2019-11-07 00:34:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:11,948 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-07 00:34:11,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:11,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 00:34:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:11,949 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:11,949 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 00:34:11,950 INFO L630 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-11-07 00:34:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 00:34:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-07 00:34:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-07 00:34:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-07 00:34:11,955 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2019-11-07 00:34:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:11,955 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-07 00:34:11,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-11-07 00:34:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:11,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:11,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:11,957 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2019-11-07 00:34:11,958 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:11,958 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302578896] [2019-11-07 00:34:11,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302578896] [2019-11-07 00:34:12,018 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,018 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64552773] [2019-11-07 00:34:12,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,020 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,021 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2019-11-07 00:34:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,135 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2019-11-07 00:34:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:12,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,137 INFO L225 Difference]: With dead ends: 95 [2019-11-07 00:34:12,137 INFO L226 Difference]: Without dead ends: 93 [2019-11-07 00:34:12,138 INFO L630 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-11-07 00:34:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-07 00:34:12,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-11-07 00:34:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-07 00:34:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-11-07 00:34:12,144 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2019-11-07 00:34:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,144 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-11-07 00:34:12,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,144 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-11-07 00:34:12,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:12,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,146 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2019-11-07 00:34:12,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774793931] [2019-11-07 00:34:12,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,209 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774793931] [2019-11-07 00:34:12,209 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,210 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840376134] [2019-11-07 00:34:12,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,211 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,211 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2019-11-07 00:34:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,325 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-07 00:34:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,326 INFO L225 Difference]: With dead ends: 72 [2019-11-07 00:34:12,327 INFO L226 Difference]: Without dead ends: 70 [2019-11-07 00:34:12,327 INFO L630 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-11-07 00:34:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-07 00:34:12,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-07 00:34:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-07 00:34:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-11-07 00:34:12,331 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2019-11-07 00:34:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,332 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-11-07 00:34:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-11-07 00:34:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:34:12,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,334 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2019-11-07 00:34:12,334 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,334 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031296629] [2019-11-07 00:34:12,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,384 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031296629] [2019-11-07 00:34:12,384 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,384 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875870972] [2019-11-07 00:34:12,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,385 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,386 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2019-11-07 00:34:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,452 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-07 00:34:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-07 00:34:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,453 INFO L225 Difference]: With dead ends: 53 [2019-11-07 00:34:12,453 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 00:34:12,454 INFO L630 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-11-07 00:34:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 00:34:12,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-07 00:34:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-07 00:34:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-07 00:34:12,459 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2019-11-07 00:34:12,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,460 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-07 00:34:12,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,460 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-07 00:34:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,468 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2019-11-07 00:34:12,469 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,470 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781346261] [2019-11-07 00:34:12,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,565 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781346261] [2019-11-07 00:34:12,566 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,566 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308309360] [2019-11-07 00:34:12,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,567 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,567 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-11-07 00:34:12,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,631 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-07 00:34:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:12,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,633 INFO L225 Difference]: With dead ends: 50 [2019-11-07 00:34:12,633 INFO L226 Difference]: Without dead ends: 48 [2019-11-07 00:34:12,634 INFO L630 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-11-07 00:34:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-07 00:34:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-07 00:34:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-07 00:34:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-07 00:34:12,638 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-11-07 00:34:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,638 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-07 00:34:12,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-07 00:34:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,640 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2019-11-07 00:34:12,640 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,640 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956191876] [2019-11-07 00:34:12,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956191876] [2019-11-07 00:34:12,674 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,674 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622706011] [2019-11-07 00:34:12,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,675 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,676 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 5 states. [2019-11-07 00:34:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,768 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-07 00:34:12,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:12,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,770 INFO L225 Difference]: With dead ends: 69 [2019-11-07 00:34:12,770 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 00:34:12,770 INFO L630 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-11-07 00:34:12,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 00:34:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2019-11-07 00:34:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 00:34:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-07 00:34:12,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-11-07 00:34:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,774 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-07 00:34:12,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-07 00:34:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,776 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2019-11-07 00:34:12,776 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,777 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714132730] [2019-11-07 00:34:12,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,828 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714132730] [2019-11-07 00:34:12,829 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,829 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692897879] [2019-11-07 00:34:12,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,830 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,830 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-11-07 00:34:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:12,914 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2019-11-07 00:34:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:12,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:12,915 INFO L225 Difference]: With dead ends: 57 [2019-11-07 00:34:12,915 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 00:34:12,915 INFO L630 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-11-07 00:34:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 00:34:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2019-11-07 00:34:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-07 00:34:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-07 00:34:12,919 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2019-11-07 00:34:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:12,919 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-07 00:34:12,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-07 00:34:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:12,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:12,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:12,920 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2019-11-07 00:34:12,921 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:12,921 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599699972] [2019-11-07 00:34:12,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:12,969 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599699972] [2019-11-07 00:34:12,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:12,969 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:12,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282535638] [2019-11-07 00:34:12,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:12,970 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:12,971 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-11-07 00:34:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,022 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-11-07 00:34:13,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:34:13,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-07 00:34:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,023 INFO L225 Difference]: With dead ends: 41 [2019-11-07 00:34:13,023 INFO L226 Difference]: Without dead ends: 37 [2019-11-07 00:34:13,024 INFO L630 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-11-07 00:34:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-07 00:34:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-07 00:34:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-07 00:34:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-07 00:34:13,027 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2019-11-07 00:34:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,027 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-07 00:34:13,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-07 00:34:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:34:13,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:13,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:13,029 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2019-11-07 00:34:13,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:13,030 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621320258] [2019-11-07 00:34:13,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:13,078 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621320258] [2019-11-07 00:34:13,079 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:13,079 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:13,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053482867] [2019-11-07 00:34:13,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:13,080 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:13,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:13,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:13,080 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-11-07 00:34:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,165 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-11-07 00:34:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:13,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-07 00:34:13,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,167 INFO L225 Difference]: With dead ends: 52 [2019-11-07 00:34:13,167 INFO L226 Difference]: Without dead ends: 50 [2019-11-07 00:34:13,167 INFO L630 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-11-07 00:34:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-07 00:34:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-11-07 00:34:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 00:34:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-07 00:34:13,171 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2019-11-07 00:34:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,171 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-07 00:34:13,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-07 00:34:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:13,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:13,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:13,173 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:13,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2019-11-07 00:34:13,173 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:13,173 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739338113] [2019-11-07 00:34:13,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:13,220 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739338113] [2019-11-07 00:34:13,220 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:13,220 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:13,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754724817] [2019-11-07 00:34:13,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:13,221 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:13,221 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-11-07 00:34:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,321 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-07 00:34:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:13,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-07 00:34:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,325 INFO L225 Difference]: With dead ends: 56 [2019-11-07 00:34:13,325 INFO L226 Difference]: Without dead ends: 54 [2019-11-07 00:34:13,325 INFO L630 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-11-07 00:34:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-07 00:34:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 33. [2019-11-07 00:34:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-07 00:34:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-07 00:34:13,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-11-07 00:34:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,330 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-07 00:34:13,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-07 00:34:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:34:13,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:13,331 INFO L410 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-11-07 00:34:13,332 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:13,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2019-11-07 00:34:13,332 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:13,332 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81537634] [2019-11-07 00:34:13,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:13,364 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81537634] [2019-11-07 00:34:13,365 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:13,365 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:34:13,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557156248] [2019-11-07 00:34:13,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:34:13,365 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:34:13,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:34:13,366 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-11-07 00:34:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:13,412 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-07 00:34:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:34:13,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 00:34:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:13,412 INFO L225 Difference]: With dead ends: 37 [2019-11-07 00:34:13,412 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:13,413 INFO L630 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-11-07 00:34:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:13,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:13,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:13,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-07 00:34:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:13,414 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:13,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:34:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:13,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:13,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:13,771 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,772 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,772 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,772 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,772 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,772 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:13,772 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-11-07 00:34:13,773 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-07 00:34:13,774 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-11-07 00:34:13,775 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-11-07 00:34:13,775 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-11-07 00:34:13,775 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-11-07 00:34:13,775 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-11-07 00:34:13,775 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-11-07 00:34:13,776 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-11-07 00:34:13,776 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-07 00:34:13,776 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-11-07 00:34:13,776 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-11-07 00:34:13,776 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-11-07 00:34:13,777 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-11-07 00:34:13,777 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-11-07 00:34:13,777 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-11-07 00:34:13,777 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) 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-11-07 00:34:13,777 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-11-07 00:34:13,778 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-07 00:34:13,778 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-11-07 00:34:13,778 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-11-07 00:34:13,778 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-07 00:34:13,778 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-11-07 00:34:13,778 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-11-07 00:34:13,779 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-11-07 00:34:13,780 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-11-07 00:34:13,781 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-11-07 00:34:13,781 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-11-07 00:34:13,781 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-11-07 00:34:13,781 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-11-07 00:34:13,781 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-07 00:34:13,782 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-11-07 00:34:13,783 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-11-07 00:34:13,783 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) 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-11-07 00:34:13,783 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-11-07 00:34:13,783 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-11-07 00:34:13,783 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-07 00:34:13,783 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-07 00:34:13,784 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-11-07 00:34:13,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:13 BoogieIcfgContainer [2019-11-07 00:34:13,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:13,806 INFO L168 Benchmark]: Toolchain (without parser) took 4731.34 ms. Allocated memory was 146.3 MB in the beginning and 244.8 MB in the end (delta: 98.6 MB). Free memory was 104.3 MB in the beginning and 123.6 MB in the end (delta: -19.3 MB). Peak memory consumption was 79.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,807 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 104.0 MB in the beginning and 182.1 MB in the end (delta: -78.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,809 INFO L168 Benchmark]: Boogie Preprocessor took 58.79 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 180.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,810 INFO L168 Benchmark]: RCFGBuilder took 482.32 ms. Allocated memory is still 204.5 MB. Free memory was 180.1 MB in the beginning and 156.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,811 INFO L168 Benchmark]: TraceAbstraction took 3673.82 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 156.2 MB in the beginning and 123.6 MB in the end (delta: 32.7 MB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:13,815 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.24 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.07 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 104.0 MB in the beginning and 182.1 MB in the end (delta: -78.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.79 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 180.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 482.32 ms. Allocated memory is still 204.5 MB. Free memory was 180.1 MB in the beginning and 156.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3673.82 ms. Allocated memory was 204.5 MB in the beginning and 244.8 MB in the end (delta: 40.4 MB). Free memory was 156.2 MB in the beginning and 123.6 MB in the end (delta: 32.7 MB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. Result: SAFE, OverallTime: 3.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 801 SDtfs, 1294 SDslu, 816 SDs, 0 SdLazy, 999 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred 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, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 69 HoareAnnotationTreeSize, 9 FomulaSimplifications, 138182 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3250 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11064 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...