java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 22:06:24,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 22:06:24,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 22:06:24,936 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 22:06:24,936 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 22:06:24,937 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 22:06:24,939 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 22:06:24,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 22:06:24,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 22:06:24,950 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 22:06:24,951 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 22:06:24,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 22:06:24,952 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 22:06:24,953 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 22:06:24,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 22:06:24,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 22:06:24,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 22:06:24,958 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 22:06:24,960 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 22:06:24,961 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 22:06:24,962 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 22:06:24,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 22:06:24,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 22:06:24,966 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 22:06:24,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 22:06:24,967 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 22:06:24,968 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 22:06:24,969 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 22:06:24,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 22:06:24,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 22:06:24,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 22:06:24,972 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 22:06:24,972 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 22:06:24,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 22:06:24,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 22:06:24,974 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 22:06:24,975 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 22:06:24,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 22:06:24,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 22:06:24,990 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 22:06:24,991 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 22:06:24,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 22:06:24,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 22:06:24,992 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 22:06:24,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 22:06:24,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 22:06:24,992 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 22:06:24,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 22:06:24,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 22:06:24,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 22:06:24,993 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 22:06:24,993 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 22:06:24,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 22:06:24,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 22:06:24,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 22:06:24,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 22:06:24,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 22:06:24,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 22:06:24,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 22:06:24,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 22:06:24,995 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 22:06:24,995 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 22:06:24,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 22:06:24,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 22:06:24,996 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 22:06:25,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 22:06:25,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 22:06:25,054 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 22:06:25,056 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 22:06:25,056 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 22:06:25,057 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-11-06 22:06:25,113 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c39e4a34/5b430b3ee25b45318f5d38498df18506/FLAGd985323cd [2018-11-06 22:06:25,810 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 22:06:25,813 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-11-06 22:06:25,839 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c39e4a34/5b430b3ee25b45318f5d38498df18506/FLAGd985323cd [2018-11-06 22:06:25,854 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c39e4a34/5b430b3ee25b45318f5d38498df18506 [2018-11-06 22:06:25,865 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 22:06:25,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 22:06:25,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 22:06:25,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 22:06:25,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 22:06:25,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:25" (1/1) ... [2018-11-06 22:06:25,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15203188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:25, skipping insertion in model container [2018-11-06 22:06:25,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:06:25" (1/1) ... [2018-11-06 22:06:25,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 22:06:26,029 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 22:06:26,823 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:06:26,830 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 22:06:27,166 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 22:06:27,184 INFO L193 MainTranslator]: Completed translation [2018-11-06 22:06:27,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27 WrapperNode [2018-11-06 22:06:27,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 22:06:27,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 22:06:27,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 22:06:27,187 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 22:06:27,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 22:06:27,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 22:06:27,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 22:06:27,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 22:06:27,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (1/1) ... [2018-11-06 22:06:27,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 22:06:27,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 22:06:27,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 22:06:27,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 22:06:27,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (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 [2018-11-06 22:06:27,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 22:06:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 22:06:32,333 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 22:06:32,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:32 BoogieIcfgContainer [2018-11-06 22:06:32,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 22:06:32,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 22:06:32,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 22:06:32,338 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 22:06:32,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:06:25" (1/3) ... [2018-11-06 22:06:32,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:32, skipping insertion in model container [2018-11-06 22:06:32,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:06:27" (2/3) ... [2018-11-06 22:06:32,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f9d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:06:32, skipping insertion in model container [2018-11-06 22:06:32,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:06:32" (3/3) ... [2018-11-06 22:06:32,342 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1_true-unreach-call_false-termination.c [2018-11-06 22:06:32,352 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 22:06:32,363 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 22:06:32,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 22:06:32,417 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 22:06:32,418 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 22:06:32,418 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 22:06:32,418 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 22:06:32,418 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 22:06:32,419 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 22:06:32,419 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 22:06:32,419 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 22:06:32,419 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 22:06:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-06 22:06:32,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-06 22:06:32,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:32,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:32,460 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:32,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:32,466 INFO L82 PathProgramCache]: Analyzing trace with hash 382155667, now seen corresponding path program 1 times [2018-11-06 22:06:32,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:32,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:32,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:32,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:32,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:32,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 22:06:32,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-06 22:06:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-06 22:06:32,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-06 22:06:32,663 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 2 states. [2018-11-06 22:06:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:32,728 INFO L93 Difference]: Finished difference Result 463 states and 910 transitions. [2018-11-06 22:06:32,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-06 22:06:32,730 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-06 22:06:32,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:32,746 INFO L225 Difference]: With dead ends: 463 [2018-11-06 22:06:32,746 INFO L226 Difference]: Without dead ends: 224 [2018-11-06 22:06:32,753 INFO L604 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 [2018-11-06 22:06:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-06 22:06:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-11-06 22:06:32,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-06 22:06:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 393 transitions. [2018-11-06 22:06:32,847 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 393 transitions. Word has length 9 [2018-11-06 22:06:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:32,848 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 393 transitions. [2018-11-06 22:06:32,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-06 22:06:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 393 transitions. [2018-11-06 22:06:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-06 22:06:32,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:32,851 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:32,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:32,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -505609724, now seen corresponding path program 1 times [2018-11-06 22:06:32,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:32,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:32,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:32,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:32,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:32,995 INFO L87 Difference]: Start difference. First operand 224 states and 393 transitions. Second operand 3 states. [2018-11-06 22:06:33,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:33,793 INFO L93 Difference]: Finished difference Result 449 states and 788 transitions. [2018-11-06 22:06:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:33,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-06 22:06:33,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:33,797 INFO L225 Difference]: With dead ends: 449 [2018-11-06 22:06:33,800 INFO L226 Difference]: Without dead ends: 227 [2018-11-06 22:06:33,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-11-06 22:06:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-11-06 22:06:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-06 22:06:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 396 transitions. [2018-11-06 22:06:33,837 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 396 transitions. Word has length 10 [2018-11-06 22:06:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:33,837 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 396 transitions. [2018-11-06 22:06:33,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 396 transitions. [2018-11-06 22:06:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-06 22:06:33,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:33,839 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:33,839 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:33,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:33,840 INFO L82 PathProgramCache]: Analyzing trace with hash -353905706, now seen corresponding path program 1 times [2018-11-06 22:06:33,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:33,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:33,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:33,936 INFO L87 Difference]: Start difference. First operand 227 states and 396 transitions. Second operand 3 states. [2018-11-06 22:06:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:34,281 INFO L93 Difference]: Finished difference Result 436 states and 769 transitions. [2018-11-06 22:06:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:34,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-06 22:06:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:34,285 INFO L225 Difference]: With dead ends: 436 [2018-11-06 22:06:34,285 INFO L226 Difference]: Without dead ends: 212 [2018-11-06 22:06:34,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-06 22:06:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-11-06 22:06:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-06 22:06:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 374 transitions. [2018-11-06 22:06:34,306 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 374 transitions. Word has length 15 [2018-11-06 22:06:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:34,309 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 374 transitions. [2018-11-06 22:06:34,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 374 transitions. [2018-11-06 22:06:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-06 22:06:34,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:34,311 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:34,311 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:34,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -44313407, now seen corresponding path program 1 times [2018-11-06 22:06:34,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:34,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:34,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:34,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:34,399 INFO L87 Difference]: Start difference. First operand 212 states and 374 transitions. Second operand 3 states. [2018-11-06 22:06:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:35,126 INFO L93 Difference]: Finished difference Result 614 states and 1098 transitions. [2018-11-06 22:06:35,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:35,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-06 22:06:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:35,130 INFO L225 Difference]: With dead ends: 614 [2018-11-06 22:06:35,130 INFO L226 Difference]: Without dead ends: 406 [2018-11-06 22:06:35,131 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-06 22:06:35,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 400. [2018-11-06 22:06:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-11-06 22:06:35,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 718 transitions. [2018-11-06 22:06:35,151 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 718 transitions. Word has length 18 [2018-11-06 22:06:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:35,151 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 718 transitions. [2018-11-06 22:06:35,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:35,151 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 718 transitions. [2018-11-06 22:06:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:06:35,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:35,153 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:35,153 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:35,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1227017332, now seen corresponding path program 1 times [2018-11-06 22:06:35,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:35,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:35,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:35,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:35,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:35,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:35,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:35,219 INFO L87 Difference]: Start difference. First operand 400 states and 718 transitions. Second operand 3 states. [2018-11-06 22:06:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:35,602 INFO L93 Difference]: Finished difference Result 636 states and 1130 transitions. [2018-11-06 22:06:35,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:35,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:06:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:35,605 INFO L225 Difference]: With dead ends: 636 [2018-11-06 22:06:35,606 INFO L226 Difference]: Without dead ends: 244 [2018-11-06 22:06:35,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-06 22:06:35,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-11-06 22:06:35,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-06 22:06:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 418 transitions. [2018-11-06 22:06:35,617 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 418 transitions. Word has length 19 [2018-11-06 22:06:35,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:35,617 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 418 transitions. [2018-11-06 22:06:35,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:35,617 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 418 transitions. [2018-11-06 22:06:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-06 22:06:35,618 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:35,619 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:35,619 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:35,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:35,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1362295549, now seen corresponding path program 1 times [2018-11-06 22:06:35,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:35,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:35,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:35,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:35,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:35,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:35,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:35,704 INFO L87 Difference]: Start difference. First operand 242 states and 418 transitions. Second operand 3 states. [2018-11-06 22:06:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:35,910 INFO L93 Difference]: Finished difference Result 244 states and 419 transitions. [2018-11-06 22:06:35,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:35,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-06 22:06:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:35,914 INFO L225 Difference]: With dead ends: 244 [2018-11-06 22:06:35,914 INFO L226 Difference]: Without dead ends: 242 [2018-11-06 22:06:35,914 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:35,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-11-06 22:06:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-11-06 22:06:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-06 22:06:35,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 410 transitions. [2018-11-06 22:06:35,923 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 410 transitions. Word has length 19 [2018-11-06 22:06:35,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:35,923 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 410 transitions. [2018-11-06 22:06:35,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:35,923 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 410 transitions. [2018-11-06 22:06:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-06 22:06:35,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:35,924 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:35,925 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:35,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:35,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1598347038, now seen corresponding path program 1 times [2018-11-06 22:06:35,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 22:06:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:36,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:36,037 INFO L87 Difference]: Start difference. First operand 242 states and 410 transitions. Second operand 3 states. [2018-11-06 22:06:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:37,703 INFO L93 Difference]: Finished difference Result 649 states and 1104 transitions. [2018-11-06 22:06:37,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:37,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-06 22:06:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:37,709 INFO L225 Difference]: With dead ends: 649 [2018-11-06 22:06:37,709 INFO L226 Difference]: Without dead ends: 411 [2018-11-06 22:06:37,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-11-06 22:06:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 398. [2018-11-06 22:06:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-06 22:06:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 610 transitions. [2018-11-06 22:06:37,736 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 610 transitions. Word has length 22 [2018-11-06 22:06:37,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:37,743 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 610 transitions. [2018-11-06 22:06:37,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 610 transitions. [2018-11-06 22:06:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-06 22:06:37,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:37,746 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:37,746 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1458679056, now seen corresponding path program 1 times [2018-11-06 22:06:37,746 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:37,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:06:37,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:37,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:37,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:37,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:37,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:37,849 INFO L87 Difference]: Start difference. First operand 398 states and 610 transitions. Second operand 3 states. [2018-11-06 22:06:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:37,953 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2018-11-06 22:06:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:37,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-06 22:06:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:37,957 INFO L225 Difference]: With dead ends: 729 [2018-11-06 22:06:37,957 INFO L226 Difference]: Without dead ends: 339 [2018-11-06 22:06:37,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-06 22:06:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-11-06 22:06:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-06 22:06:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 522 transitions. [2018-11-06 22:06:37,967 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 522 transitions. Word has length 32 [2018-11-06 22:06:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:37,968 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 522 transitions. [2018-11-06 22:06:37,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 522 transitions. [2018-11-06 22:06:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-06 22:06:37,969 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:37,970 INFO L375 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, 1, 1, 1, 1, 1] [2018-11-06 22:06:37,970 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:37,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 331355173, now seen corresponding path program 1 times [2018-11-06 22:06:37,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:37,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:37,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:06:38,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:38,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:38,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:38,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:38,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:38,069 INFO L87 Difference]: Start difference. First operand 339 states and 522 transitions. Second operand 3 states. [2018-11-06 22:06:38,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:38,270 INFO L93 Difference]: Finished difference Result 664 states and 1029 transitions. [2018-11-06 22:06:38,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:38,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-06 22:06:38,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:38,274 INFO L225 Difference]: With dead ends: 664 [2018-11-06 22:06:38,274 INFO L226 Difference]: Without dead ends: 333 [2018-11-06 22:06:38,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-06 22:06:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-11-06 22:06:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-06 22:06:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 502 transitions. [2018-11-06 22:06:38,286 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 502 transitions. Word has length 33 [2018-11-06 22:06:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:38,286 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 502 transitions. [2018-11-06 22:06:38,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 502 transitions. [2018-11-06 22:06:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-06 22:06:38,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:38,289 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:38,289 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:38,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 186804741, now seen corresponding path program 1 times [2018-11-06 22:06:38,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:06:38,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:38,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 22:06:38,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 22:06:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 22:06:38,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:06:38,398 INFO L87 Difference]: Start difference. First operand 333 states and 502 transitions. Second operand 4 states. [2018-11-06 22:06:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:39,176 INFO L93 Difference]: Finished difference Result 376 states and 543 transitions. [2018-11-06 22:06:39,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:39,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-06 22:06:39,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:39,179 INFO L225 Difference]: With dead ends: 376 [2018-11-06 22:06:39,179 INFO L226 Difference]: Without dead ends: 339 [2018-11-06 22:06:39,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 22:06:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-06 22:06:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2018-11-06 22:06:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-06 22:06:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2018-11-06 22:06:39,188 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 37 [2018-11-06 22:06:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:39,189 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2018-11-06 22:06:39,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 22:06:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2018-11-06 22:06:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-06 22:06:39,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:39,190 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:39,191 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:39,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:39,191 INFO L82 PathProgramCache]: Analyzing trace with hash -324997109, now seen corresponding path program 1 times [2018-11-06 22:06:39,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:39,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:39,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:06:39,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:39,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:39,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:39,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:39,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:39,267 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand 3 states. [2018-11-06 22:06:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:39,647 INFO L93 Difference]: Finished difference Result 635 states and 888 transitions. [2018-11-06 22:06:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:39,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-11-06 22:06:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:39,649 INFO L225 Difference]: With dead ends: 635 [2018-11-06 22:06:39,649 INFO L226 Difference]: Without dead ends: 310 [2018-11-06 22:06:39,650 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:39,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-06 22:06:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-11-06 22:06:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-06 22:06:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2018-11-06 22:06:39,658 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 38 [2018-11-06 22:06:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:39,658 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2018-11-06 22:06:39,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2018-11-06 22:06:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-06 22:06:39,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 22:06:39,660 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 22:06:39,660 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 22:06:39,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 22:06:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1440662997, now seen corresponding path program 1 times [2018-11-06 22:06:39,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 22:06:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 22:06:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:39,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 22:06:39,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 22:06:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 22:06:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-06 22:06:39,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 22:06:39,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 22:06:39,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 22:06:39,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 22:06:39,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:39,719 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand 3 states. [2018-11-06 22:06:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 22:06:39,794 INFO L93 Difference]: Finished difference Result 474 states and 665 transitions. [2018-11-06 22:06:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 22:06:39,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-06 22:06:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 22:06:39,795 INFO L225 Difference]: With dead ends: 474 [2018-11-06 22:06:39,795 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 22:06:39,796 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 22:06:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 22:06:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 22:06:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 22:06:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 22:06:39,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-11-06 22:06:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 22:06:39,797 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 22:06:39,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 22:06:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 22:06:39,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 22:06:39,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 22:06:40,104 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-11-06 22:06:40,148 INFO L425 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2018-11-06 22:06:40,148 INFO L425 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2018-11-06 22:06:40,148 INFO L425 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2018-11-06 22:06:40,149 INFO L425 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2018-11-06 22:06:40,150 INFO L425 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2018-11-06 22:06:40,151 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2018-11-06 22:06:40,152 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2018-11-06 22:06:40,153 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2018-11-06 22:06:40,153 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2018-11-06 22:06:40,153 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2018-11-06 22:06:40,153 INFO L421 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2018-11-06 22:06:40,153 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2018-11-06 22:06:40,153 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2018-11-06 22:06:40,154 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2018-11-06 22:06:40,155 INFO L425 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2018-11-06 22:06:40,156 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2018-11-06 22:06:40,157 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2018-11-06 22:06:40,157 INFO L425 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2018-11-06 22:06:40,157 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2018-11-06 22:06:40,157 INFO L421 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~this_m_conn~0 0)) (.cse2 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0)) (.cse3 (= ULTIMATE.start_main_~this_m_conn~0 1)) (.cse0 (= ULTIMATE.start_main_~this_m_delta~0 1))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_main_~q~0 2)) (and .cse3 (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse2) (and .cse0 .cse1 (= ULTIMATE.start_main_~q~0 0) .cse2) (and (= ULTIMATE.start_main_~q~0 3) .cse3 .cse0 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 1)))) [2018-11-06 22:06:40,157 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2018-11-06 22:06:40,158 INFO L425 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2018-11-06 22:06:40,159 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2018-11-06 22:06:40,160 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2018-11-06 22:06:40,161 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2018-11-06 22:06:40,162 INFO L425 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2018-11-06 22:06:40,163 INFO L425 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2018-11-06 22:06:40,164 INFO L425 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2018-11-06 22:06:40,222 INFO L425 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2018-11-06 22:06:40,222 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2018-11-06 22:06:40,223 INFO L425 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L428 ceAbstractionStarter]: At program point L16(lines 16 1255) the Hoare annotation is: true [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2018-11-06 22:06:40,224 INFO L425 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2018-11-06 22:06:40,225 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2018-11-06 22:06:40,226 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2018-11-06 22:06:40,227 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2018-11-06 22:06:40,228 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2018-11-06 22:06:40,229 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2018-11-06 22:06:40,230 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2018-11-06 22:06:40,230 INFO L425 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2018-11-06 22:06:40,230 INFO L425 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2018-11-06 22:06:40,241 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 1250) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_m_delta~0 1)) (.cse1 (= ULTIMATE.start_main_~this_m_conn_data_listener~0 0))) (or (and (= ULTIMATE.start_main_~this_m_conn~0 1) (<= 4 ULTIMATE.start_main_~q~0) .cse0 .cse1) (and .cse0 (= ULTIMATE.start_main_~this_m_conn~0 0) (= ULTIMATE.start_main_~q~0 0) .cse1))) [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 1250) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2018-11-06 22:06:40,242 INFO L425 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2018-11-06 22:06:40,243 INFO L425 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2018-11-06 22:06:40,243 INFO L425 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2018-11-06 22:06:40,243 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2018-11-06 22:06:40,243 INFO L425 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2018-11-06 22:06:40,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:06:40 BoogieIcfgContainer [2018-11-06 22:06:40,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 22:06:40,260 INFO L168 Benchmark]: Toolchain (without parser) took 14394.56 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 934.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -980.9 MB). Peak memory consumption was 620.1 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,261 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 22:06:40,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1318.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,263 INFO L168 Benchmark]: Boogie Procedure Inliner took 366.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.7 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -964.5 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,264 INFO L168 Benchmark]: Boogie Preprocessor took 132.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,264 INFO L168 Benchmark]: RCFGBuilder took 4647.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 213.8 MB). Peak memory consumption was 213.8 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,265 INFO L168 Benchmark]: TraceAbstraction took 7924.28 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 142.1 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -381.3 MB). Peak memory consumption was 427.0 MB. Max. memory is 7.1 GB. [2018-11-06 22:06:40,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1318.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 137.4 MB). Peak memory consumption was 137.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 366.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 792.7 MB). Free memory was 1.3 GB in the beginning and 2.3 GB in the end (delta: -964.5 MB). Peak memory consumption was 37.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.47 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4647.60 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 213.8 MB). Peak memory consumption was 213.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7924.28 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 142.1 MB). Free memory was 2.0 GB in the beginning and 2.4 GB in the end (delta: -381.3 MB). Peak memory consumption was 427.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1254]: 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: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((this_m_delta == 1 && this_m_conn == 0) && this_m_conn_data_listener == 0) && q == 2) || (((this_m_conn == 1 && 4 <= q) && this_m_delta == 1) && this_m_conn_data_listener == 0)) || (((this_m_delta == 1 && this_m_conn == 0) && q == 0) && this_m_conn_data_listener == 0)) || (((q == 3 && this_m_conn == 1) && this_m_delta == 1) && this_m_conn_data_listener == 1) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((this_m_conn == 1 && 4 <= q) && this_m_delta == 1) && this_m_conn_data_listener == 0) || (((this_m_delta == 1 && this_m_conn == 0) && q == 0) && this_m_conn_data_listener == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 237 locations, 1 error locations. SAFE Result, 7.8s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4033 SDtfs, 2122 SDslu, 1761 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=400occurred in iteration=4, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 82 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 11989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...