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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/psyco/psyco_accelerometer_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:24:15,742 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:24:15,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:24:15,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:24:15,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:24:15,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:24:15,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:24:15,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:24:15,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:24:15,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:24:15,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:24:15,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:24:15,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:24:15,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:24:15,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:24:15,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:24:15,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:24:15,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:24:15,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:24:15,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:24:15,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:24:15,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:24:15,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:24:15,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:24:15,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:24:15,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:24:15,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:24:15,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:24:15,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:24:15,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:24:15,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:24:15,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:24:15,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:24:15,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:24:15,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:24:15,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:24:15,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:24:15,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:24:15,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:24:15,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:24:15,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:24:15,818 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-15 03:24:15,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:24:15,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:24:15,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:24:15,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:24:15,840 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:24:15,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:24:15,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:24:15,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:24:15,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:24:15,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:24:15,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:24:15,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:24:15,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:24:15,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:24:15,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:24:15,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:24:15,844 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:24:15,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:24:15,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:24:15,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:24:15,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:24:15,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:15,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:24:15,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:24:15,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:24:15,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:24:15,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:24:15,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:24:15,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:24:16,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:24:16,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:24:16,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:24:16,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:24:16,190 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:24:16,192 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-15 03:24:16,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be3a7b94/31698ced3ceb4800be344f821ad47198/FLAG1b6781c89 [2019-10-15 03:24:17,159 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:24:17,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_accelerometer_1.c [2019-10-15 03:24:17,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be3a7b94/31698ced3ceb4800be344f821ad47198/FLAG1b6781c89 [2019-10-15 03:24:17,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6be3a7b94/31698ced3ceb4800be344f821ad47198 [2019-10-15 03:24:17,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:24:17,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:24:17,648 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:17,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:24:17,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:24:17,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:17" (1/1) ... [2019-10-15 03:24:17,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d3d406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:17, skipping insertion in model container [2019-10-15 03:24:17,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:24:17" (1/1) ... [2019-10-15 03:24:17,666 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:24:17,785 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:24:18,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:18,652 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:24:19,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:24:19,037 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:24:19,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19 WrapperNode [2019-10-15 03:24:19,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:24:19,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:24:19,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:24:19,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:24:19,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... [2019-10-15 03:24:19,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:24:19,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:24:19,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:24:19,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:24:19,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:24:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:24:19,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:24:19,351 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:24:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:24:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:24:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:24:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:24:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:24:21,156 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:24:21,156 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-10-15 03:24:21,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:21 BoogieIcfgContainer [2019-10-15 03:24:21,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:24:21,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:24:21,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:24:21,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:24:21,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:24:17" (1/3) ... [2019-10-15 03:24:21,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257646af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:21, skipping insertion in model container [2019-10-15 03:24:21,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:24:19" (2/3) ... [2019-10-15 03:24:21,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257646af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:24:21, skipping insertion in model container [2019-10-15 03:24:21,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:24:21" (3/3) ... [2019-10-15 03:24:21,184 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_accelerometer_1.c [2019-10-15 03:24:21,198 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:24:21,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:24:21,228 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:24:21,277 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:24:21,277 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:24:21,278 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:24:21,278 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:24:21,278 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:24:21,278 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:24:21,278 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:24:21,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:24:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-10-15 03:24:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:24:21,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:21,333 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:21,336 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:21,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1507363399, now seen corresponding path program 1 times [2019-10-15 03:24:21,357 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:21,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462006718] [2019-10-15 03:24:21,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:21,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:21,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:21,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:21,555 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-15 03:24:21,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462006718] [2019-10-15 03:24:21,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:21,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 03:24:21,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124913618] [2019-10-15 03:24:21,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 03:24:21,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:21,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 03:24:21,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 03:24:21,583 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 2 states. [2019-10-15 03:24:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:21,645 INFO L93 Difference]: Finished difference Result 468 states and 915 transitions. [2019-10-15 03:24:21,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 03:24:21,647 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-15 03:24:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:21,673 INFO L225 Difference]: With dead ends: 468 [2019-10-15 03:24:21,673 INFO L226 Difference]: Without dead ends: 227 [2019-10-15 03:24:21,683 INFO L600 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-15 03:24:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-15 03:24:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2019-10-15 03:24:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-15 03:24:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 396 transitions. [2019-10-15 03:24:21,764 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 396 transitions. Word has length 12 [2019-10-15 03:24:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:21,764 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 396 transitions. [2019-10-15 03:24:21,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 03:24:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 396 transitions. [2019-10-15 03:24:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:24:21,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:21,766 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:21,766 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:21,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1048841406, now seen corresponding path program 1 times [2019-10-15 03:24:21,769 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:21,770 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817567055] [2019-10-15 03:24:21,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:21,770 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:21,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:21,862 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-15 03:24:21,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817567055] [2019-10-15 03:24:21,863 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:21,863 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:21,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695854197] [2019-10-15 03:24:21,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:21,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:21,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:21,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:21,870 INFO L87 Difference]: Start difference. First operand 227 states and 396 transitions. Second operand 3 states. [2019-10-15 03:24:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:22,091 INFO L93 Difference]: Finished difference Result 452 states and 791 transitions. [2019-10-15 03:24:22,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:22,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-15 03:24:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:22,096 INFO L225 Difference]: With dead ends: 452 [2019-10-15 03:24:22,096 INFO L226 Difference]: Without dead ends: 230 [2019-10-15 03:24:22,100 INFO L600 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-15 03:24:22,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-15 03:24:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-15 03:24:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-15 03:24:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 399 transitions. [2019-10-15 03:24:22,119 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 399 transitions. Word has length 13 [2019-10-15 03:24:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:22,119 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 399 transitions. [2019-10-15 03:24:22,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 399 transitions. [2019-10-15 03:24:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:24:22,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:22,121 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:22,121 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:22,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1370593924, now seen corresponding path program 1 times [2019-10-15 03:24:22,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:22,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853250407] [2019-10-15 03:24:22,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,122 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:22,181 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-15 03:24:22,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853250407] [2019-10-15 03:24:22,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:22,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:22,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709540158] [2019-10-15 03:24:22,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:22,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:22,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:22,187 INFO L87 Difference]: Start difference. First operand 230 states and 399 transitions. Second operand 3 states. [2019-10-15 03:24:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:22,319 INFO L93 Difference]: Finished difference Result 439 states and 772 transitions. [2019-10-15 03:24:22,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:22,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-15 03:24:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:22,324 INFO L225 Difference]: With dead ends: 439 [2019-10-15 03:24:22,324 INFO L226 Difference]: Without dead ends: 215 [2019-10-15 03:24:22,329 INFO L600 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-15 03:24:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-15 03:24:22,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-10-15 03:24:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-10-15 03:24:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 377 transitions. [2019-10-15 03:24:22,355 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 377 transitions. Word has length 18 [2019-10-15 03:24:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:22,355 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 377 transitions. [2019-10-15 03:24:22,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 377 transitions. [2019-10-15 03:24:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:24:22,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:22,357 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:24:22,359 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -93612677, now seen corresponding path program 1 times [2019-10-15 03:24:22,360 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:22,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646295801] [2019-10-15 03:24:22,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:22,521 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-15 03:24:22,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646295801] [2019-10-15 03:24:22,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:22,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:22,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904833364] [2019-10-15 03:24:22,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:22,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:22,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:22,524 INFO L87 Difference]: Start difference. First operand 215 states and 377 transitions. Second operand 3 states. [2019-10-15 03:24:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:22,833 INFO L93 Difference]: Finished difference Result 617 states and 1101 transitions. [2019-10-15 03:24:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:22,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-15 03:24:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:22,838 INFO L225 Difference]: With dead ends: 617 [2019-10-15 03:24:22,838 INFO L226 Difference]: Without dead ends: 409 [2019-10-15 03:24:22,839 INFO L600 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-15 03:24:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-15 03:24:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2019-10-15 03:24:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2019-10-15 03:24:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 721 transitions. [2019-10-15 03:24:22,869 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 721 transitions. Word has length 21 [2019-10-15 03:24:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:22,870 INFO L462 AbstractCegarLoop]: Abstraction has 403 states and 721 transitions. [2019-10-15 03:24:22,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 721 transitions. [2019-10-15 03:24:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:24:22,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:22,875 INFO L380 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-15 03:24:22,875 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:22,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:22,876 INFO L82 PathProgramCache]: Analyzing trace with hash -301260006, now seen corresponding path program 1 times [2019-10-15 03:24:22,876 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:22,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453344020] [2019-10-15 03:24:22,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:22,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:22,967 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-15 03:24:22,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453344020] [2019-10-15 03:24:22,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:22,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:22,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492719306] [2019-10-15 03:24:22,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:22,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:22,970 INFO L87 Difference]: Start difference. First operand 403 states and 721 transitions. Second operand 3 states. [2019-10-15 03:24:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:23,111 INFO L93 Difference]: Finished difference Result 639 states and 1133 transitions. [2019-10-15 03:24:23,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:23,111 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 03:24:23,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:23,113 INFO L225 Difference]: With dead ends: 639 [2019-10-15 03:24:23,114 INFO L226 Difference]: Without dead ends: 247 [2019-10-15 03:24:23,115 INFO L600 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-15 03:24:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-15 03:24:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-10-15 03:24:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-15 03:24:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 421 transitions. [2019-10-15 03:24:23,128 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 421 transitions. Word has length 22 [2019-10-15 03:24:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:23,128 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 421 transitions. [2019-10-15 03:24:23,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 421 transitions. [2019-10-15 03:24:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:24:23,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:23,129 INFO L380 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-15 03:24:23,130 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:23,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:23,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1404394409, now seen corresponding path program 1 times [2019-10-15 03:24:23,130 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:23,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344886094] [2019-10-15 03:24:23,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:23,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:23,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:23,171 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-15 03:24:23,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344886094] [2019-10-15 03:24:23,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:23,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:23,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260089093] [2019-10-15 03:24:23,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:23,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:23,175 INFO L87 Difference]: Start difference. First operand 245 states and 421 transitions. Second operand 3 states. [2019-10-15 03:24:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:23,330 INFO L93 Difference]: Finished difference Result 247 states and 422 transitions. [2019-10-15 03:24:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:23,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-15 03:24:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:23,334 INFO L225 Difference]: With dead ends: 247 [2019-10-15 03:24:23,334 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 03:24:23,335 INFO L600 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-15 03:24:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 03:24:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-15 03:24:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-15 03:24:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 413 transitions. [2019-10-15 03:24:23,350 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 413 transitions. Word has length 22 [2019-10-15 03:24:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:23,351 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 413 transitions. [2019-10-15 03:24:23,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 413 transitions. [2019-10-15 03:24:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 03:24:23,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:23,352 INFO L380 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] [2019-10-15 03:24:23,352 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:23,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:23,359 INFO L82 PathProgramCache]: Analyzing trace with hash 439813276, now seen corresponding path program 1 times [2019-10-15 03:24:23,359 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:23,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245580279] [2019-10-15 03:24:23,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:23,360 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:23,464 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-15 03:24:23,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245580279] [2019-10-15 03:24:23,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:23,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:23,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341691150] [2019-10-15 03:24:23,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:23,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:23,467 INFO L87 Difference]: Start difference. First operand 245 states and 413 transitions. Second operand 3 states. [2019-10-15 03:24:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:24,051 INFO L93 Difference]: Finished difference Result 652 states and 1107 transitions. [2019-10-15 03:24:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:24,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 03:24:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:24,055 INFO L225 Difference]: With dead ends: 652 [2019-10-15 03:24:24,055 INFO L226 Difference]: Without dead ends: 414 [2019-10-15 03:24:24,056 INFO L600 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-15 03:24:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-10-15 03:24:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 401. [2019-10-15 03:24:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-10-15 03:24:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 613 transitions. [2019-10-15 03:24:24,081 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 613 transitions. Word has length 25 [2019-10-15 03:24:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:24,082 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 613 transitions. [2019-10-15 03:24:24,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 613 transitions. [2019-10-15 03:24:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-15 03:24:24,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:24,084 INFO L380 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] [2019-10-15 03:24:24,087 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2062836266, now seen corresponding path program 1 times [2019-10-15 03:24:24,088 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:24,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284270261] [2019-10-15 03:24:24,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:24,169 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-15 03:24:24,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284270261] [2019-10-15 03:24:24,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:24,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:24,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935302398] [2019-10-15 03:24:24,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:24,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:24,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:24,172 INFO L87 Difference]: Start difference. First operand 401 states and 613 transitions. Second operand 3 states. [2019-10-15 03:24:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:24,265 INFO L93 Difference]: Finished difference Result 732 states and 1128 transitions. [2019-10-15 03:24:24,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:24,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-15 03:24:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:24,268 INFO L225 Difference]: With dead ends: 732 [2019-10-15 03:24:24,269 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 03:24:24,270 INFO L600 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-15 03:24:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 03:24:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-10-15 03:24:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-10-15 03:24:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 525 transitions. [2019-10-15 03:24:24,281 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 525 transitions. Word has length 35 [2019-10-15 03:24:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:24,281 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 525 transitions. [2019-10-15 03:24:24,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 525 transitions. [2019-10-15 03:24:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-15 03:24:24,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:24,283 INFO L380 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] [2019-10-15 03:24:24,283 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:24,284 INFO L82 PathProgramCache]: Analyzing trace with hash 2124147787, now seen corresponding path program 1 times [2019-10-15 03:24:24,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:24,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744586216] [2019-10-15 03:24:24,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:24,319 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-15 03:24:24,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744586216] [2019-10-15 03:24:24,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:24,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:24,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249114726] [2019-10-15 03:24:24,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:24,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:24,322 INFO L87 Difference]: Start difference. First operand 342 states and 525 transitions. Second operand 3 states. [2019-10-15 03:24:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:24,378 INFO L93 Difference]: Finished difference Result 667 states and 1032 transitions. [2019-10-15 03:24:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:24,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-15 03:24:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:24,381 INFO L225 Difference]: With dead ends: 667 [2019-10-15 03:24:24,381 INFO L226 Difference]: Without dead ends: 336 [2019-10-15 03:24:24,382 INFO L600 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-15 03:24:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-15 03:24:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2019-10-15 03:24:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 03:24:24,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 505 transitions. [2019-10-15 03:24:24,393 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 505 transitions. Word has length 36 [2019-10-15 03:24:24,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:24,393 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 505 transitions. [2019-10-15 03:24:24,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 505 transitions. [2019-10-15 03:24:24,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:24:24,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:24,395 INFO L380 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] [2019-10-15 03:24:24,395 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:24,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:24,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1987626795, now seen corresponding path program 1 times [2019-10-15 03:24:24,396 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:24,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700883425] [2019-10-15 03:24:24,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,396 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:24,467 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-15 03:24:24,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700883425] [2019-10-15 03:24:24,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:24,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:24:24,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542562251] [2019-10-15 03:24:24,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:24:24,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:24:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:24:24,473 INFO L87 Difference]: Start difference. First operand 336 states and 505 transitions. Second operand 4 states. [2019-10-15 03:24:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:24,923 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2019-10-15 03:24:24,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:24,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-15 03:24:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:24,927 INFO L225 Difference]: With dead ends: 379 [2019-10-15 03:24:24,927 INFO L226 Difference]: Without dead ends: 342 [2019-10-15 03:24:24,931 INFO L600 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-15 03:24:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-15 03:24:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-10-15 03:24:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-15 03:24:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 469 transitions. [2019-10-15 03:24:24,949 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 469 transitions. Word has length 40 [2019-10-15 03:24:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:24,951 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 469 transitions. [2019-10-15 03:24:24,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:24:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 469 transitions. [2019-10-15 03:24:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:24:24,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:24,955 INFO L380 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-15 03:24:24,955 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:24,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash -334088251, now seen corresponding path program 1 times [2019-10-15 03:24:24,956 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:24,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525884561] [2019-10-15 03:24:24,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,957 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:24,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:25,018 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-15 03:24:25,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525884561] [2019-10-15 03:24:25,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:25,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:25,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706413121] [2019-10-15 03:24:25,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:25,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:25,022 INFO L87 Difference]: Start difference. First operand 336 states and 469 transitions. Second operand 3 states. [2019-10-15 03:24:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:25,070 INFO L93 Difference]: Finished difference Result 638 states and 891 transitions. [2019-10-15 03:24:25,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:25,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 03:24:25,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:25,073 INFO L225 Difference]: With dead ends: 638 [2019-10-15 03:24:25,073 INFO L226 Difference]: Without dead ends: 313 [2019-10-15 03:24:25,074 INFO L600 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-15 03:24:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-10-15 03:24:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2019-10-15 03:24:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-15 03:24:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2019-10-15 03:24:25,083 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 41 [2019-10-15 03:24:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:25,083 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2019-10-15 03:24:25,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2019-10-15 03:24:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:24:25,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:24:25,084 INFO L380 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-15 03:24:25,085 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:24:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:24:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1158837627, now seen corresponding path program 1 times [2019-10-15 03:24:25,085 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:24:25,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79838547] [2019-10-15 03:24:25,085 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:25,086 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:24:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:24:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:24:25,117 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-15 03:24:25,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79838547] [2019-10-15 03:24:25,118 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:24:25,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:24:25,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579484917] [2019-10-15 03:24:25,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:24:25,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:24:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:24:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:24:25,119 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand 3 states. [2019-10-15 03:24:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:24:25,169 INFO L93 Difference]: Finished difference Result 477 states and 668 transitions. [2019-10-15 03:24:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:24:25,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-15 03:24:25,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:24:25,170 INFO L225 Difference]: With dead ends: 477 [2019-10-15 03:24:25,170 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:24:25,171 INFO L600 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-15 03:24:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:24:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:24:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:24:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:24:25,172 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-10-15 03:24:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:24:25,172 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:24:25,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:24:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:24:25,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:24:25,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:24:25,339 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:24:25,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:24:25,339 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:24:25,340 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 16 1255) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 897) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point L763(lines 763 774) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point L697(lines 697 712) no Hoare annotation was computed. [2019-10-15 03:24:25,340 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 369) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 237) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 833) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 648) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 173) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L1229(lines 1229 1244) no Hoare annotation was computed. [2019-10-15 03:24:25,341 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 769) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 646) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 584) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1242) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L1165(lines 1165 1180) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L1033(lines 1033 1048) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L703(lines 703 705) no Hoare annotation was computed. [2019-10-15 03:24:25,342 INFO L443 ceAbstractionStarter]: For program point L571(lines 571 582) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 520) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L1167(lines 1167 1178) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L1101(lines 1101 1116) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 63) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1046) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 984) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 641) no Hoare annotation was computed. [2019-10-15 03:24:25,343 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 518) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 456) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 324) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 60) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L1235(lines 1235 1237) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L1103(lines 1103 1114) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L905(lines 905 920) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 577) no Hoare annotation was computed. [2019-10-15 03:24:25,344 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 454) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 392) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 322) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 260) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L439 ceAbstractionStarter]: At program point L1236(lines 16 1255) the Hoare annotation is: false [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 128) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L1171(lines 1171 1173) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1041) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 918) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 856) no Hoare annotation was computed. [2019-10-15 03:24:25,345 INFO L443 ceAbstractionStarter]: For program point L511(lines 511 513) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L379(lines 379 390) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 258) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 196) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1109) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 977) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L843(lines 843 854) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 792) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 449) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 317) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 194) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-10-15 03:24:25,346 INFO L443 ceAbstractionStarter]: For program point L911(lines 911 913) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 790) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L713(lines 713 728) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 385) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 253) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 121) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L847(lines 847 849) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L715(lines 715 726) no Hoare annotation was computed. [2019-10-15 03:24:25,347 INFO L443 ceAbstractionStarter]: For program point L649(lines 649 664) no Hoare annotation was computed. [2019-10-15 03:24:25,348 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 189) no Hoare annotation was computed. [2019-10-15 03:24:25,348 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 785) no Hoare annotation was computed. [2019-10-15 03:24:25,348 INFO L443 ceAbstractionStarter]: For program point L651(lines 651 662) no Hoare annotation was computed. [2019-10-15 03:24:25,348 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 600) no Hoare annotation was computed. [2019-10-15 03:24:25,348 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-15 03:24:25,348 INFO L443 ceAbstractionStarter]: For program point L1181(lines 1181 1196) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1064) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L719(lines 719 721) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 598) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 536) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L1183(lines 1183 1194) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L1117(lines 1117 1132) no Hoare annotation was computed. [2019-10-15 03:24:25,349 INFO L443 ceAbstractionStarter]: For program point L1051(lines 1051 1062) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1000) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L655(lines 655 657) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L523(lines 523 534) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L457(lines 457 472) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L1119(lines 1119 1130) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L987(lines 987 998) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L921(lines 921 936) no Hoare annotation was computed. [2019-10-15 03:24:25,350 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 593) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L459(lines 459 470) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L393(lines 393 408) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 276) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 144) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 1067) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L1187(lines 1187 1189) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L64(lines 64 147) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L1055(lines 1055 1057) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L923(lines 923 934) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L857(lines 857 872) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 406) no Hoare annotation was computed. [2019-10-15 03:24:25,351 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 344) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 274) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 212) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L131(lines 131 142) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 80) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L1123(lines 1123 1125) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L991(lines 991 993) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 808) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 465) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 342) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L199(lines 199 210) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 78) no Hoare annotation was computed. [2019-10-15 03:24:25,352 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 929) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 806) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L729(lines 729 744) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 401) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L267(lines 267 269) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 137) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 865) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 742) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 680) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 337) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 16 1255) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 205) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 801) no Hoare annotation was computed. [2019-10-15 03:24:25,353 INFO L443 ceAbstractionStarter]: For program point L667(lines 667 678) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 616) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1212) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 737) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 614) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 552) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1199(lines 1199 1210) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1133(lines 1133 1148) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1001(lines 1001 1016) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L671(lines 671 673) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 550) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L473(lines 473 488) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1068(lines 1068 1247) no Hoare annotation was computed. [2019-10-15 03:24:25,354 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1146) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L1069(lines 1069 1084) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1014) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 952) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L607(lines 607 609) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 486) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 424) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L277(lines 277 292) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1205) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L1071(lines 1071 1082) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 950) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 888) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L543(lines 543 545) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 422) no Hoare annotation was computed. [2019-10-15 03:24:25,355 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 360) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L279(lines 279 290) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 228) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 96) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 327) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L1139(lines 1139 1141) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1009) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L875(lines 875 886) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 824) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 481) no Hoare annotation was computed. [2019-10-15 03:24:25,356 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 358) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 226) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L149(lines 149 164) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 94) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L1075(lines 1075 1077) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L943(lines 943 945) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 822) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point L745(lines 745 760) no Hoare annotation was computed. [2019-10-15 03:24:25,357 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1254) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 417) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 285) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 162) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L879(lines 879 881) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 758) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 696) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 353) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 221) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L87(lines 87 89) no Hoare annotation was computed. [2019-10-15 03:24:25,358 INFO L443 ceAbstractionStarter]: For program point L815(lines 815 817) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 694) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L617(lines 617 632) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 157) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L1213(lines 1213 1228) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L751(lines 751 753) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 630) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L553(lines 553 568) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L1215(lines 1215 1226) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 1164) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1032) no Hoare annotation was computed. [2019-10-15 03:24:25,359 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 689) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 566) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L489(lines 489 504) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L1151(lines 1151 1162) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L1085(lines 1085 1100) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1030) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 968) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L623(lines 623 625) no Hoare annotation was computed. [2019-10-15 03:24:25,360 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 502) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L425(lines 425 440) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 308) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L1219(lines 1219 1221) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L1087(lines 1087 1098) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 16 1255) the Hoare annotation is: true [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 966) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 904) no Hoare annotation was computed. [2019-10-15 03:24:25,361 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 561) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L427(lines 427 438) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 376) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 306) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 244) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 112) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L1155(lines 1155 1157) no Hoare annotation was computed. [2019-10-15 03:24:25,362 INFO L443 ceAbstractionStarter]: For program point L1023(lines 1023 1025) no Hoare annotation was computed. [2019-10-15 03:24:25,363 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-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 1250) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L891(lines 891 902) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 840) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 497) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 374) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 242) no Hoare annotation was computed. [2019-10-15 03:24:25,363 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 180) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 110) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1093) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 961) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L827(lines 827 838) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 776) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 433) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 301) no Hoare annotation was computed. [2019-10-15 03:24:25,364 INFO L443 ceAbstractionStarter]: For program point L167(lines 167 178) no Hoare annotation was computed. [2019-10-15 03:24:25,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:24:25 BoogieIcfgContainer [2019-10-15 03:24:25,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:24:25,385 INFO L168 Benchmark]: Toolchain (without parser) took 7737.01 ms. Allocated memory was 144.7 MB in the beginning and 321.9 MB in the end (delta: 177.2 MB). Free memory was 92.9 MB in the beginning and 101.3 MB in the end (delta: -8.4 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,386 INFO L168 Benchmark]: CDTParser took 1.79 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,387 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1391.25 ms. Allocated memory was 144.7 MB in the beginning and 230.7 MB in the end (delta: 86.0 MB). Free memory was 92.7 MB in the beginning and 115.9 MB in the end (delta: -23.2 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,387 INFO L168 Benchmark]: Boogie Preprocessor took 230.23 ms. Allocated memory is still 230.7 MB. Free memory was 115.9 MB in the beginning and 101.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,388 INFO L168 Benchmark]: RCFGBuilder took 1888.00 ms. Allocated memory was 230.7 MB in the beginning and 257.9 MB in the end (delta: 27.3 MB). Free memory was 101.6 MB in the beginning and 155.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,389 INFO L168 Benchmark]: TraceAbstraction took 4222.72 ms. Allocated memory was 257.9 MB in the beginning and 321.9 MB in the end (delta: 64.0 MB). Free memory was 155.0 MB in the beginning and 101.3 MB in the end (delta: 53.7 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-10-15 03:24:25,393 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.79 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1391.25 ms. Allocated memory was 144.7 MB in the beginning and 230.7 MB in the end (delta: 86.0 MB). Free memory was 92.7 MB in the beginning and 115.9 MB in the end (delta: -23.2 MB). Peak memory consumption was 76.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 230.23 ms. Allocated memory is still 230.7 MB. Free memory was 115.9 MB in the beginning and 101.6 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1888.00 ms. Allocated memory was 230.7 MB in the beginning and 257.9 MB in the end (delta: 27.3 MB). Free memory was 101.6 MB in the beginning and 155.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4222.72 ms. Allocated memory was 257.9 MB in the beginning and 321.9 MB in the end (delta: 64.0 MB). Free memory was 155.0 MB in the beginning and 101.3 MB in the end (delta: 53.7 MB). Peak memory consumption was 117.7 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, 241 locations, 1 error locations. Result: SAFE, OverallTime: 4.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 4070 SDtfs, 2122 SDslu, 1797 SDs, 0 SdLazy, 776 SolverSat, 399 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s 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=403occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 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: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 14254 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 53/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...