/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:10:46,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:10:46,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:10:46,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:10:46,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:10:46,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:10:46,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:10:46,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:10:46,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:10:46,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:10:46,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:10:46,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:10:46,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:10:46,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:10:46,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:10:46,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:10:46,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:10:46,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:10:46,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:10:46,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:10:46,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:10:46,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:10:46,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:10:46,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:10:46,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:10:46,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:10:46,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:10:46,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:10:46,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:10:46,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:10:46,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:10:46,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:10:46,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:10:46,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:10:46,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:10:46,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:10:46,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:10:46,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:10:46,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:10:46,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:10:46,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:10:46,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:10:46,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:10:46,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:10:46,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:10:46,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:10:46,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:10:46,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:10:46,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:10:46,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:10:46,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:10:46,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:10:46,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:10:46,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:10:46,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:10:46,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:10:46,534 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:10:46,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:10:46,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:10:46,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:10:46,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:10:46,535 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:10:46,535 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:10:46,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:10:46,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:10:46,536 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:10:46,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:10:46,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:10:46,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:10:46,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:10:46,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:10:46,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:10:46,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:10:46,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:10:46,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:10:46,838 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:10:46,839 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:10:46,840 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.p+lhb-reducer.c [2019-11-23 22:10:46,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf657a598/2084f5e3682d494abe76682f65c9dba2/FLAG965531b0a [2019-11-23 22:10:47,428 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:10:47,429 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2019-11-23 22:10:47,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf657a598/2084f5e3682d494abe76682f65c9dba2/FLAG965531b0a [2019-11-23 22:10:47,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf657a598/2084f5e3682d494abe76682f65c9dba2 [2019-11-23 22:10:47,755 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:10:47,757 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:10:47,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:10:47,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:10:47,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:10:47,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:47" (1/1) ... [2019-11-23 22:10:47,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182f03c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:47, skipping insertion in model container [2019-11-23 22:10:47,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:10:47" (1/1) ... [2019-11-23 22:10:47,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:10:47,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:10:48,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:10:48,098 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:10:48,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:10:48,281 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:10:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48 WrapperNode [2019-11-23 22:10:48,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:10:48,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:10:48,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:10:48,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:10:48,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:10:48,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:10:48,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:10:48,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:10:48,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... [2019-11-23 22:10:48,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:10:48,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:10:48,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:10:48,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:10:48,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:10:48,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:10:48,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:10:49,230 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:10:49,231 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:10:49,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:49 BoogieIcfgContainer [2019-11-23 22:10:49,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:10:49,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:10:49,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:10:49,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:10:49,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:10:47" (1/3) ... [2019-11-23 22:10:49,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3103b509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:49, skipping insertion in model container [2019-11-23 22:10:49,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:10:48" (2/3) ... [2019-11-23 22:10:49,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3103b509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:10:49, skipping insertion in model container [2019-11-23 22:10:49,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:10:49" (3/3) ... [2019-11-23 22:10:49,242 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2019-11-23 22:10:49,251 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:10:49,259 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-23 22:10:49,271 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-23 22:10:49,296 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:10:49,297 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:10:49,297 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:10:49,297 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:10:49,297 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:10:49,297 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:10:49,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:10:49,298 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:10:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-23 22:10:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-23 22:10:49,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,323 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2019-11-23 22:10:49,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656993115] [2019-11-23 22:10:49,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:49,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656993115] [2019-11-23 22:10:49,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:49,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:10:49,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642358918] [2019-11-23 22:10:49,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:49,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:49,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:49,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:10:49,516 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2019-11-23 22:10:49,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:49,900 INFO L93 Difference]: Finished difference Result 131 states and 205 transitions. [2019-11-23 22:10:49,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:10:49,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-23 22:10:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:49,917 INFO L225 Difference]: With dead ends: 131 [2019-11-23 22:10:49,917 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:10:49,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:10:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-23 22:10:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:10:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2019-11-23 22:10:49,969 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 7 [2019-11-23 22:10:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:49,970 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2019-11-23 22:10:49,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2019-11-23 22:10:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-23 22:10:49,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:49,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:49,972 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2019-11-23 22:10:49,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:49,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938728788] [2019-11-23 22:10:49,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938728788] [2019-11-23 22:10:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:10:50,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961401410] [2019-11-23 22:10:50,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:50,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:10:50,034 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 4 states. [2019-11-23 22:10:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,225 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2019-11-23 22:10:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:10:50,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-23 22:10:50,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,227 INFO L225 Difference]: With dead ends: 114 [2019-11-23 22:10:50,228 INFO L226 Difference]: Without dead ends: 109 [2019-11-23 22:10:50,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-23 22:10:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-23 22:10:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-23 22:10:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-11-23 22:10:50,239 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 8 [2019-11-23 22:10:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,240 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-11-23 22:10:50,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-11-23 22:10:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:10:50,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash -639549266, now seen corresponding path program 1 times [2019-11-23 22:10:50,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126221071] [2019-11-23 22:10:50,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126221071] [2019-11-23 22:10:50,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380405674] [2019-11-23 22:10:50,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,305 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 5 states. [2019-11-23 22:10:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,570 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2019-11-23 22:10:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:50,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-23 22:10:50,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,572 INFO L225 Difference]: With dead ends: 109 [2019-11-23 22:10:50,572 INFO L226 Difference]: Without dead ends: 107 [2019-11-23 22:10:50,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-23 22:10:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-23 22:10:50,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-23 22:10:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2019-11-23 22:10:50,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 11 [2019-11-23 22:10:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,591 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2019-11-23 22:10:50,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2019-11-23 22:10:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-23 22:10:50,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1648813321, now seen corresponding path program 1 times [2019-11-23 22:10:50,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783681448] [2019-11-23 22:10:50,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783681448] [2019-11-23 22:10:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:10:50,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947329532] [2019-11-23 22:10:50,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:50,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:10:50,681 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand 4 states. [2019-11-23 22:10:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:50,832 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2019-11-23 22:10:50,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:10:50,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-23 22:10:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:50,834 INFO L225 Difference]: With dead ends: 107 [2019-11-23 22:10:50,834 INFO L226 Difference]: Without dead ends: 103 [2019-11-23 22:10:50,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-23 22:10:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-23 22:10:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-23 22:10:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2019-11-23 22:10:50,848 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 12 [2019-11-23 22:10:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:50,849 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2019-11-23 22:10:50,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2019-11-23 22:10:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:10:50,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:50,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:50,851 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash -411248735, now seen corresponding path program 1 times [2019-11-23 22:10:50,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:50,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864829231] [2019-11-23 22:10:50,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:50,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864829231] [2019-11-23 22:10:50,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:50,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:50,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662015152] [2019-11-23 22:10:50,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:50,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:50,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:50,947 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 5 states. [2019-11-23 22:10:51,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,181 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-11-23 22:10:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:51,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-23 22:10:51,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,183 INFO L225 Difference]: With dead ends: 121 [2019-11-23 22:10:51,183 INFO L226 Difference]: Without dead ends: 119 [2019-11-23 22:10:51,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-23 22:10:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2019-11-23 22:10:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-23 22:10:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-11-23 22:10:51,199 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 13 [2019-11-23 22:10:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,199 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-11-23 22:10:51,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-11-23 22:10:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:10:51,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:51,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:51,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash -409524831, now seen corresponding path program 1 times [2019-11-23 22:10:51,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:51,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059000980] [2019-11-23 22:10:51,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:51,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059000980] [2019-11-23 22:10:51,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:51,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:10:51,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638694719] [2019-11-23 22:10:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:10:51,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:10:51,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:51,321 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 6 states. [2019-11-23 22:10:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,510 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2019-11-23 22:10:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:51,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-23 22:10:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,511 INFO L225 Difference]: With dead ends: 101 [2019-11-23 22:10:51,512 INFO L226 Difference]: Without dead ends: 99 [2019-11-23 22:10:51,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-23 22:10:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-11-23 22:10:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-23 22:10:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-11-23 22:10:51,518 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 13 [2019-11-23 22:10:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,518 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-11-23 22:10:51,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:10:51,519 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-11-23 22:10:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:10:51,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:51,519 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:51,520 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash 136195212, now seen corresponding path program 1 times [2019-11-23 22:10:51,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:51,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370208893] [2019-11-23 22:10:51,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:51,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370208893] [2019-11-23 22:10:51,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:51,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:51,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860507541] [2019-11-23 22:10:51,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:51,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:51,609 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2019-11-23 22:10:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:51,809 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-11-23 22:10:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:51,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-23 22:10:51,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:51,811 INFO L225 Difference]: With dead ends: 116 [2019-11-23 22:10:51,811 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:10:51,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:10:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2019-11-23 22:10:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-23 22:10:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-23 22:10:51,817 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 14 [2019-11-23 22:10:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:51,817 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-23 22:10:51,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-23 22:10:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:10:51,818 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:51,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:51,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash 137742357, now seen corresponding path program 1 times [2019-11-23 22:10:51,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:51,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842794885] [2019-11-23 22:10:51,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:51,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842794885] [2019-11-23 22:10:51,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:51,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:51,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696018027] [2019-11-23 22:10:51,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:51,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:51,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:51,872 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2019-11-23 22:10:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:52,068 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-11-23 22:10:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:52,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-23 22:10:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:52,070 INFO L225 Difference]: With dead ends: 116 [2019-11-23 22:10:52,070 INFO L226 Difference]: Without dead ends: 114 [2019-11-23 22:10:52,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-23 22:10:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2019-11-23 22:10:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-23 22:10:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2019-11-23 22:10:52,077 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 14 [2019-11-23 22:10:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2019-11-23 22:10:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2019-11-23 22:10:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:10:52,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:52,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:52,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:52,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash 189636292, now seen corresponding path program 1 times [2019-11-23 22:10:52,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:52,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638987572] [2019-11-23 22:10:52,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:52,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638987572] [2019-11-23 22:10:52,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:52,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:52,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007256768] [2019-11-23 22:10:52,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:52,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:52,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:52,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:52,144 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 5 states. [2019-11-23 22:10:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:52,361 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-11-23 22:10:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:52,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-23 22:10:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:52,363 INFO L225 Difference]: With dead ends: 95 [2019-11-23 22:10:52,363 INFO L226 Difference]: Without dead ends: 91 [2019-11-23 22:10:52,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-23 22:10:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-11-23 22:10:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-23 22:10:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-23 22:10:52,368 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 14 [2019-11-23 22:10:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:52,369 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-23 22:10:52,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2019-11-23 22:10:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:10:52,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:52,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:52,370 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:52,371 INFO L82 PathProgramCache]: Analyzing trace with hash -24950085, now seen corresponding path program 1 times [2019-11-23 22:10:52,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:52,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33623858] [2019-11-23 22:10:52,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:52,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33623858] [2019-11-23 22:10:52,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:52,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:52,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635470778] [2019-11-23 22:10:52,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:52,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:52,432 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2019-11-23 22:10:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:52,653 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2019-11-23 22:10:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:52,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-23 22:10:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:52,655 INFO L225 Difference]: With dead ends: 107 [2019-11-23 22:10:52,655 INFO L226 Difference]: Without dead ends: 105 [2019-11-23 22:10:52,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-23 22:10:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2019-11-23 22:10:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-23 22:10:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2019-11-23 22:10:52,663 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 101 transitions. Word has length 15 [2019-11-23 22:10:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:52,664 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 101 transitions. [2019-11-23 22:10:52,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 101 transitions. [2019-11-23 22:10:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:10:52,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:52,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:52,665 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2034707599, now seen corresponding path program 1 times [2019-11-23 22:10:52,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:52,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410404665] [2019-11-23 22:10:52,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:52,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410404665] [2019-11-23 22:10:52,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:52,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:10:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672938757] [2019-11-23 22:10:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:10:52,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:10:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:52,709 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. Second operand 6 states. [2019-11-23 22:10:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:52,947 INFO L93 Difference]: Finished difference Result 99 states and 113 transitions. [2019-11-23 22:10:52,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:52,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-23 22:10:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:52,948 INFO L225 Difference]: With dead ends: 99 [2019-11-23 22:10:52,948 INFO L226 Difference]: Without dead ends: 97 [2019-11-23 22:10:52,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-23 22:10:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-11-23 22:10:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-23 22:10:52,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2019-11-23 22:10:52,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 16 [2019-11-23 22:10:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:52,953 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2019-11-23 22:10:52,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:10:52,953 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2019-11-23 22:10:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:10:52,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:52,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:52,954 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1348569745, now seen corresponding path program 1 times [2019-11-23 22:10:52,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:52,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817578940] [2019-11-23 22:10:52,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:53,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817578940] [2019-11-23 22:10:53,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:53,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:10:53,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950049824] [2019-11-23 22:10:53,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:10:53,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:10:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:10:53,002 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand 4 states. [2019-11-23 22:10:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:53,107 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2019-11-23 22:10:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:10:53,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-23 22:10:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:53,109 INFO L225 Difference]: With dead ends: 87 [2019-11-23 22:10:53,109 INFO L226 Difference]: Without dead ends: 54 [2019-11-23 22:10:53,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-23 22:10:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-23 22:10:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-23 22:10:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-11-23 22:10:53,113 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 17 [2019-11-23 22:10:53,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:53,113 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-11-23 22:10:53,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:10:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-11-23 22:10:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:10:53,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:53,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:53,115 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:53,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:53,115 INFO L82 PathProgramCache]: Analyzing trace with hash 892497877, now seen corresponding path program 1 times [2019-11-23 22:10:53,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:53,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762985243] [2019-11-23 22:10:53,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:53,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762985243] [2019-11-23 22:10:53,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:53,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:10:53,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514657422] [2019-11-23 22:10:53,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:10:53,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:10:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:10:53,247 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2019-11-23 22:10:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:53,360 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-23 22:10:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:10:53,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-11-23 22:10:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:53,362 INFO L225 Difference]: With dead ends: 54 [2019-11-23 22:10:53,362 INFO L226 Difference]: Without dead ends: 52 [2019-11-23 22:10:53,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:10:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-23 22:10:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-23 22:10:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-23 22:10:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-23 22:10:53,365 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 44 [2019-11-23 22:10:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:53,366 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-23 22:10:53,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:10:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-23 22:10:53,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:10:53,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:53,367 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:53,368 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:53,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:53,368 INFO L82 PathProgramCache]: Analyzing trace with hash 892513765, now seen corresponding path program 1 times [2019-11-23 22:10:53,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:53,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132443828] [2019-11-23 22:10:53,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:53,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132443828] [2019-11-23 22:10:53,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:53,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 22:10:53,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789006615] [2019-11-23 22:10:53,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:10:53,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:10:53,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:10:53,536 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2019-11-23 22:10:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:53,697 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-11-23 22:10:53,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:10:53,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-11-23 22:10:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:53,699 INFO L225 Difference]: With dead ends: 59 [2019-11-23 22:10:53,699 INFO L226 Difference]: Without dead ends: 57 [2019-11-23 22:10:53,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:10:53,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-23 22:10:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-11-23 22:10:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-23 22:10:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-23 22:10:53,702 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 44 [2019-11-23 22:10:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:53,703 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-23 22:10:53,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:10:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-23 22:10:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:10:53,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:53,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:53,704 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:53,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:53,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1897634854, now seen corresponding path program 1 times [2019-11-23 22:10:53,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:53,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725467221] [2019-11-23 22:10:53,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:53,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725467221] [2019-11-23 22:10:53,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:53,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:53,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184929062] [2019-11-23 22:10:53,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:53,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:53,884 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 5 states. [2019-11-23 22:10:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:54,007 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-23 22:10:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:10:54,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-23 22:10:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:54,008 INFO L225 Difference]: With dead ends: 50 [2019-11-23 22:10:54,008 INFO L226 Difference]: Without dead ends: 46 [2019-11-23 22:10:54,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:10:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-23 22:10:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-11-23 22:10:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-23 22:10:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-11-23 22:10:54,012 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 45 [2019-11-23 22:10:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:54,013 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-11-23 22:10:54,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-11-23 22:10:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-23 22:10:54,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:10:54,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:10:54,014 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:10:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:10:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1898127398, now seen corresponding path program 1 times [2019-11-23 22:10:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:10:54,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138047377] [2019-11-23 22:10:54,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:10:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:10:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:10:54,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138047377] [2019-11-23 22:10:54,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:10:54,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:10:54,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9979965] [2019-11-23 22:10:54,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:10:54,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:10:54,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:10:54,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:10:54,180 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2019-11-23 22:10:54,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:10:54,299 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-23 22:10:54,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:10:54,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-23 22:10:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:10:54,300 INFO L225 Difference]: With dead ends: 50 [2019-11-23 22:10:54,300 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:10:54,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 25 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:10:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:10:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:10:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:10:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:10:54,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-23 22:10:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:10:54,302 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:10:54,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:10:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:10:54,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:10:54,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:10:54,392 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 977) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L447 ceAbstractionStarter]: At program point L927(lines 12 1001) the Hoare annotation is: true [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point L861(lines 861 941) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 272) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 555) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point L878(line 878) no Hoare annotation was computed. [2019-11-23 22:10:54,393 INFO L444 ceAbstractionStarter]: For program point L746(lines 746 757) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 878) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L796(lines 796 946) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 968) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 938) no Hoare annotation was computed. [2019-11-23 22:10:54,394 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 948) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point L516(lines 516 971) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L440 ceAbstractionStarter]: At program point L863(lines 21 995) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 0 ULTIMATE.start_main_~main__t~0)) [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point L252(line 252) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 264) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point L599(lines 599 623) no Hoare annotation was computed. [2019-11-23 22:10:54,395 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 995) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L814(lines 814 825) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 168) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L633(lines 633 962) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L914(line 914) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L848(lines 848 942) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 231) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L584(lines 584 965) no Hoare annotation was computed. [2019-11-23 22:10:54,396 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 988) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point L667(lines 667 691) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 990) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L440 ceAbstractionStarter]: At program point L899(lines 60 994) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 1 ULTIMATE.start_main_~main__t~0)) [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point L701(lines 701 956) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 202) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 349) no Hoare annotation was computed. [2019-11-23 22:10:54,397 INFO L444 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 959) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point L41(lines 41 51) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L447 ceAbstractionStarter]: At program point L999(lines 17 1000) the Hoare annotation is: true [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 982) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 759) no Hoare annotation was computed. [2019-11-23 22:10:54,398 INFO L444 ceAbstractionStarter]: For program point L91(lines 91 280) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 984) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 950) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 417) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L720(lines 720 953) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 890) no Hoare annotation was computed. [2019-11-23 22:10:54,399 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 976) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L440 ceAbstractionStarter]: At program point L935(lines 853 942) the Hoare annotation is: (and (<= ULTIMATE.start_main_~main__t~0 ULTIMATE.start_main_~main__tagbuf_len~0) (<= 9 ULTIMATE.start_main_~main__t~0)) [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point L869(lines 869 940) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point L803(lines 803 827) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 228) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 994) no Hoare annotation was computed. [2019-11-23 22:10:54,400 INFO L444 ceAbstractionStarter]: For program point L440(lines 440 978) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L110(lines 110 118) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L837(lines 837 944) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 279) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L788(lines 788 947) no Hoare annotation was computed. [2019-11-23 22:10:54,401 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 278) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L78(lines 78 281) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L524(lines 524 970) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 926) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 992) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 53) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L508(lines 508 972) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point L888(lines 888 900) no Hoare annotation was computed. [2019-11-23 22:10:54,402 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 112) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L440 ceAbstractionStarter]: At program point L277(lines 127 279) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~main__t~0) (<= (+ ULTIMATE.start_main_~main__t~0 1) ULTIMATE.start_main_~main__tagbuf_len~0)) [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 186) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 914) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 351) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L212(lines 212 224) no Hoare annotation was computed. [2019-11-23 22:10:54,403 INFO L444 ceAbstractionStarter]: For program point L592(lines 592 964) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 986) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L262(lines 262 270) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L576(lines 576 966) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 989) no Hoare annotation was computed. [2019-11-23 22:10:54,404 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 419) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L131(lines 131 237) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L98(lines 98 120) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L610(lines 610 621) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L924(lines 924 936) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 31) no Hoare annotation was computed. [2019-11-23 22:10:54,405 INFO L444 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L660(lines 660 958) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 980) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L264(line 264) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L644(lines 644 960) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 983) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L17(lines 17 1000) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 487) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 902) no Hoare annotation was computed. [2019-11-23 22:10:54,406 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 188) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L678(lines 678 689) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 283) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L926(line 926) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 252) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L728(lines 728 952) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 229) no Hoare annotation was computed. [2019-11-23 22:10:54,407 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 974) no Hoare annotation was computed. [2019-11-23 22:10:54,408 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 226) no Hoare annotation was computed. [2019-11-23 22:10:54,408 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 954) no Hoare annotation was computed. [2019-11-23 22:10:54,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:10:54 BoogieIcfgContainer [2019-11-23 22:10:54,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:10:54,439 INFO L168 Benchmark]: Toolchain (without parser) took 6680.48 ms. Allocated memory was 145.8 MB in the beginning and 285.7 MB in the end (delta: 140.0 MB). Free memory was 102.2 MB in the beginning and 183.4 MB in the end (delta: -81.2 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,444 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.07 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 178.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.50 ms. Allocated memory is still 203.9 MB. Free memory was 178.2 MB in the beginning and 174.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,452 INFO L168 Benchmark]: Boogie Preprocessor took 39.86 ms. Allocated memory is still 203.9 MB. Free memory was 174.8 MB in the beginning and 172.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,455 INFO L168 Benchmark]: RCFGBuilder took 834.50 ms. Allocated memory is still 203.9 MB. Free memory was 172.5 MB in the beginning and 122.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,456 INFO L168 Benchmark]: TraceAbstraction took 5201.38 ms. Allocated memory was 203.9 MB in the beginning and 285.7 MB in the end (delta: 81.8 MB). Free memory was 121.7 MB in the beginning and 183.4 MB in the end (delta: -61.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-11-23 22:10:54,465 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.61 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 524.07 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.8 MB in the beginning and 178.2 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.50 ms. Allocated memory is still 203.9 MB. Free memory was 178.2 MB in the beginning and 174.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.86 ms. Allocated memory is still 203.9 MB. Free memory was 174.8 MB in the beginning and 172.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 834.50 ms. Allocated memory is still 203.9 MB. Free memory was 172.5 MB in the beginning and 122.4 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5201.38 ms. Allocated memory was 203.9 MB in the beginning and 285.7 MB in the end (delta: 81.8 MB). Free memory was 121.7 MB in the beginning and 183.4 MB in the end (delta: -61.6 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 202]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 926]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 112]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 31]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 100]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 878]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 168]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 252]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 914]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 890]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 264]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 214]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t + 1 <= main__tagbuf_len - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 1 <= main__t - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 853]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 9 <= main__t - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 16 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 697 SDtfs, 1844 SDslu, 728 SDs, 0 SdLazy, 2417 SolverSat, 438 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 48 SyntacticMatches, 56 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred 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, 16 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 32 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1154 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 31348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...