/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 -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:22:19,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:22:19,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:22:19,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:22:19,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:22:19,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:22:19,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:22:19,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:22:19,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:22:19,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:22:19,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:22:19,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:22:19,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:22:19,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:22:19,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:22:19,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:22:19,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:22:19,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:22:19,900 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:22:19,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:22:19,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:22:19,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:22:19,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:22:19,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:22:19,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:22:19,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:22:19,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:22:19,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:22:19,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:22:19,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:22:19,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:22:19,917 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:22:19,918 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:22:19,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:22:19,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:22:19,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:22:19,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:22:19,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:22:19,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:22:19,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:22:19,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:22:19,928 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-06 21:22:19,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:22:19,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:22:19,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:22:19,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:22:19,957 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:22:19,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:22:19,957 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:22:19,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:22:19,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:22:19,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:22:19,959 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:22:19,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:22:19,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:22:19,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:22:19,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:22:19,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:22:19,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:22:19,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:22:19,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:22:20,240 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:22:20,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:22:20,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:22:20,266 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:22:20,266 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:22:20,267 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-06 21:22:20,342 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d58bda9b/84d8fe876d7d48049ff623636d41deb3/FLAGef189656c [2019-11-06 21:22:20,766 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:22:20,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-11-06 21:22:20,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d58bda9b/84d8fe876d7d48049ff623636d41deb3/FLAGef189656c [2019-11-06 21:22:21,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d58bda9b/84d8fe876d7d48049ff623636d41deb3 [2019-11-06 21:22:21,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:22:21,138 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:22:21,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:21,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:22:21,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:22:21,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2109e484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21, skipping insertion in model container [2019-11-06 21:22:21,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,154 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:22:21,196 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:22:21,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:21,472 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:22:21,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:22:21,628 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:22:21,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21 WrapperNode [2019-11-06 21:22:21,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:22:21,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:22:21,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:22:21,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:22:21,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (1/1) ... [2019-11-06 21:22:21,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:22:21,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:22:21,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:22:21,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:22:21,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (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-06 21:22:21,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:22:21,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:22:21,737 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:22:21,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:22:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:22:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:22:21,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:22:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:22:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:22:21,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:22:22,153 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:22:22,154 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:22:22,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:22 BoogieIcfgContainer [2019-11-06 21:22:22,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:22:22,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:22:22,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:22:22,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:22:22,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:22:21" (1/3) ... [2019-11-06 21:22:22,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4101db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:22, skipping insertion in model container [2019-11-06 21:22:22,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:22:21" (2/3) ... [2019-11-06 21:22:22,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4101db2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:22:22, skipping insertion in model container [2019-11-06 21:22:22,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:22:22" (3/3) ... [2019-11-06 21:22:22,163 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-11-06 21:22:22,173 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:22:22,196 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-06 21:22:22,208 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-06 21:22:22,255 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:22:22,255 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:22:22,256 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:22:22,256 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:22:22,256 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:22:22,256 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:22:22,256 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:22:22,257 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:22:22,290 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-06 21:22:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 21:22:22,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:22,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:22,301 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-11-06 21:22:22,315 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:22,316 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503047371] [2019-11-06 21:22:22,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:22,568 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-06 21:22:22,571 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503047371] [2019-11-06 21:22:22,572 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:22,573 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:22,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074291230] [2019-11-06 21:22:22,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:22,582 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:22,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:22,601 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2019-11-06 21:22:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,125 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2019-11-06 21:22:23,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:23,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-06 21:22:23,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,140 INFO L225 Difference]: With dead ends: 135 [2019-11-06 21:22:23,140 INFO L226 Difference]: Without dead ends: 111 [2019-11-06 21:22:23,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-06 21:22:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-11-06 21:22:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-06 21:22:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-11-06 21:22:23,195 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-11-06 21:22:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,195 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-11-06 21:22:23,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-11-06 21:22:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-06 21:22:23,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,198 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,198 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-11-06 21:22:23,199 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,199 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859480482] [2019-11-06 21:22:23,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,329 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-06 21:22:23,330 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859480482] [2019-11-06 21:22:23,330 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,330 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:23,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024838228] [2019-11-06 21:22:23,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:23,337 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:23,338 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2019-11-06 21:22:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,569 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-11-06 21:22:23,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:23,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-06 21:22:23,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,571 INFO L225 Difference]: With dead ends: 111 [2019-11-06 21:22:23,571 INFO L226 Difference]: Without dead ends: 109 [2019-11-06 21:22:23,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-06 21:22:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-11-06 21:22:23,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-06 21:22:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-11-06 21:22:23,582 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-11-06 21:22:23,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,583 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-11-06 21:22:23,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-11-06 21:22:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:23,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,585 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-11-06 21:22:23,586 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,586 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212300001] [2019-11-06 21:22:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:23,672 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-06 21:22:23,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212300001] [2019-11-06 21:22:23,673 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:23,673 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:23,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200094102] [2019-11-06 21:22:23,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:23,674 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:23,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:23,676 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2019-11-06 21:22:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:23,895 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-11-06 21:22:23,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:23,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-06 21:22:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:23,898 INFO L225 Difference]: With dead ends: 73 [2019-11-06 21:22:23,898 INFO L226 Difference]: Without dead ends: 71 [2019-11-06 21:22:23,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-06 21:22:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-11-06 21:22:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-06 21:22:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-11-06 21:22:23,917 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-11-06 21:22:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:23,917 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-11-06 21:22:23,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-11-06 21:22:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:22:23,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:23,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:23,925 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-11-06 21:22:23,926 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:23,926 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612970775] [2019-11-06 21:22:23,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,022 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-06 21:22:24,028 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612970775] [2019-11-06 21:22:24,028 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,029 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229935770] [2019-11-06 21:22:24,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,030 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,031 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-11-06 21:22:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,211 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-11-06 21:22:24,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:24,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-06 21:22:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,213 INFO L225 Difference]: With dead ends: 71 [2019-11-06 21:22:24,213 INFO L226 Difference]: Without dead ends: 69 [2019-11-06 21:22:24,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-06 21:22:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-11-06 21:22:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-06 21:22:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-11-06 21:22:24,222 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-11-06 21:22:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,222 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-11-06 21:22:24,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-11-06 21:22:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:24,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:24,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-11-06 21:22:24,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891124049] [2019-11-06 21:22:24,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,292 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-06 21:22:24,293 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891124049] [2019-11-06 21:22:24,293 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,293 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075096991] [2019-11-06 21:22:24,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,294 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,295 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-11-06 21:22:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,573 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-11-06 21:22:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:24,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 21:22:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,576 INFO L225 Difference]: With dead ends: 116 [2019-11-06 21:22:24,576 INFO L226 Difference]: Without dead ends: 114 [2019-11-06 21:22:24,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:24,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-06 21:22:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-11-06 21:22:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 21:22:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-06 21:22:24,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-11-06 21:22:24,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,584 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-06 21:22:24,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,584 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-06 21:22:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:24,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:24,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-11-06 21:22:24,587 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,587 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129664474] [2019-11-06 21:22:24,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,681 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-06 21:22:24,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129664474] [2019-11-06 21:22:24,682 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,682 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:24,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473586679] [2019-11-06 21:22:24,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:24,683 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:24,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:24,684 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-11-06 21:22:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:24,905 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-06 21:22:24,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:24,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-06 21:22:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:24,907 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:22:24,907 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 21:22:24,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:24,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 21:22:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-11-06 21:22:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-06 21:22:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-06 21:22:24,915 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-11-06 21:22:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:24,916 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-06 21:22:24,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-06 21:22:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:24,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:24,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:24,918 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-11-06 21:22:24,918 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:24,919 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056838781] [2019-11-06 21:22:24,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:24,977 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-06 21:22:24,978 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056838781] [2019-11-06 21:22:24,978 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:24,978 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834046637] [2019-11-06 21:22:24,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:24,979 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:24,980 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-11-06 21:22:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,121 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-11-06 21:22:25,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:25,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,124 INFO L225 Difference]: With dead ends: 65 [2019-11-06 21:22:25,124 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:22:25,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:22:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-06 21:22:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-06 21:22:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-06 21:22:25,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-11-06 21:22:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,131 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-06 21:22:25,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-06 21:22:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:22:25,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,132 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:25,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-11-06 21:22:25,133 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,134 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579809985] [2019-11-06 21:22:25,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,195 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-06 21:22:25,199 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579809985] [2019-11-06 21:22:25,199 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:25,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034439763] [2019-11-06 21:22:25,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:25,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:25,201 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-11-06 21:22:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,323 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-11-06 21:22:25,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:25,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-06 21:22:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,325 INFO L225 Difference]: With dead ends: 61 [2019-11-06 21:22:25,325 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:22:25,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:22:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-11-06 21:22:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-06 21:22:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-11-06 21:22:25,332 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-11-06 21:22:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,332 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-11-06 21:22:25,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-11-06 21:22:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:25,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,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-06 21:22:25,334 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-11-06 21:22:25,334 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,335 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396932695] [2019-11-06 21:22:25,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,409 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-06 21:22:25,410 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396932695] [2019-11-06 21:22:25,410 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,410 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:25,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158677716] [2019-11-06 21:22:25,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:25,411 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:25,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:25,412 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2019-11-06 21:22:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:25,705 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-11-06 21:22:25,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:25,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:25,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:25,707 INFO L225 Difference]: With dead ends: 94 [2019-11-06 21:22:25,707 INFO L226 Difference]: Without dead ends: 92 [2019-11-06 21:22:25,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-06 21:22:25,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-11-06 21:22:25,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 21:22:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-06 21:22:25,713 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-11-06 21:22:25,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:25,713 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-06 21:22:25,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-06 21:22:25,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:25,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:25,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:25,715 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:25,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:25,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-11-06 21:22:25,716 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:25,716 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68175428] [2019-11-06 21:22:25,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:25,799 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-06 21:22:25,799 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68175428] [2019-11-06 21:22:25,799 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:25,800 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:25,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178813149] [2019-11-06 21:22:25,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:25,801 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:25,801 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2019-11-06 21:22:26,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,048 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-11-06 21:22:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:26,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,054 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:22:26,054 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 21:22:26,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 21:22:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-11-06 21:22:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-06 21:22:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-11-06 21:22:26,060 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-11-06 21:22:26,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,060 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-11-06 21:22:26,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-11-06 21:22:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:26,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:26,062 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,062 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-11-06 21:22:26,063 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,063 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145546776] [2019-11-06 21:22:26,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,128 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-06 21:22:26,129 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145546776] [2019-11-06 21:22:26,129 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,129 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524527823] [2019-11-06 21:22:26,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,130 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,131 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2019-11-06 21:22:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,288 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-06 21:22:26,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,290 INFO L225 Difference]: With dead ends: 70 [2019-11-06 21:22:26,290 INFO L226 Difference]: Without dead ends: 68 [2019-11-06 21:22:26,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-06 21:22:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-11-06 21:22:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-06 21:22:26,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-11-06 21:22:26,296 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-11-06 21:22:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,296 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-11-06 21:22:26,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,296 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-11-06 21:22:26,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:22:26,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:22:26,298 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-11-06 21:22:26,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,299 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853547274] [2019-11-06 21:22:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,348 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-06 21:22:26,348 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853547274] [2019-11-06 21:22:26,348 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,348 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668146071] [2019-11-06 21:22:26,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,350 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2019-11-06 21:22:26,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,495 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-06 21:22:26,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-06 21:22:26,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,496 INFO L225 Difference]: With dead ends: 51 [2019-11-06 21:22:26,496 INFO L226 Difference]: Without dead ends: 49 [2019-11-06 21:22:26,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-06 21:22:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-11-06 21:22:26,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:22:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-06 21:22:26,500 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-11-06 21:22:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,501 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-06 21:22:26,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-06 21:22:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,502 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-06 21:22:26,503 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-11-06 21:22:26,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25543640] [2019-11-06 21:22:26,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,546 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-06 21:22:26,546 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25543640] [2019-11-06 21:22:26,546 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,547 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718122876] [2019-11-06 21:22:26,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,548 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,549 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-11-06 21:22:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,696 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-11-06 21:22:26,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:22:26,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,697 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:22:26,697 INFO L226 Difference]: Without dead ends: 67 [2019-11-06 21:22:26,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:22:26,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-06 21:22:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-11-06 21:22:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 21:22:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-06 21:22:26,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-11-06 21:22:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,702 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-06 21:22:26,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-06 21:22:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,703 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-06 21:22:26,704 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-11-06 21:22:26,704 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43130624] [2019-11-06 21:22:26,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:26,766 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-06 21:22:26,766 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43130624] [2019-11-06 21:22:26,766 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:26,766 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:26,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635449187] [2019-11-06 21:22:26,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:26,767 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:26,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:26,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:26,768 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-11-06 21:22:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:26,945 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-06 21:22:26,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:26,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:26,946 INFO L225 Difference]: With dead ends: 59 [2019-11-06 21:22:26,946 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:22:26,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:22:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-11-06 21:22:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-06 21:22:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-06 21:22:26,952 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-11-06 21:22:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:26,952 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-06 21:22:26,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-06 21:22:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:22:26,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:26,953 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-06 21:22:26,954 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-11-06 21:22:26,955 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:26,955 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963263734] [2019-11-06 21:22:26,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,024 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-06 21:22:27,025 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963263734] [2019-11-06 21:22:27,025 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,025 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:27,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432129366] [2019-11-06 21:22:27,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:27,026 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:27,026 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-11-06 21:22:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,138 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-06 21:22:27,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:27,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-06 21:22:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,139 INFO L225 Difference]: With dead ends: 43 [2019-11-06 21:22:27,139 INFO L226 Difference]: Without dead ends: 39 [2019-11-06 21:22:27,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:27,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-06 21:22:27,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-06 21:22:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 21:22:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-06 21:22:27,144 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-11-06 21:22:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,144 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-06 21:22:27,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:27,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-06 21:22:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 21:22:27,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,145 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-06 21:22:27,146 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-11-06 21:22:27,146 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956162223] [2019-11-06 21:22:27,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,222 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-06 21:22:27,223 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956162223] [2019-11-06 21:22:27,224 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:22:27,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313477661] [2019-11-06 21:22:27,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:22:27,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:22:27,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:22:27,227 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-11-06 21:22:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,370 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-11-06 21:22:27,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:22:27,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 21:22:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,371 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:22:27,371 INFO L226 Difference]: Without dead ends: 52 [2019-11-06 21:22:27,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:22:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-06 21:22:27,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-11-06 21:22:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:22:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-06 21:22:27,376 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-11-06 21:22:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,377 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-06 21:22:27,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:22:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-06 21:22:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:22:27,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,378 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-06 21:22:27,379 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,379 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-11-06 21:22:27,379 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,379 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338079345] [2019-11-06 21:22:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,446 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-06 21:22:27,447 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338079345] [2019-11-06 21:22:27,447 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,447 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:22:27,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146264359] [2019-11-06 21:22:27,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:22:27,448 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:22:27,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:27,448 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2019-11-06 21:22:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,599 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-11-06 21:22:27,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:22:27,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-06 21:22:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,602 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:22:27,603 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:22:27,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:22:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:22:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-11-06 21:22:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-06 21:22:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-11-06 21:22:27,609 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-11-06 21:22:27,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,609 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-11-06 21:22:27,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:22:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-11-06 21:22:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:22:27,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:22:27,610 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-06 21:22:27,611 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:22:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:22:27,612 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-11-06 21:22:27,612 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:22:27,612 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895755395] [2019-11-06 21:22:27,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:22:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:22:27,663 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-06 21:22:27,663 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895755395] [2019-11-06 21:22:27,664 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:22:27,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:22:27,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040416353] [2019-11-06 21:22:27,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:22:27,664 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:22:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:22:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:22:27,665 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-11-06 21:22:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:22:27,749 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-06 21:22:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:22:27,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-06 21:22:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:22:27,750 INFO L225 Difference]: With dead ends: 37 [2019-11-06 21:22:27,750 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:22:27,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:22:27,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:22:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:22:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:22:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:22:27,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-11-06 21:22:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:22:27,752 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:22:27,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:22:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:22:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:22:27,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:22:28,097 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,098 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= ~__tmp_259_0~0 |old(~__tmp_259_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|)) [2019-11-06 21:22:28,098 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,098 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,098 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:22:28,098 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:22:28,098 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:22:28,098 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-11-06 21:22:28,099 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-11-06 21:22:28,099 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-11-06 21:22:28,099 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-11-06 21:22:28,099 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-11-06 21:22:28,100 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-11-06 21:22:28,101 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-11-06 21:22:28,101 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-11-06 21:22:28,101 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-11-06 21:22:28,101 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-11-06 21:22:28,102 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-11-06 21:22:28,102 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-11-06 21:22:28,102 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-11-06 21:22:28,102 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-11-06 21:22:28,102 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-11-06 21:22:28,103 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-11-06 21:22:28,103 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-06 21:22:28,103 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-11-06 21:22:28,103 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-06 21:22:28,104 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-11-06 21:22:28,104 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-11-06 21:22:28,104 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-06 21:22:28,104 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 10 397) the Hoare annotation is: (and (= ~__tmp_383_0~0 |old(~__tmp_383_0~0)|) (= ~__tmp_259_0~0 |old(~__tmp_259_0~0)|) (= ~__return_305~0 |old(~__return_305~0)|)) [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-06 21:22:28,105 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-11-06 21:22:28,106 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-11-06 21:22:28,107 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-11-06 21:22:28,107 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-06 21:22:28,107 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-11-06 21:22:28,107 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-11-06 21:22:28,107 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-11-06 21:22:28,107 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-11-06 21:22:28,107 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-11-06 21:22:28,108 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-11-06 21:22:28,108 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-11-06 21:22:28,109 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-11-06 21:22:28,110 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-11-06 21:22:28,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:22:28 BoogieIcfgContainer [2019-11-06 21:22:28,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:22:28,135 INFO L168 Benchmark]: Toolchain (without parser) took 6996.53 ms. Allocated memory was 145.8 MB in the beginning and 275.3 MB in the end (delta: 129.5 MB). Free memory was 102.4 MB in the beginning and 138.3 MB in the end (delta: -35.9 MB). Peak memory consumption was 93.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,136 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.03 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 182.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,138 INFO L168 Benchmark]: Boogie Preprocessor took 44.33 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,138 INFO L168 Benchmark]: RCFGBuilder took 480.41 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 154.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,139 INFO L168 Benchmark]: TraceAbstraction took 5976.02 ms. Allocated memory was 203.4 MB in the beginning and 275.3 MB in the end (delta: 71.8 MB). Free memory was 154.9 MB in the beginning and 138.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:22:28,143 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.37 ms. Allocated memory is still 145.8 MB. Free memory was 120.7 MB in the beginning and 120.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 491.03 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 182.1 MB in the end (delta: -80.1 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.33 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 480.41 ms. Allocated memory is still 203.4 MB. Free memory was 180.1 MB in the beginning and 154.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5976.02 ms. Allocated memory was 203.4 MB in the beginning and 275.3 MB in the end (delta: 71.8 MB). Free memory was 154.9 MB in the beginning and 138.3 MB in the end (delta: 16.5 MB). Peak memory consumption was 88.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 67]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 361]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 1 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 80 locations, 18 error locations. Result: SAFE, OverallTime: 5.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 849 SDtfs, 1566 SDslu, 852 SDs, 0 SdLazy, 2344 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 330 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 71 HoareAnnotationTreeSize, 9 FomulaSimplifications, 849927 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2631 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 14546 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...