java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:50:55,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:50:55,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:50:55,349 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:50:55,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:50:55,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:50:55,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:50:55,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:50:55,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:50:55,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:50:55,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:50:55,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:50:55,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:50:55,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:50:55,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:50:55,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:50:55,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:50:55,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:50:55,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:50:55,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:50:55,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:50:55,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:50:55,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:50:55,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:50:55,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:50:55,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:50:55,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:50:55,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:50:55,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:50:55,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:50:55,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:50:55,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:50:55,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:50:55,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:50:55,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:50:55,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:50:55,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:50:55,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:50:55,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:50:55,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:50:55,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:50:55,385 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-09-03 19:50:55,400 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:50:55,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:50:55,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:50:55,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:50:55,403 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:50:55,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:50:55,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:50:55,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:50:55,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:50:55,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:50:55,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:50:55,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:50:55,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:50:55,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:50:55,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:50:55,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:50:55,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:50:55,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:50:55,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:50:55,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:50:55,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:50:55,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:55,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:50:55,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:50:55,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:50:55,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:50:55,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:50:55,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:50:55,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:50:55,440 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:50:55,453 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:50:55,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:50:55,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:50:55,458 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:50:55,460 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-03 19:50:55,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a60afef2/b2755d11bbc649ca824bf9ee7fccf836/FLAGcdcf19a75 [2019-09-03 19:50:56,006 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:50:56,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-09-03 19:50:56,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a60afef2/b2755d11bbc649ca824bf9ee7fccf836/FLAGcdcf19a75 [2019-09-03 19:50:56,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a60afef2/b2755d11bbc649ca824bf9ee7fccf836 [2019-09-03 19:50:56,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:50:56,335 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:50:56,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:56,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:50:56,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:50:56,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183e7880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56, skipping insertion in model container [2019-09-03 19:50:56,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:50:56,369 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:50:56,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:56,563 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:50:56,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:56,596 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:50:56,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56 WrapperNode [2019-09-03 19:50:56,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:56,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:50:56,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:50:56,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:50:56,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (1/1) ... [2019-09-03 19:50:56,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:50:56,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:50:56,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:50:56,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:50:56,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (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-09-03 19:50:56,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:50:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:50:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:50:56,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:50:56,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:50:56,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:50:56,975 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:50:56,975 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:50:56,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:56 BoogieIcfgContainer [2019-09-03 19:50:56,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:50:56,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:50:56,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:50:56,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:50:56,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:50:56" (1/3) ... [2019-09-03 19:50:56,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b76996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:56, skipping insertion in model container [2019-09-03 19:50:56,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:56" (2/3) ... [2019-09-03 19:50:56,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11b76996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:56, skipping insertion in model container [2019-09-03 19:50:56,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:56" (3/3) ... [2019-09-03 19:50:56,990 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-09-03 19:50:57,008 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:50:57,028 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:50:57,052 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:50:57,098 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:50:57,098 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:50:57,098 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:50:57,099 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:50:57,099 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:50:57,099 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:50:57,099 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:50:57,099 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:50:57,099 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:50:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-09-03 19:50:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:50:57,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,124 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-09-03 19:50:57,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:57,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:57,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:50:57,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:50:57,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:50:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:57,259 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-09-03 19:50:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:57,283 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-09-03 19:50:57,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:50:57,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-09-03 19:50:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:57,292 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:50:57,293 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:50:57,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:50:57,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-03 19:50:57,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-03 19:50:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-09-03 19:50:57,341 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-09-03 19:50:57,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:57,341 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-09-03 19:50:57,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:50:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-09-03 19:50:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:50:57,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,344 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,344 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-09-03 19:50:57,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:57,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:57,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:57,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:57,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:57,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:57,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:57,449 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-09-03 19:50:57,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:57,583 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-03 19:50:57,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:57,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-03 19:50:57,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:57,585 INFO L225 Difference]: With dead ends: 35 [2019-09-03 19:50:57,585 INFO L226 Difference]: Without dead ends: 33 [2019-09-03 19:50:57,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-03 19:50:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-03 19:50:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-03 19:50:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-09-03 19:50:57,599 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-09-03 19:50:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:57,600 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-09-03 19:50:57,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-09-03 19:50:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:50:57,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,602 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-09-03 19:50:57,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:57,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:57,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:57,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:57,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:57,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:57,688 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-09-03 19:50:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:57,862 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-09-03 19:50:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:57,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-03 19:50:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:57,864 INFO L225 Difference]: With dead ends: 48 [2019-09-03 19:50:57,865 INFO L226 Difference]: Without dead ends: 46 [2019-09-03 19:50:57,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:50:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-03 19:50:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-09-03 19:50:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 19:50:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-09-03 19:50:57,892 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-09-03 19:50:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:57,893 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-09-03 19:50:57,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-09-03 19:50:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:50:57,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:57,897 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:57,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:57,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:57,898 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-09-03 19:50:57,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:57,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:57,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:57,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:57,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:57,976 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-09-03 19:50:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,072 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-09-03 19:50:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:58,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-03 19:50:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,074 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:50:58,074 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:50:58,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:58,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:50:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-09-03 19:50:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-09-03 19:50:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-09-03 19:50:58,087 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-09-03 19:50:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,088 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-09-03 19:50:58,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-09-03 19:50:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:50:58,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,090 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:58,090 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-09-03 19:50:58,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:58,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:58,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:58,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:58,172 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-09-03 19:50:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,393 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-09-03 19:50:58,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:58,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-03 19:50:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,395 INFO L225 Difference]: With dead ends: 70 [2019-09-03 19:50:58,395 INFO L226 Difference]: Without dead ends: 63 [2019-09-03 19:50:58,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-03 19:50:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-09-03 19:50:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-03 19:50:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-09-03 19:50:58,409 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-09-03 19:50:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,409 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-09-03 19:50:58,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-09-03 19:50:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-03 19:50:58,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,411 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:58,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-09-03 19:50:58,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:58,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-03 19:50:58,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:50:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:50:58,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:50:58,485 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-09-03 19:50:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:58,664 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-09-03 19:50:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:50:58,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-09-03 19:50:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:58,667 INFO L225 Difference]: With dead ends: 72 [2019-09-03 19:50:58,667 INFO L226 Difference]: Without dead ends: 70 [2019-09-03 19:50:58,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:50:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-03 19:50:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-09-03 19:50:58,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 19:50:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-03 19:50:58,694 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-09-03 19:50:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:58,695 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-03 19:50:58,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:50:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-03 19:50:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-03 19:50:58,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:58,701 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 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-09-03 19:50:58,701 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:58,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:58,701 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-09-03 19:50:58,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:58,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:58,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:58,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:58,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:58,880 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:58,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:58,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 19:50:58,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-03 19:50:59,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:59,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-09-03 19:50:59,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-03 19:50:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-03 19:50:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-03 19:50:59,142 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-09-03 19:50:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:59,834 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-09-03 19:50:59,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-03 19:50:59,835 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-09-03 19:50:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:59,839 INFO L225 Difference]: With dead ends: 111 [2019-09-03 19:50:59,840 INFO L226 Difference]: Without dead ends: 96 [2019-09-03 19:50:59,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-09-03 19:50:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-03 19:50:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-09-03 19:50:59,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-03 19:50:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-09-03 19:50:59,872 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-09-03 19:50:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:59,875 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-09-03 19:50:59,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-03 19:50:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-09-03 19:50:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-03 19:50:59,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:59,877 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:59,877 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:59,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-09-03 19:50:59,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:59,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:59,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:50:59,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:59,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:59,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:59,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:50:59,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:00,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-03 19:51:00,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:00,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-03 19:51:00,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:51:00,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:51:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:51:00,093 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-09-03 19:51:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:00,277 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-09-03 19:51:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:51:00,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-09-03 19:51:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:00,279 INFO L225 Difference]: With dead ends: 97 [2019-09-03 19:51:00,279 INFO L226 Difference]: Without dead ends: 95 [2019-09-03 19:51:00,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-09-03 19:51:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-03 19:51:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-09-03 19:51:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-09-03 19:51:00,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-09-03 19:51:00,294 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-09-03 19:51:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:00,295 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-09-03 19:51:00,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:51:00,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-09-03 19:51:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-03 19:51:00,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:00,297 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:00,297 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:00,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-09-03 19:51:00,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:00,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:00,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:51:00,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-09-03 19:51:00,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:00,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:00,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:00,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:00,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:00,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-03 19:51:00,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:00,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:00,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:00,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-09-03 19:51:00,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 19:51:00,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 19:51:00,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-09-03 19:51:00,847 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 23 states. [2019-09-03 19:51:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:01,710 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-09-03 19:51:01,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:51:01,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-09-03 19:51:01,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:01,713 INFO L225 Difference]: With dead ends: 116 [2019-09-03 19:51:01,713 INFO L226 Difference]: Without dead ends: 114 [2019-09-03 19:51:01,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-03 19:51:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-03 19:51:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-09-03 19:51:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-09-03 19:51:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-09-03 19:51:01,731 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2019-09-03 19:51:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:01,732 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-09-03 19:51:01,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 19:51:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-09-03 19:51:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-03 19:51:01,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:01,734 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:01,735 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:01,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-09-03 19:51:01,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:01,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:01,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:01,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-09-03 19:51:01,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:01,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:01,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:51:01,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:51:01,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:01,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-03 19:51:01,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 19:51:02,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:02,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-09-03 19:51:02,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-03 19:51:02,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-03 19:51:02,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-03 19:51:02,215 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2019-09-03 19:51:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:02,800 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-09-03 19:51:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:51:02,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-09-03 19:51:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:02,806 INFO L225 Difference]: With dead ends: 109 [2019-09-03 19:51:02,806 INFO L226 Difference]: Without dead ends: 100 [2019-09-03 19:51:02,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-09-03 19:51:02,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-03 19:51:02,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-09-03 19:51:02,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:51:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-09-03 19:51:02,819 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 106 [2019-09-03 19:51:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:02,819 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-09-03 19:51:02,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-03 19:51:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-09-03 19:51:02,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-03 19:51:02,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:51:02,822 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:51:02,822 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:51:02,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:51:02,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1512190145, now seen corresponding path program 3 times [2019-09-03 19:51:02,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:51:02,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:51:02,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:51:02,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:51:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:51:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-09-03 19:51:03,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:51:03,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:51:03,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:51:03,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 19:51:03,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:51:03,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 19:51:03,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:51:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:51:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 100 proven. 62 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-09-03 19:51:03,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:51:03,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-09-03 19:51:03,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-03 19:51:03,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-03 19:51:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:51:03,522 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 28 states. [2019-09-03 19:51:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:51:04,724 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-09-03 19:51:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-03 19:51:04,725 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2019-09-03 19:51:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:51:04,726 INFO L225 Difference]: With dead ends: 119 [2019-09-03 19:51:04,726 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:51:04,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=390, Invalid=1866, Unknown=0, NotChecked=0, Total=2256 [2019-09-03 19:51:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:51:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:51:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:51:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:51:04,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-09-03 19:51:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:51:04,729 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:51:04,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-03 19:51:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:51:04,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:51:04,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:51:05,060 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-09-03 19:51:05,303 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-03 19:51:05,501 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-09-03 19:51:05,686 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-03 19:51:05,803 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-09-03 19:51:05,806 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:51:05,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:51:05,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:51:05,806 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:51:05,806 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:51:05,807 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:51:05,808 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-03 19:51:05,808 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-09-03 19:51:05,808 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-09-03 19:51:05,808 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-09-03 19:51:05,808 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-03 19:51:05,809 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-09-03 19:51:05,809 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-09-03 19:51:05,809 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-03 19:51:05,809 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-09-03 19:51:05,809 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-09-03 19:51:05,810 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-09-03 19:51:05,810 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse3 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse2 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse4 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and .cse0 .cse1 (<= main_~in~0 2) .cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse2 (<= 3 main_~buf~0) .cse0 .cse3 .cse4) (and .cse2 (<= 0 main_~in~0) .cse3 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= main_~in~0 1) .cse1 .cse2 (<= 1 main_~buf~0) .cse4))) [2019-09-03 19:51:05,810 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-09-03 19:51:05,810 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-03 19:51:05,810 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-09-03 19:51:05,810 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-09-03 19:51:05,812 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-03 19:51:05,813 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-09-03 19:51:05,813 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-03 19:51:05,813 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-09-03 19:51:05,813 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-09-03 19:51:05,814 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-09-03 19:51:05,814 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-09-03 19:51:05,814 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:51:05,814 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:51:05,814 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:51:05,814 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:51:05,815 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:51:05,815 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:51:05,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:51:05 BoogieIcfgContainer [2019-09-03 19:51:05,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:51:05,843 INFO L168 Benchmark]: Toolchain (without parser) took 9506.34 ms. Allocated memory was 132.1 MB in the beginning and 365.4 MB in the end (delta: 233.3 MB). Free memory was 88.0 MB in the beginning and 77.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 243.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:51:05,844 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-03 19:51:05,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.94 ms. Allocated memory is still 132.1 MB. Free memory was 88.0 MB in the beginning and 78.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:51:05,853 INFO L168 Benchmark]: Boogie Preprocessor took 104.49 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 78.3 MB in the beginning and 175.0 MB in the end (delta: -96.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:51:05,854 INFO L168 Benchmark]: RCFGBuilder took 274.92 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 160.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:51:05,855 INFO L168 Benchmark]: TraceAbstraction took 8861.42 ms. Allocated memory was 198.2 MB in the beginning and 365.4 MB in the end (delta: 167.2 MB). Free memory was 160.7 MB in the beginning and 77.8 MB in the end (delta: 82.9 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:51:05,863 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.23 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.94 ms. Allocated memory is still 132.1 MB. Free memory was 88.0 MB in the beginning and 78.3 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.49 ms. Allocated memory was 132.1 MB in the beginning and 198.2 MB in the end (delta: 66.1 MB). Free memory was 78.3 MB in the beginning and 175.0 MB in the end (delta: -96.7 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 274.92 ms. Allocated memory is still 198.2 MB. Free memory was 175.0 MB in the beginning and 160.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8861.42 ms. Allocated memory was 198.2 MB in the beginning and 365.4 MB in the end (delta: 167.2 MB). Free memory was 160.7 MB in the beginning and 77.8 MB in the end (delta: 82.9 MB). Peak memory consumption was 250.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((1 <= in && bufferlen < inlen) && in <= 2) && bufferlen == buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || (((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && 3 <= buf) && 1 <= in) && in + buflim + 3 <= buf + inlen) && buf < buflim + 1)) || (((((bufferlen == buflim + 2 && 0 <= in) && in + buflim + 3 <= buf + inlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || (((((1 <= in && in <= 1) && bufferlen < inlen) && bufferlen == buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. SAFE Result, 8.7s OverallTime, 11 OverallIterations, 16 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 418 SDtfs, 472 SDslu, 2312 SDs, 0 SdLazy, 2289 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 377 SyntacticMatches, 7 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 64 PreInvPairs, 113 NumberOfFragments, 513 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1510 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 963 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 291238 SizeOfPredicates, 25 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2703/2972 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...