/usr/bin/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-fb55353 [2019-11-07 04:01:03,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:01:03,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:01:03,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:01:03,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:01:03,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:01:03,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:01:03,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:01:03,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:01:03,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:01:03,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:01:03,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:01:03,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:01:03,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:01:03,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:01:03,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:01:03,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:01:03,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:01:03,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:01:03,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:01:03,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:01:03,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:01:03,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:01:03,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:01:03,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:01:03,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:01:03,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:01:03,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:01:03,319 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:01:03,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:01:03,320 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:01:03,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:01:03,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:01:03,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:01:03,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:01:03,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:01:03,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:01:03,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:01:03,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:01:03,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:01:03,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:01:03,327 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-11-07 04:01:03,341 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:01:03,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:01:03,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:01:03,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:01:03,343 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:01:03,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:01:03,343 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:01:03,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:01:03,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:01:03,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:01:03,345 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:01:03,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:01:03,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:01:03,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:01:03,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:01:03,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:01:03,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:01:03,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:01:03,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:01:03,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:01:03,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:01:03,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:01:03,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:01:03,347 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-11-07 04:01:03,616 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:01:03,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:01:03,632 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:01:03,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:01:03,634 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:01:03,635 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-11-07 04:01:03,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a607252c8/38d24c8a5bcd48cbac8bcf1ee60e6004/FLAG7572defbb [2019-11-07 04:01:04,355 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:01:04,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-11-07 04:01:04,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a607252c8/38d24c8a5bcd48cbac8bcf1ee60e6004/FLAG7572defbb [2019-11-07 04:01:04,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a607252c8/38d24c8a5bcd48cbac8bcf1ee60e6004 [2019-11-07 04:01:04,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:01:04,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:01:04,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:04,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:01:04,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:01:04,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:04" (1/1) ... [2019-11-07 04:01:04,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175e7e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:04, skipping insertion in model container [2019-11-07 04:01:04,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:01:04" (1/1) ... [2019-11-07 04:01:04,588 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:01:04,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:01:05,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:05,544 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:01:05,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:01:05,854 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:01:05,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05 WrapperNode [2019-11-07 04:01:05,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:01:05,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:01:05,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:01:05,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:01:05,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:05,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:06,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:06,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:06,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (1/1) ... [2019-11-07 04:01:06,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:01:06,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:01:06,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:01:06,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:01:06,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (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-11-07 04:01:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:01:06,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:01:06,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:01:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:01:06,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:01:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:01:06,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:01:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:01:06,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:01:06,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:01:08,547 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:01:08,547 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:01:08,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:08 BoogieIcfgContainer [2019-11-07 04:01:08,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:01:08,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:01:08,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:01:08,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:01:08,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:01:04" (1/3) ... [2019-11-07 04:01:08,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a11f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:08, skipping insertion in model container [2019-11-07 04:01:08,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:01:05" (2/3) ... [2019-11-07 04:01:08,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a11f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:01:08, skipping insertion in model container [2019-11-07 04:01:08,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:01:08" (3/3) ... [2019-11-07 04:01:08,562 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-11-07 04:01:08,574 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:01:08,589 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-07 04:01:08,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-07 04:01:08,658 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:01:08,658 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:01:08,658 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:01:08,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:01:08,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:01:08,660 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:01:08,660 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:01:08,660 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:01:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states. [2019-11-07 04:01:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 04:01:08,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:08,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:08,714 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1158995348, now seen corresponding path program 1 times [2019-11-07 04:01:08,731 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:08,731 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889797889] [2019-11-07 04:01:08,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:08,952 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889797889] [2019-11-07 04:01:08,953 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:08,953 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:08,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008367562] [2019-11-07 04:01:08,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:08,960 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:08,978 INFO L87 Difference]: Start difference. First operand 479 states. Second operand 4 states. [2019-11-07 04:01:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:10,458 INFO L93 Difference]: Finished difference Result 489 states and 914 transitions. [2019-11-07 04:01:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:10,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 04:01:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:10,476 INFO L225 Difference]: With dead ends: 489 [2019-11-07 04:01:10,477 INFO L226 Difference]: Without dead ends: 300 [2019-11-07 04:01:10,482 INFO L630 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-11-07 04:01:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-11-07 04:01:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2019-11-07 04:01:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-11-07 04:01:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 363 transitions. [2019-11-07 04:01:10,545 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 363 transitions. Word has length 10 [2019-11-07 04:01:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:10,546 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 363 transitions. [2019-11-07 04:01:10,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 363 transitions. [2019-11-07 04:01:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 04:01:10,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:10,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:01:10,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1569114359, now seen corresponding path program 1 times [2019-11-07 04:01:10,549 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:10,549 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595912755] [2019-11-07 04:01:10,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:10,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:10,625 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595912755] [2019-11-07 04:01:10,625 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:10,625 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:10,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429814928] [2019-11-07 04:01:10,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:10,632 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:10,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:10,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:10,633 INFO L87 Difference]: Start difference. First operand 300 states and 363 transitions. Second operand 4 states. [2019-11-07 04:01:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:11,077 INFO L93 Difference]: Finished difference Result 300 states and 363 transitions. [2019-11-07 04:01:11,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:11,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 04:01:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:11,083 INFO L225 Difference]: With dead ends: 300 [2019-11-07 04:01:11,083 INFO L226 Difference]: Without dead ends: 295 [2019-11-07 04:01:11,085 INFO L630 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-11-07 04:01:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-07 04:01:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-11-07 04:01:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-07 04:01:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 298 transitions. [2019-11-07 04:01:11,102 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 298 transitions. Word has length 11 [2019-11-07 04:01:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:11,102 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 298 transitions. [2019-11-07 04:01:11,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 298 transitions. [2019-11-07 04:01:11,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-11-07 04:01:11,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:11,115 INFO L410 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-11-07 04:01:11,115 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 523116136, now seen corresponding path program 1 times [2019-11-07 04:01:11,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:11,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138336411] [2019-11-07 04:01:11,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:13,597 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138336411] [2019-11-07 04:01:13,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:13,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-11-07 04:01:13,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51452348] [2019-11-07 04:01:13,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-11-07 04:01:13,600 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-11-07 04:01:13,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-11-07 04:01:13,628 INFO L87 Difference]: Start difference. First operand 295 states and 298 transitions. Second operand 63 states. [2019-11-07 04:01:15,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:15,219 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-11-07 04:01:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-11-07 04:01:15,220 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 247 [2019-11-07 04:01:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:15,223 INFO L225 Difference]: With dead ends: 296 [2019-11-07 04:01:15,223 INFO L226 Difference]: Without dead ends: 294 [2019-11-07 04:01:15,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-11-07 04:01:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-11-07 04:01:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-11-07 04:01:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-11-07 04:01:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 296 transitions. [2019-11-07 04:01:15,241 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 296 transitions. Word has length 247 [2019-11-07 04:01:15,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:15,242 INFO L462 AbstractCegarLoop]: Abstraction has 293 states and 296 transitions. [2019-11-07 04:01:15,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-11-07 04:01:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 296 transitions. [2019-11-07 04:01:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-11-07 04:01:15,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:15,248 INFO L410 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-11-07 04:01:15,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:15,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:15,250 INFO L82 PathProgramCache]: Analyzing trace with hash -963264135, now seen corresponding path program 1 times [2019-11-07 04:01:15,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:15,251 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317511553] [2019-11-07 04:01:15,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:16,872 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317511553] [2019-11-07 04:01:16,873 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:16,873 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:16,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859934645] [2019-11-07 04:01:16,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:16,874 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:16,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:16,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:16,875 INFO L87 Difference]: Start difference. First operand 293 states and 296 transitions. Second operand 5 states. [2019-11-07 04:01:17,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:17,476 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-11-07 04:01:17,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:17,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2019-11-07 04:01:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:17,482 INFO L225 Difference]: With dead ends: 295 [2019-11-07 04:01:17,482 INFO L226 Difference]: Without dead ends: 293 [2019-11-07 04:01:17,483 INFO L630 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-11-07 04:01:17,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-11-07 04:01:17,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2019-11-07 04:01:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-07 04:01:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 294 transitions. [2019-11-07 04:01:17,493 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 294 transitions. Word has length 248 [2019-11-07 04:01:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:17,494 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 294 transitions. [2019-11-07 04:01:17,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 294 transitions. [2019-11-07 04:01:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-11-07 04:01:17,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:17,499 INFO L410 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-11-07 04:01:17,499 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1920569647, now seen corresponding path program 1 times [2019-11-07 04:01:17,500 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:17,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642039298] [2019-11-07 04:01:17,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:20,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:20,101 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642039298] [2019-11-07 04:01:20,101 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:20,101 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-07 04:01:20,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49272153] [2019-11-07 04:01:20,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-07 04:01:20,102 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-07 04:01:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-11-07 04:01:20,105 INFO L87 Difference]: Start difference. First operand 291 states and 294 transitions. Second operand 65 states. [2019-11-07 04:01:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:21,812 INFO L93 Difference]: Finished difference Result 294 states and 297 transitions. [2019-11-07 04:01:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-07 04:01:21,812 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 251 [2019-11-07 04:01:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:21,817 INFO L225 Difference]: With dead ends: 294 [2019-11-07 04:01:21,819 INFO L226 Difference]: Without dead ends: 292 [2019-11-07 04:01:21,823 INFO L630 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-11-07 04:01:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-07 04:01:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2019-11-07 04:01:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-07 04:01:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 292 transitions. [2019-11-07 04:01:21,838 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 292 transitions. Word has length 251 [2019-11-07 04:01:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:21,841 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 292 transitions. [2019-11-07 04:01:21,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-07 04:01:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 292 transitions. [2019-11-07 04:01:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-07 04:01:21,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:21,854 INFO L410 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-11-07 04:01:21,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 591887940, now seen corresponding path program 1 times [2019-11-07 04:01:21,856 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:21,856 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992319871] [2019-11-07 04:01:21,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:23,196 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992319871] [2019-11-07 04:01:23,197 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:23,197 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:23,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372148341] [2019-11-07 04:01:23,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:23,198 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:23,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:23,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:23,199 INFO L87 Difference]: Start difference. First operand 289 states and 292 transitions. Second operand 5 states. [2019-11-07 04:01:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:23,813 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-11-07 04:01:23,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:01:23,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2019-11-07 04:01:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:23,816 INFO L225 Difference]: With dead ends: 289 [2019-11-07 04:01:23,816 INFO L226 Difference]: Without dead ends: 287 [2019-11-07 04:01:23,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 3 SyntacticMatches, 179 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:01:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-07 04:01:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-07 04:01:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-07 04:01:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 290 transitions. [2019-11-07 04:01:23,826 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 290 transitions. Word has length 252 [2019-11-07 04:01:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:23,827 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 290 transitions. [2019-11-07 04:01:23,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 290 transitions. [2019-11-07 04:01:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-11-07 04:01:23,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:23,831 INFO L410 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-11-07 04:01:23,832 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:23,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1868780776, now seen corresponding path program 1 times [2019-11-07 04:01:23,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:23,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000185780] [2019-11-07 04:01:23,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:26,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000185780] [2019-11-07 04:01:26,103 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:26,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-11-07 04:01:26,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431348048] [2019-11-07 04:01:26,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-07 04:01:26,105 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:26,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-07 04:01:26,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 04:01:26,108 INFO L87 Difference]: Start difference. First operand 287 states and 290 transitions. Second operand 66 states. [2019-11-07 04:01:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:27,429 INFO L93 Difference]: Finished difference Result 297 states and 301 transitions. [2019-11-07 04:01:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-07 04:01:27,430 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 254 [2019-11-07 04:01:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:27,433 INFO L225 Difference]: With dead ends: 297 [2019-11-07 04:01:27,433 INFO L226 Difference]: Without dead ends: 295 [2019-11-07 04:01:27,435 INFO L630 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-11-07 04:01:27,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-07 04:01:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 285. [2019-11-07 04:01:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-07 04:01:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 288 transitions. [2019-11-07 04:01:27,444 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 288 transitions. Word has length 254 [2019-11-07 04:01:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:27,445 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 288 transitions. [2019-11-07 04:01:27,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-07 04:01:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 288 transitions. [2019-11-07 04:01:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-07 04:01:27,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:27,453 INFO L410 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-11-07 04:01:27,454 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2097634077, now seen corresponding path program 1 times [2019-11-07 04:01:27,455 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:27,455 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689362633] [2019-11-07 04:01:27,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:27,685 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689362633] [2019-11-07 04:01:27,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:27,686 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 04:01:27,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620409350] [2019-11-07 04:01:27,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 04:01:27,687 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:27,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 04:01:27,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 04:01:27,687 INFO L87 Difference]: Start difference. First operand 285 states and 288 transitions. Second operand 4 states. [2019-11-07 04:01:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:28,046 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2019-11-07 04:01:28,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 04:01:28,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-11-07 04:01:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:28,048 INFO L225 Difference]: With dead ends: 285 [2019-11-07 04:01:28,048 INFO L226 Difference]: Without dead ends: 281 [2019-11-07 04:01:28,049 INFO L630 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-11-07 04:01:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-07 04:01:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2019-11-07 04:01:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-07 04:01:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 284 transitions. [2019-11-07 04:01:28,057 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 284 transitions. Word has length 255 [2019-11-07 04:01:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:28,057 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 284 transitions. [2019-11-07 04:01:28,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 04:01:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 284 transitions. [2019-11-07 04:01:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-07 04:01:28,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:28,061 INFO L410 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-11-07 04:01:28,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash 616955961, now seen corresponding path program 1 times [2019-11-07 04:01:28,062 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:28,062 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762970471] [2019-11-07 04:01:28,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:30,122 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762970471] [2019-11-07 04:01:30,122 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:30,123 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-11-07 04:01:30,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731892788] [2019-11-07 04:01:30,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-11-07 04:01:30,124 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:30,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-11-07 04:01:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 04:01:30,126 INFO L87 Difference]: Start difference. First operand 281 states and 284 transitions. Second operand 66 states. [2019-11-07 04:01:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:31,427 INFO L93 Difference]: Finished difference Result 291 states and 295 transitions. [2019-11-07 04:01:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-11-07 04:01:31,428 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 256 [2019-11-07 04:01:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:31,430 INFO L225 Difference]: With dead ends: 291 [2019-11-07 04:01:31,430 INFO L226 Difference]: Without dead ends: 289 [2019-11-07 04:01:31,432 INFO L630 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-11-07 04:01:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-07 04:01:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2019-11-07 04:01:31,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-07 04:01:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 282 transitions. [2019-11-07 04:01:31,439 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 282 transitions. Word has length 256 [2019-11-07 04:01:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:31,440 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 282 transitions. [2019-11-07 04:01:31,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-11-07 04:01:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 282 transitions. [2019-11-07 04:01:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-07 04:01:31,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:31,442 INFO L410 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-11-07 04:01:31,443 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:31,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 615416761, now seen corresponding path program 1 times [2019-11-07 04:01:31,444 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:31,444 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91419335] [2019-11-07 04:01:31,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:33,342 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91419335] [2019-11-07 04:01:33,342 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:33,343 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-07 04:01:33,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049872798] [2019-11-07 04:01:33,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-07 04:01:33,344 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-07 04:01:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-11-07 04:01:33,346 INFO L87 Difference]: Start difference. First operand 279 states and 282 transitions. Second operand 65 states. [2019-11-07 04:01:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:34,563 INFO L93 Difference]: Finished difference Result 297 states and 302 transitions. [2019-11-07 04:01:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-07 04:01:34,566 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2019-11-07 04:01:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:34,569 INFO L225 Difference]: With dead ends: 297 [2019-11-07 04:01:34,569 INFO L226 Difference]: Without dead ends: 295 [2019-11-07 04:01:34,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 04:01:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-07 04:01:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 277. [2019-11-07 04:01:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-07 04:01:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 280 transitions. [2019-11-07 04:01:34,579 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 280 transitions. Word has length 256 [2019-11-07 04:01:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:34,579 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 280 transitions. [2019-11-07 04:01:34,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-07 04:01:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 280 transitions. [2019-11-07 04:01:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-07 04:01:34,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:34,582 INFO L410 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-11-07 04:01:34,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:34,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1946164781, now seen corresponding path program 1 times [2019-11-07 04:01:34,583 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:34,583 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119400541] [2019-11-07 04:01:34,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:36,309 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119400541] [2019-11-07 04:01:36,310 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:36,310 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-11-07 04:01:36,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602059916] [2019-11-07 04:01:36,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-11-07 04:01:36,311 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-11-07 04:01:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-11-07 04:01:36,313 INFO L87 Difference]: Start difference. First operand 277 states and 280 transitions. Second operand 65 states. [2019-11-07 04:01:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:37,709 INFO L93 Difference]: Finished difference Result 300 states and 305 transitions. [2019-11-07 04:01:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-11-07 04:01:37,710 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-11-07 04:01:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:37,712 INFO L225 Difference]: With dead ends: 300 [2019-11-07 04:01:37,712 INFO L226 Difference]: Without dead ends: 298 [2019-11-07 04:01:37,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-11-07 04:01:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-07 04:01:37,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 275. [2019-11-07 04:01:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-07 04:01:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 278 transitions. [2019-11-07 04:01:37,722 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 278 transitions. Word has length 257 [2019-11-07 04:01:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:37,722 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 278 transitions. [2019-11-07 04:01:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-11-07 04:01:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 278 transitions. [2019-11-07 04:01:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-07 04:01:37,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:37,725 INFO L410 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-11-07 04:01:37,725 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1945770546, now seen corresponding path program 1 times [2019-11-07 04:01:37,726 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:37,726 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304823854] [2019-11-07 04:01:37,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:01:38,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304823854] [2019-11-07 04:01:38,659 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:01:38,659 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:01:38,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998550548] [2019-11-07 04:01:38,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:01:38,660 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:38,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:01:38,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:01:38,661 INFO L87 Difference]: Start difference. First operand 275 states and 278 transitions. Second operand 5 states. [2019-11-07 04:01:39,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:39,149 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2019-11-07 04:01:39,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:01:39,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 257 [2019-11-07 04:01:39,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:39,155 INFO L225 Difference]: With dead ends: 275 [2019-11-07 04:01:39,155 INFO L226 Difference]: Without dead ends: 271 [2019-11-07 04:01:39,156 INFO L630 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-11-07 04:01:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-07 04:01:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-11-07 04:01:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-07 04:01:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 274 transitions. [2019-11-07 04:01:39,166 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 274 transitions. Word has length 257 [2019-11-07 04:01:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:39,167 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 274 transitions. [2019-11-07 04:01:39,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:01:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 274 transitions. [2019-11-07 04:01:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-11-07 04:01:39,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:01:39,169 INFO L410 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-11-07 04:01:39,171 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:01:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:01:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1898055296, now seen corresponding path program 1 times [2019-11-07 04:01:39,171 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:01:39,171 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652977597] [2019-11-07 04:01:39,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:01:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat