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/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:40:20,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:40:20,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:40:20,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:40:20,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:40:20,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:40:20,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:40:20,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:40:20,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:40:20,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:40:20,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:40:20,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:40:20,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:40:20,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:40:20,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:40:20,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:40:20,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:40:20,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:40:20,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:40:20,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:40:20,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:40:20,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:40:20,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:40:20,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:40:20,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:40:20,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:40:20,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:40:20,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:40:20,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:40:20,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:40:20,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:40:20,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:40:20,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:40:20,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:40:20,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:40:20,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:40:20,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:40:20,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:40:20,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:40:20,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:40:20,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:40:20,085 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-07 13:40:20,109 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:40:20,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:40:20,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:40:20,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:40:20,113 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:40:20,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:40:20,113 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:40:20,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:40:20,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:40:20,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:40:20,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:40:20,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:40:20,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:40:20,115 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:40:20,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:40:20,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:40:20,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:40:20,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:40:20,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:40:20,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:40:20,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:40:20,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:20,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:40:20,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:40:20,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:40:20,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:40:20,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:40:20,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:40:20,120 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-07 13:40:20,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:40:20,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:40:20,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:40:20,436 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:40:20,437 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:40:20,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-07 13:40:20,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404af01aa/4a9f497088ca4880806eee451d76045d/FLAGbd9976a8f [2019-10-07 13:40:21,178 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:21,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-10-07 13:40:21,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404af01aa/4a9f497088ca4880806eee451d76045d/FLAGbd9976a8f [2019-10-07 13:40:21,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/404af01aa/4a9f497088ca4880806eee451d76045d [2019-10-07 13:40:21,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:21,314 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:21,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:21,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:21,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:21,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:21" (1/1) ... [2019-10-07 13:40:21,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1729396c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:21, skipping insertion in model container [2019-10-07 13:40:21,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:21" (1/1) ... [2019-10-07 13:40:21,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:21,454 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:22,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:22,370 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:22,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:22,663 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:22,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22 WrapperNode [2019-10-07 13:40:22,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:22,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:22,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:22,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:22,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (1/1) ... [2019-10-07 13:40:22,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:22,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:22,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:22,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:22,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (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-07 13:40:22,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:22,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:22,942 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:22,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:22,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:22,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:22,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:25,235 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:25,235 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:40:25,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:25 BoogieIcfgContainer [2019-10-07 13:40:25,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:25,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:25,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:25,242 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:25,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:21" (1/3) ... [2019-10-07 13:40:25,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341eea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:25, skipping insertion in model container [2019-10-07 13:40:25,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:22" (2/3) ... [2019-10-07 13:40:25,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341eea53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:25, skipping insertion in model container [2019-10-07 13:40:25,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:25" (3/3) ... [2019-10-07 13:40:25,247 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-10-07 13:40:25,258 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:25,268 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-10-07 13:40:25,283 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-10-07 13:40:25,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:25,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:25,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:25,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:25,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:25,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:25,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:25,317 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:25,348 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-10-07 13:40:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:40:25,354 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:25,355 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:25,357 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:25,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2019-10-07 13:40:25,374 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:25,375 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:25,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:25,375 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:25,591 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-07 13:40:25,591 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:25,592 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:25,592 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:25,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:25,611 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-10-07 13:40:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:27,034 INFO L93 Difference]: Finished difference Result 489 states and 914 transitions. [2019-10-07 13:40:27,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:27,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:40:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:27,051 INFO L225 Difference]: With dead ends: 489 [2019-10-07 13:40:27,051 INFO L226 Difference]: Without dead ends: 300 [2019-10-07 13:40:27,058 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-07 13:40:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-10-07 13:40:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-07 13:40:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2019-10-07 13:40:27,167 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2019-10-07 13:40:27,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:27,168 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2019-10-07 13:40:27,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:27,168 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2019-10-07 13:40:27,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:40:27,170 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:27,170 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:27,172 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:27,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:27,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2019-10-07 13:40:27,173 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:27,173 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:27,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,174 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:27,290 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-07 13:40:27,290 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:27,291 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:27,291 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:27,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:27,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:27,294 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand 4 states. [2019-10-07 13:40:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:27,659 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-10-07 13:40:27,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:27,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:40:27,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:27,663 INFO L225 Difference]: With dead ends: 300 [2019-10-07 13:40:27,663 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 13:40:27,664 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 13:40:27,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-10-07 13:40:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-10-07 13:40:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2019-10-07 13:40:27,677 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2019-10-07 13:40:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:27,678 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2019-10-07 13:40:27,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2019-10-07 13:40:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-07 13:40:27,688 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:27,688 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:27,689 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:27,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2019-10-07 13:40:27,690 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:27,690 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:27,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,691 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:27,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:30,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:30,316 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:30,316 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:30,316 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-10-07 13:40:30,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-10-07 13:40:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-10-07 13:40:30,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:40:30,321 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 63 states. [2019-10-07 13:40:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:31,804 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-10-07 13:40:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-10-07 13:40:31,805 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-10-07 13:40:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:31,808 INFO L225 Difference]: With dead ends: 296 [2019-10-07 13:40:31,808 INFO L226 Difference]: Without dead ends: 294 [2019-10-07 13:40:31,811 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-10-07 13:40:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-07 13:40:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-10-07 13:40:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-10-07 13:40:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-10-07 13:40:31,822 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2019-10-07 13:40:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:31,823 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-10-07 13:40:31,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-10-07 13:40:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-10-07 13:40:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-07 13:40:31,828 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:31,828 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:31,829 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:31,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2019-10-07 13:40:31,830 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:31,830 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:31,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:31,830 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:31,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:33,145 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-07 13:40:33,146 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:33,146 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:33,147 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:33,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:33,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:33,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:33,149 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 5 states. [2019-10-07 13:40:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:33,715 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-10-07 13:40:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:33,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-10-07 13:40:33,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:33,720 INFO L225 Difference]: With dead ends: 295 [2019-10-07 13:40:33,721 INFO L226 Difference]: Without dead ends: 293 [2019-10-07 13:40:33,721 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 176 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-07 13:40:33,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2019-10-07 13:40:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-10-07 13:40:33,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-10-07 13:40:33,730 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2019-10-07 13:40:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:33,731 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-10-07 13:40:33,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-10-07 13:40:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-07 13:40:33,741 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:33,742 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:33,742 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2019-10-07 13:40:33,744 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:33,744 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:33,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:33,744 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:36,304 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:36,304 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:36,304 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-07 13:40:36,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-07 13:40:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-07 13:40:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 13:40:36,310 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 65 states. [2019-10-07 13:40:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:38,250 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-10-07 13:40:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-07 13:40:38,251 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-10-07 13:40:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:38,256 INFO L225 Difference]: With dead ends: 294 [2019-10-07 13:40:38,256 INFO L226 Difference]: Without dead ends: 292 [2019-10-07 13:40:38,264 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:40:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-07 13:40:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-10-07 13:40:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-10-07 13:40:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-10-07 13:40:38,278 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2019-10-07 13:40:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:38,279 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2019-10-07 13:40:38,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-07 13:40:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2019-10-07 13:40:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-07 13:40:38,287 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:38,287 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:38,288 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2019-10-07 13:40:38,289 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:38,289 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:38,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:38,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:39,829 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-07 13:40:39,830 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:39,830 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:39,830 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:39,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:39,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:39,832 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 5 states. [2019-10-07 13:40:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:40,370 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-10-07 13:40:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:40,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-10-07 13:40:40,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:40,374 INFO L225 Difference]: With dead ends: 289 [2019-10-07 13:40:40,374 INFO L226 Difference]: Without dead ends: 287 [2019-10-07 13:40:40,375 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 3 SyntacticMatches, 179 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-10-07 13:40:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-10-07 13:40:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-10-07 13:40:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2019-10-07 13:40:40,382 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2019-10-07 13:40:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:40,383 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2019-10-07 13:40:40,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2019-10-07 13:40:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-07 13:40:40,387 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:40,387 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:40,387 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:40,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2019-10-07 13:40:40,388 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:40,388 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:40,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:40,389 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:42,589 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-07 13:40:42,589 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:42,589 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:42,590 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-07 13:40:42,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-07 13:40:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-07 13:40:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:40:42,599 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand 66 states. [2019-10-07 13:40:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:43,936 INFO L93 Difference]: Finished difference Result 297 states and 301 transitions. [2019-10-07 13:40:43,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-07 13:40:43,937 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 254 [2019-10-07 13:40:43,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:43,939 INFO L225 Difference]: With dead ends: 297 [2019-10-07 13:40:43,939 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 13:40:43,941 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-07 13:40:43,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 13:40:43,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 285. [2019-10-07 13:40:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-07 13:40:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-10-07 13:40:43,950 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2019-10-07 13:40:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:43,950 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2019-10-07 13:40:43,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-07 13:40:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2019-10-07 13:40:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-07 13:40:43,952 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:43,953 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:43,955 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2019-10-07 13:40:43,956 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:43,956 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:43,957 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:43,957 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:43,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:44,145 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-07 13:40:44,145 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:44,146 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:44,146 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:40:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:40:44,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:40:44,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:40:44,147 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand 4 states. [2019-10-07 13:40:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:44,486 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2019-10-07 13:40:44,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:40:44,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-10-07 13:40:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:44,488 INFO L225 Difference]: With dead ends: 285 [2019-10-07 13:40:44,488 INFO L226 Difference]: Without dead ends: 281 [2019-10-07 13:40:44,489 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-07 13:40:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-10-07 13:40:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-07 13:40:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-10-07 13:40:44,495 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2019-10-07 13:40:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:44,496 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2019-10-07 13:40:44,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:40:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2019-10-07 13:40:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-07 13:40:44,498 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:44,498 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:44,499 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2019-10-07 13:40:44,499 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:44,500 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:44,500 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:44,500 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:44,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:46,503 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-07 13:40:46,503 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:46,503 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:46,503 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-07 13:40:46,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-07 13:40:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-07 13:40:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:40:46,506 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 66 states. [2019-10-07 13:40:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:47,832 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2019-10-07 13:40:47,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-07 13:40:47,833 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-10-07 13:40:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:47,835 INFO L225 Difference]: With dead ends: 291 [2019-10-07 13:40:47,835 INFO L226 Difference]: Without dead ends: 289 [2019-10-07 13:40:47,837 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-07 13:40:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-07 13:40:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-10-07 13:40:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-10-07 13:40:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2019-10-07 13:40:47,845 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2019-10-07 13:40:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:47,846 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2019-10-07 13:40:47,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-07 13:40:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2019-10-07 13:40:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-07 13:40:47,848 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:47,848 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:47,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2019-10-07 13:40:47,851 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:47,851 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:47,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:47,851 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:49,931 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-07 13:40:49,931 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:49,932 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:49,932 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-07 13:40:49,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-07 13:40:49,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-07 13:40:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 13:40:49,935 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand 65 states. [2019-10-07 13:40:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:51,249 INFO L93 Difference]: Finished difference Result 297 states and 302 transitions. [2019-10-07 13:40:51,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-07 13:40:51,257 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2019-10-07 13:40:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:51,264 INFO L225 Difference]: With dead ends: 297 [2019-10-07 13:40:51,264 INFO L226 Difference]: Without dead ends: 295 [2019-10-07 13:40:51,266 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:40:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-07 13:40:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2019-10-07 13:40:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-07 13:40:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-10-07 13:40:51,277 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2019-10-07 13:40:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:51,281 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2019-10-07 13:40:51,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-07 13:40:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2019-10-07 13:40:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 13:40:51,283 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:51,284 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:51,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2019-10-07 13:40:51,286 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:51,286 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:51,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,287 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:53,133 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-07 13:40:53,134 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:53,134 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:53,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-10-07 13:40:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-07 13:40:53,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-07 13:40:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-10-07 13:40:53,137 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand 65 states. [2019-10-07 13:40:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:54,490 INFO L93 Difference]: Finished difference Result 300 states and 305 transitions. [2019-10-07 13:40:54,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-07 13:40:54,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-10-07 13:40:54,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:54,493 INFO L225 Difference]: With dead ends: 300 [2019-10-07 13:40:54,493 INFO L226 Difference]: Without dead ends: 298 [2019-10-07 13:40:54,495 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:40:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-07 13:40:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2019-10-07 13:40:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-07 13:40:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2019-10-07 13:40:54,502 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2019-10-07 13:40:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:54,503 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2019-10-07 13:40:54,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-07 13:40:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2019-10-07 13:40:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 13:40:54,504 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:54,505 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:54,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2019-10-07 13:40:54,506 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:54,506 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:54,506 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:54,506 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:55,495 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-07 13:40:55,496 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:55,496 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:55,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:55,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:55,497 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 5 states. [2019-10-07 13:40:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:56,104 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2019-10-07 13:40:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:40:56,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-10-07 13:40:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:56,107 INFO L225 Difference]: With dead ends: 275 [2019-10-07 13:40:56,108 INFO L226 Difference]: Without dead ends: 271 [2019-10-07 13:40:56,108 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 3 SyntacticMatches, 182 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:56,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-10-07 13:40:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-10-07 13:40:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-07 13:40:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2019-10-07 13:40:56,118 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 257 [2019-10-07 13:40:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:56,119 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2019-10-07 13:40:56,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2019-10-07 13:40:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-07 13:40:56,122 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:56,123 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:56,123 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:56,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1898055296, now seen corresponding path program 1 times [2019-10-07 13:40:56,124 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:56,125 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:56,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:56,125 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:57,348 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-07 13:40:57,349 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,349 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:57,349 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:57,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:57,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:57,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:57,351 INFO L87 Difference]: Start difference. First operand 271 states and 274 transitions. Second operand 5 states. [2019-10-07 13:40:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:57,861 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2019-10-07 13:40:57,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:57,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-10-07 13:40:57,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:57,864 INFO L225 Difference]: With dead ends: 281 [2019-10-07 13:40:57,865 INFO L226 Difference]: Without dead ends: 279 [2019-10-07 13:40:57,865 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 3 SyntacticMatches, 182 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-10-07 13:40:57,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 269. [2019-10-07 13:40:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-07 13:40:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 272 transitions. [2019-10-07 13:40:57,872 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 272 transitions. Word has length 257 [2019-10-07 13:40:57,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:57,873 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 272 transitions. [2019-10-07 13:40:57,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:57,873 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 272 transitions. [2019-10-07 13:40:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-07 13:40:57,875 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:57,875 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:57,876 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash 201570989, now seen corresponding path program 1 times [2019-10-07 13:40:57,876 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:57,876 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:57,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,877 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:57,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:59,016 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-07 13:40:59,016 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,016 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:59,017 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:59,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:59,018 INFO L87 Difference]: Start difference. First operand 269 states and 272 transitions. Second operand 5 states. [2019-10-07 13:40:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:59,548 INFO L93 Difference]: Finished difference Result 284 states and 289 transitions. [2019-10-07 13:40:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:59,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-10-07 13:40:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:59,554 INFO L225 Difference]: With dead ends: 284 [2019-10-07 13:40:59,554 INFO L226 Difference]: Without dead ends: 282 [2019-10-07 13:40:59,555 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 3 SyntacticMatches, 182 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:59,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-10-07 13:40:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 267. [2019-10-07 13:40:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-07 13:40:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2019-10-07 13:40:59,563 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 258 [2019-10-07 13:40:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:59,564 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2019-10-07 13:40:59,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2019-10-07 13:40:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-07 13:40:59,566 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:59,566 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:40:59,567 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1329807677, now seen corresponding path program 1 times [2019-10-07 13:40:59,567 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:59,567 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:59,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,568 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:01,394 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-07 13:41:01,395 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:01,395 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:01,395 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-10-07 13:41:01,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-07 13:41:01,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-07 13:41:01,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-10-07 13:41:01,398 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 66 states. [2019-10-07 13:41:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:02,959 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2019-10-07 13:41:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-07 13:41:02,960 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 259 [2019-10-07 13:41:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:02,961 INFO L225 Difference]: With dead ends: 277 [2019-10-07 13:41:02,962 INFO L226 Difference]: Without dead ends: 275 [2019-10-07 13:41:02,967 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-10-07 13:41:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-10-07 13:41:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2019-10-07 13:41:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-07 13:41:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 268 transitions. [2019-10-07 13:41:02,978 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 268 transitions. Word has length 259 [2019-10-07 13:41:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:02,978 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 268 transitions. [2019-10-07 13:41:02,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-07 13:41:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 268 transitions. [2019-10-07 13:41:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-07 13:41:02,980 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:41:02,981 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 13:41:02,988 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:41:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:41:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1725639877, now seen corresponding path program 1 times [2019-10-07 13:41:02,989 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:41:02,989 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:02,990 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:02,990 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:41:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:41:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:41:03,149 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-07 13:41:03,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:41:03,150 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:41:03,150 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:41:03,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:41:03,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:41:03,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:41:03,152 INFO L87 Difference]: Start difference. First operand 265 states and 268 transitions. Second operand 4 states. [2019-10-07 13:41:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:41:03,533 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-10-07 13:41:03,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:41:03,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 260 [2019-10-07 13:41:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:41:03,534 INFO L225 Difference]: With dead ends: 265 [2019-10-07 13:41:03,534 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:41:03,536 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:41:03,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:41:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:41:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:41:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:41:03,537 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 260 [2019-10-07 13:41:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:41:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:41:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:41:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:41:03,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:41:03,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:41:03,782 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 8 [2019-10-07 13:41:03,928 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:41:03,928 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:41:03,928 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:41:03,928 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:41:03,928 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L960(lines 960 984) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L4065(lines 4065 4983) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L1753(lines 1753 5187) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 17 5296) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 5006) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L1489(lines 1489 5210) no Hoare annotation was computed. [2019-10-07 13:41:03,929 INFO L443 ceAbstractionStarter]: For program point L3537(lines 3537 5029) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L4462(lines 4462 4949) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L1225(lines 1225 5233) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L2150(lines 2150 5153) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L2943(lines 2943 2954) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point L4859(lines 4859 4869) no Hoare annotation was computed. [2019-10-07 13:41:03,930 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point L3340(lines 3340 3364) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point L1028(lines 1028 1052) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point L4133(lines 4133 4977) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L439 ceAbstractionStarter]: At program point L4926(lines 4660 4933) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 59 main_~main__t~0) (not (= main_~main__t~0 main_~main__tagbuf_len~0))) [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 4849) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point L1821(lines 1821 5181) no Hoare annotation was computed. [2019-10-07 13:41:03,931 INFO L443 ceAbstractionStarter]: For program point L3869(lines 3869 5000) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 586) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L1557(lines 1557 5204) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L3605(lines 3605 5023) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L4530(lines 4530 4943) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L1293(lines 1293 5227) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L2218(lines 2218 5147) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L3011(lines 3011 3022) no Hoare annotation was computed. [2019-10-07 13:41:03,932 INFO L443 ceAbstractionStarter]: For program point L699(lines 699 710) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L4861(line 4861) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L439 ceAbstractionStarter]: At program point L501(lines 355 549) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L3408(lines 3408 3432) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L1096(lines 1096 1120) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L4201(lines 4201 4971) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L1889(lines 1889 5175) no Hoare annotation was computed. [2019-10-07 13:41:03,933 INFO L443 ceAbstractionStarter]: For program point L3937(lines 3937 4994) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 4806) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L1625(lines 1625 5198) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L3673(lines 3673 5017) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L4598(lines 4598 4937) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 456) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L1361(lines 1361 5221) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L2286(lines 2286 5141) no Hoare annotation was computed. [2019-10-07 13:41:03,934 INFO L443 ceAbstractionStarter]: For program point L3079(lines 3079 3090) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 778) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L4797(lines 4797 4832) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L3476(lines 3476 3500) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L1164(lines 1164 1188) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 114) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L4269(lines 4269 4965) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L1957(lines 1957 5169) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L4005(lines 4005 4988) no Hoare annotation was computed. [2019-10-07 13:41:03,935 INFO L443 ceAbstractionStarter]: For program point L1693(lines 1693 5192) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L3741(lines 3741 5011) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L1429(lines 1429 5215) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 392) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L2354(lines 2354 5135) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L3147(lines 3147 3158) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L835(lines 835 846) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L3544(lines 3544 3568) no Hoare annotation was computed. [2019-10-07 13:41:03,936 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 314) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L1232(lines 1232 1256) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L4337(lines 4337 4959) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L2025(lines 2025 5163) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L4073(lines 4073 4982) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L1761(lines 1761 5186) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L3809(lines 3809 5005) no Hoare annotation was computed. [2019-10-07 13:41:03,937 INFO L439 ceAbstractionStarter]: At program point L638(lines 123 640) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,937 INFO L443 ceAbstractionStarter]: For program point L1497(lines 1497 5209) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L2422(lines 2422 5129) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L3215(lines 3215 3226) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 914) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L3612(lines 3612 3636) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1324) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L243(lines 243 250) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L4405(lines 4405 4953) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L2093(lines 2093 5157) no Hoare annotation was computed. [2019-10-07 13:41:03,938 INFO L443 ceAbstractionStarter]: For program point L4141(lines 4141 4976) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L1829(lines 1829 5180) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L3877(lines 3877 4999) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L439 ceAbstractionStarter]: At program point L4868(lines 4725 4917) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~271 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~273 0)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~272 0)) (<= 61 main_~main__t~0)) [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L4736(lines 4736 4758) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L1565(lines 1565 5203) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L2490(lines 2490 5123) no Hoare annotation was computed. [2019-10-07 13:41:03,939 INFO L443 ceAbstractionStarter]: For program point L3283(lines 3283 3294) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 54) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L971(lines 971 982) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L3680(lines 3680 3704) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L4671(lines 4671 4931) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L1368(lines 1368 1392) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L4473(lines 4473 4947) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L2161(lines 2161 5151) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L4209(lines 4209 4970) no Hoare annotation was computed. [2019-10-07 13:41:03,940 INFO L443 ceAbstractionStarter]: For program point L1897(lines 1897 5174) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L3945(lines 3945 4993) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L4738(line 4738) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L4804(lines 4804 4826) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L1633(lines 1633 5197) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L2558(lines 2558 5117) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L3351(lines 3351 3362) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1050) no Hoare annotation was computed. [2019-10-07 13:41:03,941 INFO L443 ceAbstractionStarter]: For program point L3748(lines 3748 3772) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L577(lines 577 584) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L4673(line 4673) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L1436(lines 1436 1460) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L4541(lines 4541 4941) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L2229(lines 2229 5145) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L4277(lines 4277 4964) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L1965(lines 1965 5168) no Hoare annotation was computed. [2019-10-07 13:41:03,942 INFO L443 ceAbstractionStarter]: For program point L4013(lines 4013 4987) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L4806(line 4806) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 5191) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L2626(lines 2626 5111) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 546) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L3419(lines 3419 3430) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 4778) no Hoare annotation was computed. [2019-10-07 13:41:03,943 INFO L443 ceAbstractionStarter]: For program point L1107(lines 1107 1118) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L3816(lines 3816 3840) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L1504(lines 1504 1528) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 454) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L4609(lines 4609 4935) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L2297(lines 2297 5139) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L4345(lines 4345 4958) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L2033(lines 2033 5162) no Hoare annotation was computed. [2019-10-07 13:41:03,944 INFO L443 ceAbstractionStarter]: For program point L4081(lines 4081 4981) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L1769(lines 1769 5185) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L2694(lines 2694 5105) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L3487(lines 3487 3498) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L1175(lines 1175 1186) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L3884(lines 3884 3908) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L1572(lines 1572 1596) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 390) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L2365(lines 2365 5133) no Hoare annotation was computed. [2019-10-07 13:41:03,945 INFO L443 ceAbstractionStarter]: For program point L4413(lines 4413 4952) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L2101(lines 2101 5156) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L4149(lines 4149 4975) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L1837(lines 1837 5179) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L2762(lines 2762 5099) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L3555(lines 3555 3566) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1254) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L3952(lines 3952 3976) no Hoare annotation was computed. [2019-10-07 13:41:03,946 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1664) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L2433(lines 2433 5127) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L4481(lines 4481 4946) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L2169(lines 2169 5150) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 4750) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L4217(lines 4217 4969) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L1905(lines 1905 5173) no Hoare annotation was computed. [2019-10-07 13:41:03,947 INFO L443 ceAbstractionStarter]: For program point L2830(lines 2830 5093) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L3623(lines 3623 3634) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L1311(lines 1311 1322) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L4020(lines 4020 4044) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L4879(lines 4879 4914) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L1708(lines 1708 1732) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L519(lines 519 539) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L2501(lines 2501 5121) no Hoare annotation was computed. [2019-10-07 13:41:03,948 INFO L443 ceAbstractionStarter]: For program point L4549(lines 4549 4940) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L2237(lines 2237 5144) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 640) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L4285(lines 4285 4963) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L1973(lines 1973 5167) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L2898(lines 2898 5087) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 4721) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L3691(lines 3691 3702) no Hoare annotation was computed. [2019-10-07 13:41:03,949 INFO L443 ceAbstractionStarter]: For program point L4748(lines 4748 4756) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L1379(lines 1379 1390) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L4088(lines 4088 4112) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L1776(lines 1776 1800) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L4683(lines 4683 4929) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L2569(lines 2569 5115) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L4617(lines 4617 4934) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L2305(lines 2305 5138) no Hoare annotation was computed. [2019-10-07 13:41:03,950 INFO L443 ceAbstractionStarter]: For program point L4353(lines 4353 4957) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L2041(lines 2041 5161) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L2966(lines 2966 5081) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L4750(line 4750) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L654(lines 654 5285) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L3759(lines 3759 3770) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L4816(lines 4816 4824) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point L1447(lines 1447 1458) no Hoare annotation was computed. [2019-10-07 13:41:03,951 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 4888) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L4156(lines 4156 4180) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L1844(lines 1844 1868) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L2637(lines 2637 5109) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L4685(line 4685) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L2373(lines 2373 5132) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 594) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L4421(lines 4421 4951) no Hoare annotation was computed. [2019-10-07 13:41:03,952 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 600) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L2109(lines 2109 5155) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L3034(lines 3034 5075) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L4818(line 4818) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L722(lines 722 5279) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L3827(lines 3827 3838) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L1515(lines 1515 1526) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L4224(lines 4224 4248) no Hoare annotation was computed. [2019-10-07 13:41:03,953 INFO L443 ceAbstractionStarter]: For program point L1912(lines 1912 1936) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L2705(lines 2705 5103) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L2441(lines 2441 5126) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L4489(lines 4489 4945) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L2177(lines 2177 5149) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 5287) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L3102(lines 3102 5069) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L4886(lines 4886 4908) no Hoare annotation was computed. [2019-10-07 13:41:03,954 INFO L443 ceAbstractionStarter]: For program point L790(lines 790 5273) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L3895(lines 3895 3906) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L439 ceAbstractionStarter]: At program point L592(lines 259 594) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L1583(lines 1583 1594) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L4292(lines 4292 4316) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L1980(lines 1980 2004) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L2773(lines 2773 5097) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L2509(lines 2509 5120) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L4557(lines 4557 4939) no Hoare annotation was computed. [2019-10-07 13:41:03,955 INFO L443 ceAbstractionStarter]: For program point L263(lines 263 553) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L2245(lines 2245 5143) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L3170(lines 3170 5063) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L858(lines 858 5267) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L3963(lines 3963 3974) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L4888(line 4888) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L1651(lines 1651 1662) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L439 ceAbstractionStarter]: At program point L330(lines 263 553) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L4360(lines 4360 4384) no Hoare annotation was computed. [2019-10-07 13:41:03,956 INFO L443 ceAbstractionStarter]: For program point L2048(lines 2048 2072) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L2841(lines 2841 5091) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L2577(lines 2577 5114) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L4625(lines 4625 4933) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L2313(lines 2313 5137) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L3238(lines 3238 5057) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L926(lines 926 5261) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L4031(lines 4031 4042) no Hoare annotation was computed. [2019-10-07 13:41:03,957 INFO L443 ceAbstractionStarter]: For program point L1719(lines 1719 1730) no Hoare annotation was computed. [2019-10-07 13:41:03,958 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 537) no Hoare annotation was computed. [2019-10-07 13:41:03,958 INFO L443 ceAbstractionStarter]: For program point L4692(lines 4692 4928) no Hoare annotation was computed. [2019-10-07 13:41:03,958 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 4685) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L4428(lines 4428 4452) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 189) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L2116(lines 2116 2140) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L2909(lines 2909 5085) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L2645(lines 2645 5108) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 547) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L2381(lines 2381 5131) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L3306(lines 3306 5051) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 598) no Hoare annotation was computed. [2019-10-07 13:41:03,959 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 5255) no Hoare annotation was computed. [2019-10-07 13:41:03,960 INFO L443 ceAbstractionStarter]: For program point L4099(lines 4099 4110) no Hoare annotation was computed. [2019-10-07 13:41:03,960 INFO L443 ceAbstractionStarter]: For program point L1787(lines 1787 1798) no Hoare annotation was computed. [2019-10-07 13:41:03,960 INFO L439 ceAbstractionStarter]: At program point L4694(lines 26 5288) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L4496(lines 4496 4520) no Hoare annotation was computed. [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L2184(lines 2184 2208) no Hoare annotation was computed. [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L70(lines 70 644) no Hoare annotation was computed. [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L2977(lines 2977 5079) no Hoare annotation was computed. [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 5283) no Hoare annotation was computed. [2019-10-07 13:41:03,962 INFO L443 ceAbstractionStarter]: For program point L2713(lines 2713 5102) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L2449(lines 2449 5125) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L3374(lines 3374 5045) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 17 5296) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 5249) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L4167(lines 4167 4178) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L1855(lines 1855 1866) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L4564(lines 4564 4588) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 325) no Hoare annotation was computed. [2019-10-07 13:41:03,963 INFO L443 ceAbstractionStarter]: For program point L2252(lines 2252 2276) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L3045(lines 3045 5073) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 5277) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L2781(lines 2781 5096) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L2517(lines 2517 5119) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 506) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L3442(lines 3442 5039) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L4235(lines 4235 4246) no Hoare annotation was computed. [2019-10-07 13:41:03,964 INFO L443 ceAbstractionStarter]: For program point L1130(lines 1130 5243) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L446 ceAbstractionStarter]: At program point L5292(lines 22 5295) the Hoare annotation is: true [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L1923(lines 1923 1934) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L439 ceAbstractionStarter]: At program point L470(lines 403 506) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L4632(lines 4632 4656) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L2320(lines 2320 2344) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L3113(lines 3113 5067) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 5271) no Hoare annotation was computed. [2019-10-07 13:41:03,965 INFO L443 ceAbstractionStarter]: For program point L2849(lines 2849 5090) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L4765(lines 4765 4915) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L2585(lines 2585 5113) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L3510(lines 3510 5033) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 551) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L4303(lines 4303 4314) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L1198(lines 1198 5237) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L1991(lines 1991 2002) no Hoare annotation was computed. [2019-10-07 13:41:03,966 INFO L443 ceAbstractionStarter]: For program point L4898(lines 4898 4906) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 4818) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L4700(lines 4700 4927) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L2388(lines 2388 2412) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L3181(lines 3181 5061) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 5265) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L2917(lines 2917 5084) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L2653(lines 2653 5107) no Hoare annotation was computed. [2019-10-07 13:41:03,967 INFO L443 ceAbstractionStarter]: For program point L3578(lines 3578 5027) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L4371(lines 4371 4382) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L1266(lines 1266 5231) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L2059(lines 2059 2070) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L4900(line 4900) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 639) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L2456(lines 2456 2480) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 4790) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L3249(lines 3249 5055) no Hoare annotation was computed. [2019-10-07 13:41:03,968 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 5259) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L2985(lines 2985 5078) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L673(lines 673 5282) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L2721(lines 2721 5101) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L3646(lines 3646 5021) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L4769(lines 4769 4873) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L4439(lines 4439 4450) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L1334(lines 1334 5225) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 187) no Hoare annotation was computed. [2019-10-07 13:41:03,969 INFO L443 ceAbstractionStarter]: For program point L2127(lines 2127 2138) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L2524(lines 2524 2548) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L410(lines 410 465) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 596) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L3317(lines 3317 5049) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 5253) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L3053(lines 3053 5072) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 5276) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L2789(lines 2789 5095) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L3714(lines 3714 5015) no Hoare annotation was computed. [2019-10-07 13:41:03,970 INFO L443 ceAbstractionStarter]: For program point L4507(lines 4507 4518) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 5219) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L2195(lines 2195 2206) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 642) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L2592(lines 2592 2616) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L3385(lines 3385 5043) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L1073(lines 1073 5247) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L3121(lines 3121 5066) no Hoare annotation was computed. [2019-10-07 13:41:03,971 INFO L443 ceAbstractionStarter]: For program point L809(lines 809 5270) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L2857(lines 2857 5089) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L3782(lines 3782 5009) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L4707(lines 4707 4919) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L439 ceAbstractionStarter]: At program point L545(lines 399 547) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L4575(lines 4575 4586) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 504) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L1470(lines 1470 5213) no Hoare annotation was computed. [2019-10-07 13:41:03,972 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 323) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L2263(lines 2263 2274) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L2660(lines 2660 2684) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L3453(lines 3453 5037) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L1141(lines 1141 5241) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L3189(lines 3189 5060) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L877(lines 877 5264) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L2925(lines 2925 5083) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L3850(lines 3850 5003) no Hoare annotation was computed. [2019-10-07 13:41:03,973 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 633) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L4643(lines 4643 4654) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L4709(line 4709) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L1538(lines 1538 5207) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L2331(lines 2331 2342) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 4738) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L2728(lines 2728 2752) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L4776(lines 4776 4835) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L3521(lines 3521 5031) no Hoare annotation was computed. [2019-10-07 13:41:03,974 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 549) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L1209(lines 1209 5235) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L3257(lines 3257 5054) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L945(lines 945 5258) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L2993(lines 2993 5077) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L3918(lines 3918 4997) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 5281) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 5201) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L2399(lines 2399 2410) no Hoare annotation was computed. [2019-10-07 13:41:03,975 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 186) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L2796(lines 2796 2820) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L4778(line 4778) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L3589(lines 3589 5025) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 5229) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L3325(lines 3325 5048) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 5295) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L1013(lines 1013 5252) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L3061(lines 3061 5071) no Hoare annotation was computed. [2019-10-07 13:41:03,976 INFO L443 ceAbstractionStarter]: For program point L3986(lines 3986 4991) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L749(lines 749 5275) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L1674(lines 1674 5195) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L2467(lines 2467 2478) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 641) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L2864(lines 2864 2888) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L3657(lines 3657 5019) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L1345(lines 1345 5223) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L3393(lines 3393 5042) no Hoare annotation was computed. [2019-10-07 13:41:03,977 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 5246) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L3129(lines 3129 5065) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L4054(lines 4054 4985) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 5269) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L4847(lines 4847 4871) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L439 ceAbstractionStarter]: At program point L4913(lines 4765 4915) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~271 0)) (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~273 0)) (not (= main_~main__t~0 main_~main__tagbuf_len~0)) (not (= main_~__VERIFIER_assert__cond~270 0)) (not (= main_~__VERIFIER_assert__cond~272 0)) (<= 61 main_~main__t~0)) [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 5189) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L2535(lines 2535 2546) no Hoare annotation was computed. [2019-10-07 13:41:03,978 INFO L443 ceAbstractionStarter]: For program point L421(lines 421 463) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 322) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L2932(lines 2932 2956) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L3725(lines 3725 5013) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 5217) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L3461(lines 3461 5036) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L1149(lines 1149 5240) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L3197(lines 3197 5059) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L4122(lines 4122 4979) no Hoare annotation was computed. [2019-10-07 13:41:03,979 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 5288) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 5263) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L1810(lines 1810 5183) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L4849(line 4849) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L2603(lines 2603 2614) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 595) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L3000(lines 3000 3024) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 712) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 5007) no Hoare annotation was computed. [2019-10-07 13:41:03,980 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 502) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L1481(lines 1481 5211) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L3529(lines 3529 5030) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L1217(lines 1217 5234) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 180) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L3265(lines 3265 5053) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L4190(lines 4190 4973) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 5257) no Hoare annotation was computed. [2019-10-07 13:41:03,981 INFO L443 ceAbstractionStarter]: For program point L1878(lines 1878 5177) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L4719(lines 4719 4917) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L2671(lines 2671 2682) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L439 ceAbstractionStarter]: At program point L4653(lines 63 5287) the Hoare annotation is: (<= 0 main_~main__t~0) [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L3068(lines 3068 3092) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L756(lines 756 780) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L3861(lines 3861 5001) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L624(lines 624 631) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L1549(lines 1549 5205) no Hoare annotation was computed. [2019-10-07 13:41:03,982 INFO L443 ceAbstractionStarter]: For program point L3597(lines 3597 5024) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 4709) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L1285(lines 1285 5228) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L3333(lines 3333 5047) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L4258(lines 4258 4967) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 116) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 17 5296) the Hoare annotation is: true [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 5251) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point L1946(lines 1946 5171) no Hoare annotation was computed. [2019-10-07 13:41:03,983 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 4900) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L2739(lines 2739 2750) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L559(lines 559 593) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L4721(line 4721) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 848) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L3929(lines 3929 4995) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L4788(lines 4788 4833) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point L1617(lines 1617 5199) no Hoare annotation was computed. [2019-10-07 13:41:03,984 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 4673) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L3665(lines 3665 5018) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L1353(lines 1353 5222) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L296(lines 296 316) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L3401(lines 3401 5041) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L4326(lines 4326 4961) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L1089(lines 1089 5245) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 4861) no Hoare annotation was computed. [2019-10-07 13:41:03,985 INFO L443 ceAbstractionStarter]: For program point L2014(lines 2014 5165) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L2807(lines 2807 2818) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 462) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L3204(lines 3204 3228) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L892(lines 892 916) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L3997(lines 3997 4989) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L4790(line 4790) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 5193) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L3733(lines 3733 5012) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L1421(lines 1421 5216) no Hoare annotation was computed. [2019-10-07 13:41:03,986 INFO L443 ceAbstractionStarter]: For program point L3469(lines 3469 5035) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L4394(lines 4394 4955) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 252) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L1157(lines 1157 5239) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 56) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L2082(lines 2082 5159) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L2875(lines 2875 2886) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 548) no Hoare annotation was computed. [2019-10-07 13:41:03,987 INFO L443 ceAbstractionStarter]: For program point L3272(lines 3272 3296) no Hoare annotation was computed. [2019-10-07 13:41:04,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:41:04 BoogieIcfgContainer [2019-10-07 13:41:04,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:41:04,027 INFO L168 Benchmark]: Toolchain (without parser) took 42713.81 ms. Allocated memory was 142.6 MB in the beginning and 813.2 MB in the end (delta: 670.6 MB). Free memory was 96.5 MB in the beginning and 76.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 691.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,028 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1349.79 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 96.1 MB in the beginning and 139.8 MB in the end (delta: -43.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,035 INFO L168 Benchmark]: Boogie Preprocessor took 204.17 ms. Allocated memory is still 202.4 MB. Free memory was 139.8 MB in the beginning and 132.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,036 INFO L168 Benchmark]: RCFGBuilder took 2368.02 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 132.2 MB in the beginning and 111.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,038 INFO L168 Benchmark]: TraceAbstraction took 38787.09 ms. Allocated memory was 259.5 MB in the beginning and 813.2 MB in the end (delta: 553.6 MB). Free memory was 111.4 MB in the beginning and 76.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 588.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:41:04,046 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1349.79 ms. Allocated memory was 142.6 MB in the beginning and 202.4 MB in the end (delta: 59.8 MB). Free memory was 96.1 MB in the beginning and 139.8 MB in the end (delta: -43.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 204.17 ms. Allocated memory is still 202.4 MB. Free memory was 139.8 MB in the beginning and 132.2 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2368.02 ms. Allocated memory was 202.4 MB in the beginning and 259.5 MB in the end (delta: 57.1 MB). Free memory was 132.2 MB in the beginning and 111.4 MB in the end (delta: 20.8 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38787.09 ms. Allocated memory was 259.5 MB in the beginning and 813.2 MB in the end (delta: 553.6 MB). Free memory was 111.4 MB in the beginning and 76.1 MB in the end (delta: 35.3 MB). Peak memory consumption was 588.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4721]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4849]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4861]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4818]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4888]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4900]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4778]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4790]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4673]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4806]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4750]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4709]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 4738]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 4660]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && 59 <= main__t) && !(main__t == main__tagbuf_len) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 4725]: Loop Invariant Derived loop invariant: ((((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__t <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 4765]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && main__t <= main__tagbuf_len) && !(__VERIFIER_assert__cond == 0)) && !(main__t == main__tagbuf_len)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 61 <= main__t - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: 0 <= main__t - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 479 locations, 16 error locations. Result: SAFE, OverallTime: 38.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 1591 SDtfs, 42580 SDslu, 1629 SDs, 0 SdLazy, 10499 SolverSat, 11203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 48 SyntacticMatches, 907 SemanticMatches, 485 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 102 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 18 NumberOfFragments, 96 HoareAnnotationTreeSize, 16 FomulaSimplifications, 13234 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 2271 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 3588 NumberOfCodeBlocks, 3588 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3572 ConstructedInterpolants, 0 QuantifiedInterpolants, 3574049 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...