java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:05,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:05,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:05,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:05,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:05,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:05,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:05,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:05,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:05,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:05,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:05,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:05,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:05,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:05,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:05,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:05,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:05,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:05,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:05,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:05,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:05,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:05,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:05,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:05,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:05,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:05,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:05,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:05,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:05,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:05,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:05,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:05,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:05,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:05,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:05,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:05,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:05,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:05,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:05,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:05,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:05,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:27:05,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:05,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:05,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:05,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:05,961 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:05,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:05,961 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:05,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:05,963 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:05,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:05,963 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:05,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:05,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:05,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:05,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:05,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:05,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:05,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:05,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:05,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:05,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:05,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:05,966 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:05,966 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:05,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:06,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:06,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:06,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:06,020 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:06,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-10-02 14:27:06,098 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433154e4b/fcd1d24d246d47e1b823b468075f012d/FLAGf25e8e85a [2019-10-02 14:27:06,896 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:06,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-10-02 14:27:06,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433154e4b/fcd1d24d246d47e1b823b468075f012d/FLAGf25e8e85a [2019-10-02 14:27:07,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/433154e4b/fcd1d24d246d47e1b823b468075f012d [2019-10-02 14:27:07,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:07,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:07,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:07,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:07,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:07,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:07" (1/1) ... [2019-10-02 14:27:07,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172a208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:07, skipping insertion in model container [2019-10-02 14:27:07,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:07" (1/1) ... [2019-10-02 14:27:07,457 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:07,595 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:08,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:08,593 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:08,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:08,928 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:08,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08 WrapperNode [2019-10-02 14:27:08,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:08,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:08,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:08,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:08,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:08,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:08,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:08,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:09,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:09,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:09,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... [2019-10-02 14:27:09,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:09,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:09,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:09,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:09,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:09,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:10,994 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:10,995 INFO L283 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-02 14:27:10,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:10 BoogieIcfgContainer [2019-10-02 14:27:10,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:10,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:10,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:11,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:11,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:07" (1/3) ... [2019-10-02 14:27:11,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c8070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:11, skipping insertion in model container [2019-10-02 14:27:11,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:08" (2/3) ... [2019-10-02 14:27:11,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c8070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:11, skipping insertion in model container [2019-10-02 14:27:11,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:10" (3/3) ... [2019-10-02 14:27:11,006 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-10-02 14:27:11,018 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:11,027 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:11,047 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:11,084 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:11,085 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:11,086 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:11,086 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:11,086 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:11,086 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:11,086 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:11,086 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:11,087 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:11,121 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states. [2019-10-02 14:27:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 14:27:11,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:11,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:11,133 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -358841446, now seen corresponding path program 1 times [2019-10-02 14:27:11,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:11,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:11,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:11,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:11,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:11,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:27:11,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:27:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:27:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:11,410 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 2 states. [2019-10-02 14:27:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:11,512 INFO L93 Difference]: Finished difference Result 469 states and 916 transitions. [2019-10-02 14:27:11,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:27:11,514 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 14:27:11,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:11,542 INFO L225 Difference]: With dead ends: 469 [2019-10-02 14:27:11,543 INFO L226 Difference]: Without dead ends: 228 [2019-10-02 14:27:11,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-10-02 14:27:11,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2019-10-02 14:27:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-10-02 14:27:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 397 transitions. [2019-10-02 14:27:11,672 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 397 transitions. Word has length 13 [2019-10-02 14:27:11,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:11,672 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 397 transitions. [2019-10-02 14:27:11,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:27:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 397 transitions. [2019-10-02 14:27:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 14:27:11,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:11,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:11,676 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:11,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2001683715, now seen corresponding path program 1 times [2019-10-02 14:27:11,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:11,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:11,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:11,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:11,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:11,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:11,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:11,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:11,819 INFO L87 Difference]: Start difference. First operand 228 states and 397 transitions. Second operand 3 states. [2019-10-02 14:27:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,010 INFO L93 Difference]: Finished difference Result 453 states and 792 transitions. [2019-10-02 14:27:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 14:27:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,014 INFO L225 Difference]: With dead ends: 453 [2019-10-02 14:27:12,014 INFO L226 Difference]: Without dead ends: 231 [2019-10-02 14:27:12,020 INFO L640 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 [2019-10-02 14:27:12,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-02 14:27:12,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2019-10-02 14:27:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-02 14:27:12,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 400 transitions. [2019-10-02 14:27:12,045 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 400 transitions. Word has length 14 [2019-10-02 14:27:12,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,046 INFO L475 AbstractCegarLoop]: Abstraction has 231 states and 400 transitions. [2019-10-02 14:27:12,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,046 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 400 transitions. [2019-10-02 14:27:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 14:27:12,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,048 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,048 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 912246429, now seen corresponding path program 1 times [2019-10-02 14:27:12,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,144 INFO L87 Difference]: Start difference. First operand 231 states and 400 transitions. Second operand 3 states. [2019-10-02 14:27:12,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,253 INFO L93 Difference]: Finished difference Result 440 states and 773 transitions. [2019-10-02 14:27:12,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 14:27:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,256 INFO L225 Difference]: With dead ends: 440 [2019-10-02 14:27:12,256 INFO L226 Difference]: Without dead ends: 216 [2019-10-02 14:27:12,257 INFO L640 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 [2019-10-02 14:27:12,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-10-02 14:27:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-10-02 14:27:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-02 14:27:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-10-02 14:27:12,273 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 19 [2019-10-02 14:27:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,274 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-10-02 14:27:12,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-10-02 14:27:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 14:27:12,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,276 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,276 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1491178682, now seen corresponding path program 1 times [2019-10-02 14:27:12,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,331 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-10-02 14:27:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,604 INFO L93 Difference]: Finished difference Result 618 states and 1102 transitions. [2019-10-02 14:27:12,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-02 14:27:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,608 INFO L225 Difference]: With dead ends: 618 [2019-10-02 14:27:12,608 INFO L226 Difference]: Without dead ends: 410 [2019-10-02 14:27:12,609 INFO L640 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 [2019-10-02 14:27:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-10-02 14:27:12,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 404. [2019-10-02 14:27:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-10-02 14:27:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 722 transitions. [2019-10-02 14:27:12,624 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 722 transitions. Word has length 22 [2019-10-02 14:27:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,624 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 722 transitions. [2019-10-02 14:27:12,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 722 transitions. [2019-10-02 14:27:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 14:27:12,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,630 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,630 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1582631867, now seen corresponding path program 1 times [2019-10-02 14:27:12,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,773 INFO L87 Difference]: Start difference. First operand 404 states and 722 transitions. Second operand 3 states. [2019-10-02 14:27:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:12,896 INFO L93 Difference]: Finished difference Result 640 states and 1134 transitions. [2019-10-02 14:27:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:12,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 14:27:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:12,899 INFO L225 Difference]: With dead ends: 640 [2019-10-02 14:27:12,899 INFO L226 Difference]: Without dead ends: 248 [2019-10-02 14:27:12,900 INFO L640 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 [2019-10-02 14:27:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-02 14:27:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2019-10-02 14:27:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-02 14:27:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 422 transitions. [2019-10-02 14:27:12,909 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 422 transitions. Word has length 23 [2019-10-02 14:27:12,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:12,910 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 422 transitions. [2019-10-02 14:27:12,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 422 transitions. [2019-10-02 14:27:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 14:27:12,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:12,911 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:12,911 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1006681014, now seen corresponding path program 1 times [2019-10-02 14:27:12,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:12,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:12,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:12,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:12,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:12,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:12,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:12,946 INFO L87 Difference]: Start difference. First operand 246 states and 422 transitions. Second operand 3 states. [2019-10-02 14:27:13,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,086 INFO L93 Difference]: Finished difference Result 248 states and 423 transitions. [2019-10-02 14:27:13,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:13,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 14:27:13,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,090 INFO L225 Difference]: With dead ends: 248 [2019-10-02 14:27:13,091 INFO L226 Difference]: Without dead ends: 246 [2019-10-02 14:27:13,091 INFO L640 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 [2019-10-02 14:27:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-10-02 14:27:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2019-10-02 14:27:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-02 14:27:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 414 transitions. [2019-10-02 14:27:13,103 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 414 transitions. Word has length 23 [2019-10-02 14:27:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,105 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 414 transitions. [2019-10-02 14:27:13,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 414 transitions. [2019-10-02 14:27:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 14:27:13,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:13,107 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 14:27:13,107 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1124944987, now seen corresponding path program 1 times [2019-10-02 14:27:13,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:13,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:13,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:13,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:13,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:13,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:13,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:13,202 INFO L87 Difference]: Start difference. First operand 246 states and 414 transitions. Second operand 3 states. [2019-10-02 14:27:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,709 INFO L93 Difference]: Finished difference Result 653 states and 1108 transitions. [2019-10-02 14:27:13,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:13,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 14:27:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,717 INFO L225 Difference]: With dead ends: 653 [2019-10-02 14:27:13,717 INFO L226 Difference]: Without dead ends: 415 [2019-10-02 14:27:13,721 INFO L640 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 [2019-10-02 14:27:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-10-02 14:27:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 402. [2019-10-02 14:27:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-10-02 14:27:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 614 transitions. [2019-10-02 14:27:13,745 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 614 transitions. Word has length 26 [2019-10-02 14:27:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,747 INFO L475 AbstractCegarLoop]: Abstraction has 402 states and 614 transitions. [2019-10-02 14:27:13,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 614 transitions. [2019-10-02 14:27:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 14:27:13,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:13,753 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:27:13,753 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:13,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1803598039, now seen corresponding path program 1 times [2019-10-02 14:27:13,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:13,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:13,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:13,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:13,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:13,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:13,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:13,805 INFO L87 Difference]: Start difference. First operand 402 states and 614 transitions. Second operand 3 states. [2019-10-02 14:27:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,857 INFO L93 Difference]: Finished difference Result 733 states and 1129 transitions. [2019-10-02 14:27:13,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:13,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-02 14:27:13,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,864 INFO L225 Difference]: With dead ends: 733 [2019-10-02 14:27:13,865 INFO L226 Difference]: Without dead ends: 343 [2019-10-02 14:27:13,866 INFO L640 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 [2019-10-02 14:27:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-02 14:27:13,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-10-02 14:27:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-10-02 14:27:13,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2019-10-02 14:27:13,879 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 36 [2019-10-02 14:27:13,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,879 INFO L475 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2019-10-02 14:27:13,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:13,880 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2019-10-02 14:27:13,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 14:27:13,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:13,882 INFO L411 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] [2019-10-02 14:27:13,883 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1771198676, now seen corresponding path program 1 times [2019-10-02 14:27:13,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:13,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:13,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:13,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:13,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:13,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:13,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:13,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:13,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:13,930 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand 3 states. [2019-10-02 14:27:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:13,980 INFO L93 Difference]: Finished difference Result 668 states and 1033 transitions. [2019-10-02 14:27:13,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:13,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 14:27:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:13,983 INFO L225 Difference]: With dead ends: 668 [2019-10-02 14:27:13,983 INFO L226 Difference]: Without dead ends: 337 [2019-10-02 14:27:13,985 INFO L640 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 [2019-10-02 14:27:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-10-02 14:27:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2019-10-02 14:27:13,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-02 14:27:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 506 transitions. [2019-10-02 14:27:13,995 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 506 transitions. Word has length 37 [2019-10-02 14:27:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:13,996 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 506 transitions. [2019-10-02 14:27:13,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:13,996 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 506 transitions. [2019-10-02 14:27:13,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 14:27:13,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:13,997 INFO L411 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, 1, 1] [2019-10-02 14:27:13,998 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:13,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:13,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2025838196, now seen corresponding path program 1 times [2019-10-02 14:27:13,998 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:13,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:14,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:14,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:27:14,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:27:14,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:27:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:27:14,071 INFO L87 Difference]: Start difference. First operand 337 states and 506 transitions. Second operand 4 states. [2019-10-02 14:27:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:14,501 INFO L93 Difference]: Finished difference Result 380 states and 547 transitions. [2019-10-02 14:27:14,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:14,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-02 14:27:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:14,507 INFO L225 Difference]: With dead ends: 380 [2019-10-02 14:27:14,507 INFO L226 Difference]: Without dead ends: 343 [2019-10-02 14:27:14,507 INFO L640 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 [2019-10-02 14:27:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-10-02 14:27:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 337. [2019-10-02 14:27:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-10-02 14:27:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 470 transitions. [2019-10-02 14:27:14,522 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 470 transitions. Word has length 41 [2019-10-02 14:27:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:14,522 INFO L475 AbstractCegarLoop]: Abstraction has 337 states and 470 transitions. [2019-10-02 14:27:14,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:27:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 470 transitions. [2019-10-02 14:27:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 14:27:14,524 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:14,525 INFO L411 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, 1, 1, 1] [2019-10-02 14:27:14,527 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash -197451388, now seen corresponding path program 1 times [2019-10-02 14:27:14,528 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:14,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:14,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:14,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:14,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:14,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:14,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:14,574 INFO L87 Difference]: Start difference. First operand 337 states and 470 transitions. Second operand 3 states. [2019-10-02 14:27:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:14,613 INFO L93 Difference]: Finished difference Result 639 states and 892 transitions. [2019-10-02 14:27:14,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:14,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-02 14:27:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:14,617 INFO L225 Difference]: With dead ends: 639 [2019-10-02 14:27:14,617 INFO L226 Difference]: Without dead ends: 314 [2019-10-02 14:27:14,619 INFO L640 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 [2019-10-02 14:27:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-10-02 14:27:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2019-10-02 14:27:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-02 14:27:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2019-10-02 14:27:14,627 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 42 [2019-10-02 14:27:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:14,627 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2019-10-02 14:27:14,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2019-10-02 14:27:14,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:27:14,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:14,628 INFO L411 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, 1, 1, 1, 1] [2019-10-02 14:27:14,629 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1099613084, now seen corresponding path program 1 times [2019-10-02 14:27:14,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:14,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:27:14,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:14,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:14,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:14,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:14,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:14,662 INFO L87 Difference]: Start difference. First operand 314 states and 433 transitions. Second operand 3 states. [2019-10-02 14:27:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:14,698 INFO L93 Difference]: Finished difference Result 478 states and 669 transitions. [2019-10-02 14:27:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:14,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 14:27:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:14,699 INFO L225 Difference]: With dead ends: 478 [2019-10-02 14:27:14,699 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 14:27:14,701 INFO L640 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 [2019-10-02 14:27:14,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 14:27:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 14:27:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 14:27:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 14:27:14,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2019-10-02 14:27:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:14,702 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 14:27:14,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 14:27:14,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 14:27:14,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 14:27:14,849 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:14,850 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:14,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:14,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 14:27:14,850 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-02 14:27:14,850 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 14:27:14,850 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 14:27:14,850 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 1255) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-10-02 14:27:14,851 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-10-02 14:27:14,852 INFO L443 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-10-02 14:27:14,853 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-10-02 14:27:14,854 INFO L443 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-10-02 14:27:14,855 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-10-02 14:27:14,855 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-10-02 14:27:14,855 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-10-02 14:27:14,855 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-10-02 14:27:14,855 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L439 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-10-02 14:27:14,856 INFO L443 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-10-02 14:27:14,857 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-02 14:27:14,858 INFO L443 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-10-02 14:27:14,859 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-10-02 14:27:14,860 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-10-02 14:27:14,860 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-10-02 14:27:14,860 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-10-02 14:27:14,860 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-10-02 14:27:14,860 INFO L439 ceAbstractionStarter]: At program point L1246(lines 32 1250) the Hoare annotation is: (let ((.cse1 (<= 1 main_~this_m_conn~0)) (.cse0 (<= 1 main_~this_m_delta~0)) (.cse3 (= 0 main_~this_m_conn~0)) (.cse2 (= 0 main_~this_m_conn_data_listener~0))) (or (and (<= 1 main_~this_m_conn_data_listener~0) .cse0 .cse1 (= 3 main_~q~0)) (and .cse0 (<= 4 main_~q~0) .cse1 .cse2) (and .cse0 (= 2 main_~q~0) .cse3 .cse2) (and .cse0 .cse3 (= main_~q~0 0) .cse2))) [2019-10-02 14:27:14,860 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-10-02 14:27:14,861 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-10-02 14:27:14,862 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-10-02 14:27:14,863 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-10-02 14:27:14,864 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-10-02 14:27:14,865 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 16 1255) no Hoare annotation was computed. [2019-10-02 14:27:14,866 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-10-02 14:27:14,867 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-10-02 14:27:14,868 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-10-02 14:27:14,869 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-10-02 14:27:14,870 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-10-02 14:27:14,871 INFO L443 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-02 14:27:14,872 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-10-02 14:27:14,873 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-10-02 14:27:14,874 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-10-02 14:27:14,875 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 1255) the Hoare annotation is: true [2019-10-02 14:27:14,875 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-10-02 14:27:14,876 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 32 1250) the Hoare annotation is: (let ((.cse0 (<= 1 main_~this_m_delta~0)) (.cse1 (= 0 main_~this_m_conn_data_listener~0))) (or (and .cse0 (<= 4 main_~q~0) (<= 1 main_~this_m_conn~0) .cse1) (and .cse0 (= 0 main_~this_m_conn~0) (= main_~q~0 0) .cse1))) [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-10-02 14:27:14,877 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-10-02 14:27:14,878 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-10-02 14:27:14,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 02:27:14 BoogieIcfgContainer [2019-10-02 14:27:14,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 14:27:14,899 INFO L168 Benchmark]: Toolchain (without parser) took 7455.71 ms. Allocated memory was 139.5 MB in the beginning and 361.8 MB in the end (delta: 222.3 MB). Free memory was 76.4 MB in the beginning and 232.8 MB in the end (delta: -156.4 MB). Peak memory consumption was 65.9 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:14,900 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 139.5 MB. Free memory is still 103.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 14:27:14,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1486.39 ms. Allocated memory was 139.5 MB in the beginning and 220.7 MB in the end (delta: 81.3 MB). Free memory was 76.4 MB in the beginning and 102.6 MB in the end (delta: -26.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:14,902 INFO L168 Benchmark]: Boogie Preprocessor took 254.53 ms. Allocated memory is still 220.7 MB. Free memory was 102.6 MB in the beginning and 88.2 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:14,903 INFO L168 Benchmark]: RCFGBuilder took 1811.69 ms. Allocated memory was 220.7 MB in the beginning and 271.6 MB in the end (delta: 50.9 MB). Free memory was 88.2 MB in the beginning and 188.6 MB in the end (delta: -100.3 MB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:14,903 INFO L168 Benchmark]: TraceAbstraction took 3898.86 ms. Allocated memory was 271.6 MB in the beginning and 361.8 MB in the end (delta: 90.2 MB). Free memory was 188.6 MB in the beginning and 232.8 MB in the end (delta: -44.2 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-10-02 14:27:14,907 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 139.5 MB. Free memory is still 103.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1486.39 ms. Allocated memory was 139.5 MB in the beginning and 220.7 MB in the end (delta: 81.3 MB). Free memory was 76.4 MB in the beginning and 102.6 MB in the end (delta: -26.2 MB). Peak memory consumption was 68.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 254.53 ms. Allocated memory is still 220.7 MB. Free memory was 102.6 MB in the beginning and 88.2 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1811.69 ms. Allocated memory was 220.7 MB in the beginning and 271.6 MB in the end (delta: 50.9 MB). Free memory was 88.2 MB in the beginning and 188.6 MB in the end (delta: -100.3 MB). Peak memory consumption was 68.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3898.86 ms. Allocated memory was 271.6 MB in the beginning and 361.8 MB in the end (delta: 90.2 MB). Free memory was 188.6 MB in the beginning and 232.8 MB in the end (delta: -44.2 MB). Peak memory consumption was 45.9 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: (((((1 <= this_m_conn_data_listener && 1 <= this_m_delta) && 1 <= this_m_conn) && 3 == q) || (((1 <= this_m_delta && 4 <= q) && 1 <= this_m_conn) && 0 == this_m_conn_data_listener)) || (((1 <= this_m_delta && 2 == q) && 0 == this_m_conn) && 0 == this_m_conn_data_listener)) || (((1 <= this_m_delta && 0 == this_m_conn) && q == 0) && 0 == this_m_conn_data_listener) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((1 <= this_m_delta && 4 <= q) && 1 <= this_m_conn) && 0 == this_m_conn_data_listener) || (((1 <= this_m_delta && 0 == this_m_conn) && q == 0) && 0 == this_m_conn_data_listener) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 242 locations, 1 error locations. SAFE Result, 3.8s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4082 SDtfs, 2122 SDslu, 1809 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred 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, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 85 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 15057 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...