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-13a467a-m [2019-10-14 23:15:17,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:17,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:18,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:18,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:18,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:18,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:18,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:18,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:18,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:18,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:18,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:18,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:18,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:18,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:18,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:18,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:18,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:18,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:18,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:18,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:18,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:18,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:18,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:18,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:18,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:18,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:18,060 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:18,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:18,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:18,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:18,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:18,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:18,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:18,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:18,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:18,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:18,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:18,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:18,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:18,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:18,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:15:18,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:18,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:18,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:18,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:18,112 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:18,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:18,112 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:18,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:18,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:18,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:18,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:18,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:18,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:18,115 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:18,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:18,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:18,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:18,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:18,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:18,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:18,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:18,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:18,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:18,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:18,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:18,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:18,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:18,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:18,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:18,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:18,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:18,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:18,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:18,416 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:18,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-14 23:15:18,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1da25841/88c86aa2092547ab935d1b2d6b0e37b2/FLAG39983c8b2 [2019-10-14 23:15:18,949 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:18,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2019-10-14 23:15:18,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1da25841/88c86aa2092547ab935d1b2d6b0e37b2/FLAG39983c8b2 [2019-10-14 23:15:19,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1da25841/88c86aa2092547ab935d1b2d6b0e37b2 [2019-10-14 23:15:19,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:19,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:19,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:19,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:19,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:19,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af509e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19, skipping insertion in model container [2019-10-14 23:15:19,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,294 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:19,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:19,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:19,617 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:19,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:19,757 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:19,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19 WrapperNode [2019-10-14 23:15:19,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:19,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:19,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:19,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:19,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... [2019-10-14 23:15:19,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:19,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:19,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:19,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:19,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:20,292 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:20,292 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-14 23:15:20,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:20 BoogieIcfgContainer [2019-10-14 23:15:20,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:20,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:20,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:20,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:20,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:19" (1/3) ... [2019-10-14 23:15:20,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcd2a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:20, skipping insertion in model container [2019-10-14 23:15:20,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:19" (2/3) ... [2019-10-14 23:15:20,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcd2a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:20, skipping insertion in model container [2019-10-14 23:15:20,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:20" (3/3) ... [2019-10-14 23:15:20,304 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2019-10-14 23:15:20,316 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:20,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-14 23:15:20,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-14 23:15:20,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:20,362 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:20,363 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:20,363 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:20,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:20,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:20,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:20,364 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-10-14 23:15:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-14 23:15:20,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:20,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:20,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:20,402 INFO L82 PathProgramCache]: Analyzing trace with hash 288597337, now seen corresponding path program 1 times [2019-10-14 23:15:20,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:20,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963727284] [2019-10-14 23:15:20,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:20,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:20,686 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963727284] [2019-10-14 23:15:20,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:20,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:20,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720408344] [2019-10-14 23:15:20,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:20,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:20,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:20,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:20,706 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2019-10-14 23:15:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,132 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2019-10-14 23:15:21,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:21,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-14 23:15:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,144 INFO L225 Difference]: With dead ends: 135 [2019-10-14 23:15:21,144 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 23:15:21,147 INFO L600 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-10-14 23:15:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 23:15:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 73. [2019-10-14 23:15:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-10-14 23:15:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2019-10-14 23:15:21,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 12 [2019-10-14 23:15:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,191 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2019-10-14 23:15:21,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2019-10-14 23:15:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-14 23:15:21,192 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,192 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,194 INFO L82 PathProgramCache]: Analyzing trace with hash 285426585, now seen corresponding path program 1 times [2019-10-14 23:15:21,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822046320] [2019-10-14 23:15:21,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822046320] [2019-10-14 23:15:21,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:21,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367050753] [2019-10-14 23:15:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:21,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:21,300 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 5 states. [2019-10-14 23:15:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,495 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-10-14 23:15:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:21,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-14 23:15:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,498 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:15:21,498 INFO L226 Difference]: Without dead ends: 109 [2019-10-14 23:15:21,499 INFO L600 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-10-14 23:15:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-14 23:15:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 71. [2019-10-14 23:15:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-14 23:15:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-14 23:15:21,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 12 [2019-10-14 23:15:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,509 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-14 23:15:21,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-14 23:15:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:15:21,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,511 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -918238132, now seen corresponding path program 1 times [2019-10-14 23:15:21,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510600896] [2019-10-14 23:15:21,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,608 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510600896] [2019-10-14 23:15:21,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403106206] [2019-10-14 23:15:21,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,609 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,610 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2019-10-14 23:15:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:21,796 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-14 23:15:21,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:21,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-14 23:15:21,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:21,799 INFO L225 Difference]: With dead ends: 73 [2019-10-14 23:15:21,800 INFO L226 Difference]: Without dead ends: 71 [2019-10-14 23:15:21,800 INFO L600 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-10-14 23:15:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-14 23:15:21,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2019-10-14 23:15:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-14 23:15:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-14 23:15:21,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 15 [2019-10-14 23:15:21,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:21,818 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-14 23:15:21,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-14 23:15:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:15:21,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:21,820 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:21,821 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:21,821 INFO L82 PathProgramCache]: Analyzing trace with hash -888931738, now seen corresponding path program 1 times [2019-10-14 23:15:21,822 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:21,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649031984] [2019-10-14 23:15:21,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:21,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:21,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649031984] [2019-10-14 23:15:21,938 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:21,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:21,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347204710] [2019-10-14 23:15:21,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:21,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:21,941 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 6 states. [2019-10-14 23:15:22,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,116 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-10-14 23:15:22,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:22,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-10-14 23:15:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,118 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:15:22,119 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:15:22,120 INFO L600 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-10-14 23:15:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:15:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-14 23:15:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-14 23:15:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-14 23:15:22,127 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 15 [2019-10-14 23:15:22,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,128 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-14 23:15:22,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-14 23:15:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:22,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,129 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,130 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1599834060, now seen corresponding path program 1 times [2019-10-14 23:15:22,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359721674] [2019-10-14 23:15:22,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359721674] [2019-10-14 23:15:22,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:22,211 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770512075] [2019-10-14 23:15:22,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:22,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:22,217 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 6 states. [2019-10-14 23:15:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,486 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2019-10-14 23:15:22,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:22,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 23:15:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,487 INFO L225 Difference]: With dead ends: 116 [2019-10-14 23:15:22,488 INFO L226 Difference]: Without dead ends: 114 [2019-10-14 23:15:22,491 INFO L600 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-10-14 23:15:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-14 23:15:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 65. [2019-10-14 23:15:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 23:15:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-14 23:15:22,498 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 16 [2019-10-14 23:15:22,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,498 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-14 23:15:22,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-14 23:15:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:22,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1599820158, now seen corresponding path program 1 times [2019-10-14 23:15:22,502 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402112413] [2019-10-14 23:15:22,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,502 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402112413] [2019-10-14 23:15:22,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:22,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275181618] [2019-10-14 23:15:22,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:22,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:22,605 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2019-10-14 23:15:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:22,812 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-10-14 23:15:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:22,813 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 23:15:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:22,814 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:15:22,814 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 23:15:22,815 INFO L600 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-10-14 23:15:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 23:15:22,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2019-10-14 23:15:22,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:15:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-14 23:15:22,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 16 [2019-10-14 23:15:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:22,832 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-14 23:15:22,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-14 23:15:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:22,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:22,835 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:22,836 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1599392161, now seen corresponding path program 1 times [2019-10-14 23:15:22,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:22,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626133205] [2019-10-14 23:15:22,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:22,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626133205] [2019-10-14 23:15:22,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:22,913 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:22,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300264768] [2019-10-14 23:15:22,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:22,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:22,915 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 5 states. [2019-10-14 23:15:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,026 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-10-14 23:15:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:23,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:15:23,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,028 INFO L225 Difference]: With dead ends: 65 [2019-10-14 23:15:23,028 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:15:23,028 INFO L600 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-10-14 23:15:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:15:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-14 23:15:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 23:15:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-14 23:15:23,034 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 16 [2019-10-14 23:15:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,035 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-14 23:15:23,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-14 23:15:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:23,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,036 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1787077023, now seen corresponding path program 1 times [2019-10-14 23:15:23,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600155051] [2019-10-14 23:15:23,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600155051] [2019-10-14 23:15:23,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:23,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656943032] [2019-10-14 23:15:23,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:23,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:23,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:23,076 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-10-14 23:15:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,196 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-14 23:15:23,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:23,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-14 23:15:23,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,198 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:15:23,198 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:15:23,199 INFO L600 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-10-14 23:15:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:15:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-14 23:15:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-14 23:15:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-14 23:15:23,204 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 16 [2019-10-14 23:15:23,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,204 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-14 23:15:23,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-14 23:15:23,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:23,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,206 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1944748480, now seen corresponding path program 1 times [2019-10-14 23:15:23,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767169980] [2019-10-14 23:15:23,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767169980] [2019-10-14 23:15:23,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880913746] [2019-10-14 23:15:23,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,279 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2019-10-14 23:15:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,521 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-10-14 23:15:23,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:23,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:23,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,523 INFO L225 Difference]: With dead ends: 94 [2019-10-14 23:15:23,523 INFO L226 Difference]: Without dead ends: 92 [2019-10-14 23:15:23,523 INFO L600 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-10-14 23:15:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-14 23:15:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-14 23:15:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:15:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-14 23:15:23,528 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 17 [2019-10-14 23:15:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,529 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-14 23:15:23,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-14 23:15:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:23,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,530 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1945179456, now seen corresponding path program 1 times [2019-10-14 23:15:23,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093500517] [2019-10-14 23:15:23,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093500517] [2019-10-14 23:15:23,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136966251] [2019-10-14 23:15:23,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,590 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 6 states. [2019-10-14 23:15:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:23,827 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2019-10-14 23:15:23,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:23,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:23,828 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:15:23,828 INFO L226 Difference]: Without dead ends: 82 [2019-10-14 23:15:23,829 INFO L600 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-10-14 23:15:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-14 23:15:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2019-10-14 23:15:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-14 23:15:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-14 23:15:23,834 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2019-10-14 23:15:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:23,835 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-14 23:15:23,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-14 23:15:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:23,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:23,836 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:23,836 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:23,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:23,837 INFO L82 PathProgramCache]: Analyzing trace with hash 449409464, now seen corresponding path program 1 times [2019-10-14 23:15:23,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:23,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196241923] [2019-10-14 23:15:23,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,838 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:23,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:23,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196241923] [2019-10-14 23:15:23,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:23,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:23,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105451912] [2019-10-14 23:15:23,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:23,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:23,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:23,906 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2019-10-14 23:15:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,062 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-10-14 23:15:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:24,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,063 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:15:24,063 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:15:24,064 INFO L600 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-10-14 23:15:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:15:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 49. [2019-10-14 23:15:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-14 23:15:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-14 23:15:24,077 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2019-10-14 23:15:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,077 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-14 23:15:24,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-14 23:15:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 23:15:24,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,078 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:24,079 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 450948664, now seen corresponding path program 1 times [2019-10-14 23:15:24,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87971299] [2019-10-14 23:15:24,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:24,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87971299] [2019-10-14 23:15:24,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:24,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822412308] [2019-10-14 23:15:24,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:24,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:24,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:24,118 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2019-10-14 23:15:24,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,246 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-10-14 23:15:24,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:24,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-14 23:15:24,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,247 INFO L225 Difference]: With dead ends: 51 [2019-10-14 23:15:24,247 INFO L226 Difference]: Without dead ends: 49 [2019-10-14 23:15:24,247 INFO L600 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-10-14 23:15:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-14 23:15:24,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-14 23:15:24,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:15:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-14 23:15:24,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2019-10-14 23:15:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,252 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-14 23:15:24,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-14 23:15:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:24,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,254 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:24,254 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1048160016, now seen corresponding path program 1 times [2019-10-14 23:15:24,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086302471] [2019-10-14 23:15:24,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:24,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086302471] [2019-10-14 23:15:24,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:24,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930330173] [2019-10-14 23:15:24,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:24,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:24,295 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 6 states. [2019-10-14 23:15:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,424 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2019-10-14 23:15:24,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:24,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:24,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,425 INFO L225 Difference]: With dead ends: 69 [2019-10-14 23:15:24,425 INFO L226 Difference]: Without dead ends: 67 [2019-10-14 23:15:24,426 INFO L600 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-10-14 23:15:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-14 23:15:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2019-10-14 23:15:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-14 23:15:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-10-14 23:15:24,431 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2019-10-14 23:15:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,432 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-10-14 23:15:24,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-10-14 23:15:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:24,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,433 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:24,433 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1046794596, now seen corresponding path program 1 times [2019-10-14 23:15:24,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40790742] [2019-10-14 23:15:24,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:24,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40790742] [2019-10-14 23:15:24,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:24,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308121091] [2019-10-14 23:15:24,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:24,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:24,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:24,505 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2019-10-14 23:15:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,678 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-10-14 23:15:24,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:24,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:24,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,679 INFO L225 Difference]: With dead ends: 59 [2019-10-14 23:15:24,679 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 23:15:24,680 INFO L600 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-10-14 23:15:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 23:15:24,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-10-14 23:15:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:15:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-14 23:15:24,685 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2019-10-14 23:15:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,685 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-14 23:15:24,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-14 23:15:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:15:24,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:24,687 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1094509846, now seen corresponding path program 1 times [2019-10-14 23:15:24,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721702304] [2019-10-14 23:15:24,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:24,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721702304] [2019-10-14 23:15:24,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:24,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724486004] [2019-10-14 23:15:24,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:24,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:24,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:24,744 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states. [2019-10-14 23:15:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:24,849 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-10-14 23:15:24,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:24,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-14 23:15:24,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:24,850 INFO L225 Difference]: With dead ends: 43 [2019-10-14 23:15:24,850 INFO L226 Difference]: Without dead ends: 39 [2019-10-14 23:15:24,851 INFO L600 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-10-14 23:15:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-14 23:15:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-10-14 23:15:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-14 23:15:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-14 23:15:24,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2019-10-14 23:15:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:24,855 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-14 23:15:24,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-14 23:15:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-14 23:15:24,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:24,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:24,856 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1866774741, now seen corresponding path program 1 times [2019-10-14 23:15:24,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:24,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677326695] [2019-10-14 23:15:24,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:24,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:24,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677326695] [2019-10-14 23:15:24,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:24,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:24,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685099408] [2019-10-14 23:15:24,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:24,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:24,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:24,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:24,911 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-10-14 23:15:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:25,078 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2019-10-14 23:15:25,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:25,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-14 23:15:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:25,079 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:15:25,079 INFO L226 Difference]: Without dead ends: 52 [2019-10-14 23:15:25,080 INFO L600 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-10-14 23:15:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-14 23:15:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-10-14 23:15:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 23:15:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-14 23:15:25,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2019-10-14 23:15:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:25,084 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-14 23:15:25,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-14 23:15:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:15:25,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:25,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:25,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:25,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:25,087 INFO L82 PathProgramCache]: Analyzing trace with hash 947355911, now seen corresponding path program 1 times [2019-10-14 23:15:25,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:25,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262137666] [2019-10-14 23:15:25,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:25,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262137666] [2019-10-14 23:15:25,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:25,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:25,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065422675] [2019-10-14 23:15:25,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:25,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:25,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:25,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:25,155 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2019-10-14 23:15:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:25,290 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-10-14 23:15:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:25,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 23:15:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:25,294 INFO L225 Difference]: With dead ends: 56 [2019-10-14 23:15:25,294 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 23:15:25,294 INFO L600 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-10-14 23:15:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 23:15:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2019-10-14 23:15:25,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-14 23:15:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-10-14 23:15:25,299 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2019-10-14 23:15:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:25,299 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-10-14 23:15:25,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-10-14 23:15:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:15:25,300 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:25,300 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:25,301 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:25,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -696734716, now seen corresponding path program 1 times [2019-10-14 23:15:25,302 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:25,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349907839] [2019-10-14 23:15:25,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,302 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:25,347 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349907839] [2019-10-14 23:15:25,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:25,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:25,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959465921] [2019-10-14 23:15:25,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:25,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:25,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:25,349 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2019-10-14 23:15:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:25,422 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-10-14 23:15:25,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:25,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-14 23:15:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:25,423 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:15:25,423 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:25,423 INFO L600 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-10-14 23:15:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:25,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-10-14 23:15:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:25,424 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:25,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:25,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:25,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:25,713 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:25,713 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-10-14 23:15:25,713 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:25,713 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:25,714 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 390) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 385) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 239) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 397) no Hoare annotation was computed. [2019-10-14 23:15:25,714 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 391) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 361) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point L77(lines 77 87) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 157) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point L292(line 292) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 196) no Hoare annotation was computed. [2019-10-14 23:15:25,715 INFO L446 ceAbstractionStarter]: At program point L309(lines 27 390) the Hoare annotation is: true [2019-10-14 23:15:25,715 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 304) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L210(lines 210 245) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 248) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 79) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 193) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 382) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 349) no Hoare annotation was computed. [2019-10-14 23:15:25,716 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 388) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point L128(lines 128 195) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L439 ceAbstractionStarter]: At program point L244(lines 96 246) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 1 main_~main__t~0)) [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 171) no Hoare annotation was computed. [2019-10-14 23:15:25,717 INFO L443 ceAbstractionStarter]: For program point L302(lines 302 310) no Hoare annotation was computed. [2019-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 397) no Hoare annotation was computed. [2019-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 246) no Hoare annotation was computed. [2019-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 384) no Hoare annotation was computed. [2019-10-14 23:15:25,718 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-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-14 23:15:25,718 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 340) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L361(line 361) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L328(line 328) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 237) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 292) no Hoare annotation was computed. [2019-10-14 23:15:25,719 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 155) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L443 ceAbstractionStarter]: For program point L304(line 304) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 396) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L443 ceAbstractionStarter]: For program point L271(lines 271 386) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 67) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 89) no Hoare annotation was computed. [2019-10-14 23:15:25,720 INFO L439 ceAbstractionStarter]: At program point L379(lines 277 386) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-14 23:15:25,720 INFO L439 ceAbstractionStarter]: At program point L346(lines 27 390) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 191) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 380) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 373) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2019-10-14 23:15:25,721 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 198) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L231(line 231) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L439 ceAbstractionStarter]: At program point L190(lines 51 248) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 1 main_~main__t~0)) [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 328) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L273(line 273) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L100(lines 100 204) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-14 23:15:25,722 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 250) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point L290(lines 290 312) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 273) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point L373(line 373) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point L340(line 340) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 183) no Hoare annotation was computed. [2019-10-14 23:15:25,723 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2019-10-14 23:15:25,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:25 BoogieIcfgContainer [2019-10-14 23:15:25,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:25,743 INFO L168 Benchmark]: Toolchain (without parser) took 6464.47 ms. Allocated memory was 138.9 MB in the beginning and 276.3 MB in the end (delta: 137.4 MB). Free memory was 102.1 MB in the beginning and 136.8 MB in the end (delta: -34.8 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,743 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.27 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.9 MB in the beginning and 183.0 MB in the end (delta: -81.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,745 INFO L168 Benchmark]: Boogie Preprocessor took 51.96 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 181.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,746 INFO L168 Benchmark]: RCFGBuilder took 482.71 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 156.3 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,747 INFO L168 Benchmark]: TraceAbstraction took 5444.99 ms. Allocated memory was 204.5 MB in the beginning and 276.3 MB in the end (delta: 71.8 MB). Free memory was 156.3 MB in the beginning and 136.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 91.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:25,750 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 480.27 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.9 MB in the beginning and 183.0 MB in the end (delta: -81.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.96 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 181.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 482.71 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 156.3 MB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5444.99 ms. Allocated memory was 204.5 MB in the beginning and 276.3 MB in the end (delta: 71.8 MB). Free memory was 156.3 MB in the beginning and 136.8 MB in the end (delta: 19.5 MB). Peak memory consumption was 91.3 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: 47]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 373]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 183]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 219]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 328]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 273]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 304]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 340]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 137]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 292]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 109]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 171]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 149]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 79]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 121]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 849 SDtfs, 1566 SDslu, 852 SDs, 0 SdLazy, 2344 SolverSat, 149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s 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.0s 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...