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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:58:45,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:58:45,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:58:45,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:58:45,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:58:45,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:58:45,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:58:45,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:58:45,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:58:45,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:58:45,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:58:45,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:58:45,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:58:45,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:58:45,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:58:45,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:58:45,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:58:45,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:58:45,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:58:45,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:58:45,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:58:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:58:45,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:58:45,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:58:45,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:58:45,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:58:45,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:58:45,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:58:45,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:58:45,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:58:45,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:58:45,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:58:45,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:58:45,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:58:45,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:58:45,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:58:45,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:58:45,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:58:45,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:58:45,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:58:45,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:58:45,465 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-13 22:58:45,485 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:58:45,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:58:45,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:58:45,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:58:45,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:58:45,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:58:45,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:58:45,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:58:45,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:58:45,491 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:58:45,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:58:45,491 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:58:45,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:58:45,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:58:45,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:58:45,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:58:45,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:58:45,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:58:45,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:58:45,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:58:45,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:58:45,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:58:45,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:58:45,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:58:45,494 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-13 22:58:45,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:58:45,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:58:45,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:58:45,822 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:58:45,822 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:58:45,823 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.v+nlh-reducer.c [2019-10-13 22:58:45,900 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad6cdb51/a5a57a387607461da5e4eb14b92fb41e/FLAG23085ba63 [2019-10-13 22:58:46,354 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:58:46,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.v+nlh-reducer.c [2019-10-13 22:58:46,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad6cdb51/a5a57a387607461da5e4eb14b92fb41e/FLAG23085ba63 [2019-10-13 22:58:46,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ad6cdb51/a5a57a387607461da5e4eb14b92fb41e [2019-10-13 22:58:46,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:58:46,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:58:46,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:46,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:58:46,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:58:46,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:46,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5000c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:46, skipping insertion in model container [2019-10-13 22:58:46,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:58:46" (1/1) ... [2019-10-13 22:58:46,741 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:58:46,787 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:58:47,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:47,025 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:58:47,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:58:47,175 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:58:47,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47 WrapperNode [2019-10-13 22:58:47,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:58:47,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:58:47,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:58:47,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:58:47,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (1/1) ... [2019-10-13 22:58:47,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:58:47,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:58:47,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:58:47,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:58:47,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (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-13 22:58:47,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:58:47,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:58:47,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:58:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:58:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:58:47,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:58:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:58:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:58:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:58:47,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:58:47,673 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:58:47,674 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:58:47,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47 BoogieIcfgContainer [2019-10-13 22:58:47,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:58:47,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:58:47,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:58:47,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:58:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:58:46" (1/3) ... [2019-10-13 22:58:47,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ef85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:58:47" (2/3) ... [2019-10-13 22:58:47,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392ef85a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:58:47, skipping insertion in model container [2019-10-13 22:58:47,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:58:47" (3/3) ... [2019-10-13 22:58:47,684 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+nlh-reducer.c [2019-10-13 22:58:47,697 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:58:47,709 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-10-13 22:58:47,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-10-13 22:58:47,744 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:58:47,744 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:58:47,744 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:58:47,745 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:58:47,745 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:58:47,745 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:58:47,745 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:58:47,745 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:58:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-10-13 22:58:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:58:47,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:47,774 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:47,776 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:47,781 INFO L82 PathProgramCache]: Analyzing trace with hash -578618040, now seen corresponding path program 1 times [2019-10-13 22:58:47,788 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:47,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961996355] [2019-10-13 22:58:47,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:47,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:47,978 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-13 22:58:47,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961996355] [2019-10-13 22:58:47,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:47,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:47,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916786160] [2019-10-13 22:58:47,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:47,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:47,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:47,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:47,997 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-10-13 22:58:48,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,197 INFO L93 Difference]: Finished difference Result 132 states and 175 transitions. [2019-10-13 22:58:48,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:48,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:58:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,212 INFO L225 Difference]: With dead ends: 132 [2019-10-13 22:58:48,212 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 22:58:48,216 INFO L600 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-13 22:58:48,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 22:58:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2019-10-13 22:58:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-13 22:58:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2019-10-13 22:58:48,273 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2019-10-13 22:58:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,274 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2019-10-13 22:58:48,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2019-10-13 22:58:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:58:48,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,275 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,276 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash -581852346, now seen corresponding path program 1 times [2019-10-13 22:58:48,277 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126426102] [2019-10-13 22:58:48,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,278 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,322 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-13 22:58:48,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126426102] [2019-10-13 22:58:48,323 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:48,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581050001] [2019-10-13 22:58:48,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:48,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:48,326 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2019-10-13 22:58:48,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,402 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-13 22:58:48,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:48,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:58:48,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,404 INFO L225 Difference]: With dead ends: 68 [2019-10-13 22:58:48,404 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 22:58:48,405 INFO L600 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-13 22:58:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 22:58:48,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-13 22:58:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-13 22:58:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2019-10-13 22:58:48,420 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 11 [2019-10-13 22:58:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,420 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-10-13 22:58:48,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2019-10-13 22:58:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:58:48,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,422 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,424 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,424 INFO L82 PathProgramCache]: Analyzing trace with hash -857550477, now seen corresponding path program 1 times [2019-10-13 22:58:48,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918023807] [2019-10-13 22:58:48,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,501 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-13 22:58:48,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918023807] [2019-10-13 22:58:48,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,504 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:48,504 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966951365] [2019-10-13 22:58:48,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:48,505 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:48,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:48,506 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 4 states. [2019-10-13 22:58:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,588 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-10-13 22:58:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:48,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-13 22:58:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,590 INFO L225 Difference]: With dead ends: 72 [2019-10-13 22:58:48,590 INFO L226 Difference]: Without dead ends: 70 [2019-10-13 22:58:48,591 INFO L600 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-13 22:58:48,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-13 22:58:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-13 22:58:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 22:58:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-13 22:58:48,601 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2019-10-13 22:58:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,601 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-13 22:58:48,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-13 22:58:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:58:48,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,603 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,604 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1903246913, now seen corresponding path program 1 times [2019-10-13 22:58:48,605 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190631548] [2019-10-13 22:58:48,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,674 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-13 22:58:48,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190631548] [2019-10-13 22:58:48,679 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660946370] [2019-10-13 22:58:48,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,682 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 5 states. [2019-10-13 22:58:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:48,809 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-10-13 22:58:48,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:48,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 22:58:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:48,810 INFO L225 Difference]: With dead ends: 70 [2019-10-13 22:58:48,811 INFO L226 Difference]: Without dead ends: 68 [2019-10-13 22:58:48,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-13 22:58:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-10-13 22:58:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-13 22:58:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-13 22:58:48,828 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 14 [2019-10-13 22:58:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:48,828 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-13 22:58:48,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:48,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-13 22:58:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:58:48,829 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:48,829 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:48,830 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:48,833 INFO L82 PathProgramCache]: Analyzing trace with hash 527808727, now seen corresponding path program 1 times [2019-10-13 22:58:48,833 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:48,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817005624] [2019-10-13 22:58:48,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:48,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:48,921 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-13 22:58:48,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817005624] [2019-10-13 22:58:48,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:48,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:48,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458144212] [2019-10-13 22:58:48,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:48,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:48,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:48,925 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2019-10-13 22:58:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,025 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-10-13 22:58:49,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:49,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-10-13 22:58:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,027 INFO L225 Difference]: With dead ends: 68 [2019-10-13 22:58:49,027 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 22:58:49,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:49,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 22:58:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-10-13 22:58:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-13 22:58:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-10-13 22:58:49,035 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2019-10-13 22:58:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,035 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-10-13 22:58:49,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-10-13 22:58:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:49,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,037 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,037 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1129321007, now seen corresponding path program 1 times [2019-10-13 22:58:49,038 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926896688] [2019-10-13 22:58:49,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,093 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-13 22:58:49,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926896688] [2019-10-13 22:58:49,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:49,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412902879] [2019-10-13 22:58:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:49,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:49,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:49,096 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 5 states. [2019-10-13 22:58:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,214 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2019-10-13 22:58:49,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:49,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-13 22:58:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,216 INFO L225 Difference]: With dead ends: 111 [2019-10-13 22:58:49,216 INFO L226 Difference]: Without dead ends: 109 [2019-10-13 22:58:49,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-13 22:58:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 63. [2019-10-13 22:58:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-13 22:58:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-13 22:58:49,234 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 15 [2019-10-13 22:58:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,234 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-13 22:58:49,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-13 22:58:49,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:49,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1128891024, now seen corresponding path program 1 times [2019-10-13 22:58:49,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845681141] [2019-10-13 22:58:49,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,239 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,305 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-13 22:58:49,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845681141] [2019-10-13 22:58:49,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:49,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485341285] [2019-10-13 22:58:49,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:49,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:49,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:49,308 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 4 states. [2019-10-13 22:58:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,378 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-10-13 22:58:49,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:49,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 22:58:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,379 INFO L225 Difference]: With dead ends: 64 [2019-10-13 22:58:49,380 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 22:58:49,382 INFO L600 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-13 22:58:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 22:58:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-10-13 22:58:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 22:58:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-13 22:58:49,392 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 15 [2019-10-13 22:58:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,392 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-13 22:58:49,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-13 22:58:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:58:49,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash -817795566, now seen corresponding path program 1 times [2019-10-13 22:58:49,396 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478832620] [2019-10-13 22:58:49,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,398 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,452 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-13 22:58:49,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478832620] [2019-10-13 22:58:49,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:49,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090236588] [2019-10-13 22:58:49,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:49,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:49,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:49,455 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 4 states. [2019-10-13 22:58:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,519 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-10-13 22:58:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:49,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 22:58:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,521 INFO L225 Difference]: With dead ends: 60 [2019-10-13 22:58:49,521 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 22:58:49,522 INFO L600 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-13 22:58:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 22:58:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-13 22:58:49,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-13 22:58:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-13 22:58:49,528 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 15 [2019-10-13 22:58:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,528 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-13 22:58:49,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-13 22:58:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:49,529 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,529 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,530 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash 649216051, now seen corresponding path program 1 times [2019-10-13 22:58:49,531 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694038703] [2019-10-13 22:58:49,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,622 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-13 22:58:49,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694038703] [2019-10-13 22:58:49,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:49,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739289632] [2019-10-13 22:58:49,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:49,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:49,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:49,626 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 5 states. [2019-10-13 22:58:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,742 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-10-13 22:58:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:49,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,744 INFO L225 Difference]: With dead ends: 94 [2019-10-13 22:58:49,744 INFO L226 Difference]: Without dead ends: 92 [2019-10-13 22:58:49,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-10-13 22:58:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2019-10-13 22:58:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 22:58:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-10-13 22:58:49,752 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 16 [2019-10-13 22:58:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,753 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-10-13 22:58:49,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-10-13 22:58:49,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:49,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,757 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash 432363561, now seen corresponding path program 1 times [2019-10-13 22:58:49,758 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428657904] [2019-10-13 22:58:49,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,761 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,818 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-13 22:58:49,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428657904] [2019-10-13 22:58:49,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:49,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444877060] [2019-10-13 22:58:49,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:49,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:49,821 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 5 states. [2019-10-13 22:58:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:49,923 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2019-10-13 22:58:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:49,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:49,924 INFO L225 Difference]: With dead ends: 71 [2019-10-13 22:58:49,925 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 22:58:49,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 22:58:49,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-10-13 22:58:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 22:58:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-13 22:58:49,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2019-10-13 22:58:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:49,936 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-13 22:58:49,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-13 22:58:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:58:49,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:49,938 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:49,939 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:49,939 INFO L82 PathProgramCache]: Analyzing trace with hash 433902761, now seen corresponding path program 1 times [2019-10-13 22:58:49,940 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:49,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704176648] [2019-10-13 22:58:49,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:49,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:49,986 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-13 22:58:49,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704176648] [2019-10-13 22:58:49,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:49,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:49,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345110727] [2019-10-13 22:58:49,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:49,988 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:49,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:49,989 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 5 states. [2019-10-13 22:58:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,065 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-10-13 22:58:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:50,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 22:58:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,066 INFO L225 Difference]: With dead ends: 52 [2019-10-13 22:58:50,066 INFO L226 Difference]: Without dead ends: 50 [2019-10-13 22:58:50,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:50,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-13 22:58:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-13 22:58:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 22:58:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-13 22:58:50,071 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 16 [2019-10-13 22:58:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,072 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-13 22:58:50,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-13 22:58:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:50,073 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,073 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,073 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1355384845, now seen corresponding path program 1 times [2019-10-13 22:58:50,074 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638720755] [2019-10-13 22:58:50,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,075 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,142 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-13 22:58:50,143 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638720755] [2019-10-13 22:58:50,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:50,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476282553] [2019-10-13 22:58:50,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:50,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:50,144 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2019-10-13 22:58:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,224 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-10-13 22:58:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:50,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,225 INFO L225 Difference]: With dead ends: 49 [2019-10-13 22:58:50,226 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 22:58:50,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 22:58:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-10-13 22:58:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-13 22:58:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-10-13 22:58:50,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2019-10-13 22:58:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,232 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-10-13 22:58:50,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-10-13 22:58:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:50,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,236 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,237 INFO L82 PathProgramCache]: Analyzing trace with hash 519737025, now seen corresponding path program 1 times [2019-10-13 22:58:50,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251170963] [2019-10-13 22:58:50,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,287 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-13 22:58:50,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251170963] [2019-10-13 22:58:50,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:50,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440218670] [2019-10-13 22:58:50,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:50,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:50,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:50,294 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2019-10-13 22:58:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,384 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2019-10-13 22:58:50,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:50,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,386 INFO L225 Difference]: With dead ends: 68 [2019-10-13 22:58:50,386 INFO L226 Difference]: Without dead ends: 66 [2019-10-13 22:58:50,386 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-13 22:58:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2019-10-13 22:58:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 22:58:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-10-13 22:58:50,390 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 17 [2019-10-13 22:58:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,391 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-10-13 22:58:50,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-10-13 22:58:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:50,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,392 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 518371605, now seen corresponding path program 1 times [2019-10-13 22:58:50,393 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030834114] [2019-10-13 22:58:50,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,393 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,455 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-13 22:58:50,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030834114] [2019-10-13 22:58:50,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:50,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178083448] [2019-10-13 22:58:50,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:50,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:50,458 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2019-10-13 22:58:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,541 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-10-13 22:58:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:50,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:50,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,543 INFO L225 Difference]: With dead ends: 56 [2019-10-13 22:58:50,543 INFO L226 Difference]: Without dead ends: 54 [2019-10-13 22:58:50,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-13 22:58:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-10-13 22:58:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 22:58:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-10-13 22:58:50,548 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 17 [2019-10-13 22:58:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,549 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-10-13 22:58:50,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-10-13 22:58:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:58:50,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,550 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,550 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash 566086855, now seen corresponding path program 1 times [2019-10-13 22:58:50,551 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904347763] [2019-10-13 22:58:50,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,609 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-13 22:58:50,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904347763] [2019-10-13 22:58:50,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:50,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682884657] [2019-10-13 22:58:50,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:50,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:50,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:50,612 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 5 states. [2019-10-13 22:58:50,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,671 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-13 22:58:50,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:58:50,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 22:58:50,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,672 INFO L225 Difference]: With dead ends: 40 [2019-10-13 22:58:50,672 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 22:58:50,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 22:58:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-13 22:58:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-13 22:58:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-13 22:58:50,676 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2019-10-13 22:58:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,676 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-13 22:58:50,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-13 22:58:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:58:50,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,677 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,678 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1068018276, now seen corresponding path program 1 times [2019-10-13 22:58:50,678 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361277145] [2019-10-13 22:58:50,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,722 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-13 22:58:50,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361277145] [2019-10-13 22:58:50,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:58:50,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183547921] [2019-10-13 22:58:50,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:58:50,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:58:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:58:50,725 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 5 states. [2019-10-13 22:58:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,790 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2019-10-13 22:58:50,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:50,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-13 22:58:50,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,792 INFO L225 Difference]: With dead ends: 51 [2019-10-13 22:58:50,792 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 22:58:50,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 22:58:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2019-10-13 22:58:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-13 22:58:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-10-13 22:58:50,796 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2019-10-13 22:58:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,796 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-10-13 22:58:50,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:58:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-10-13 22:58:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:58:50,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,797 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,798 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -60997448, now seen corresponding path program 1 times [2019-10-13 22:58:50,799 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105658204] [2019-10-13 22:58:50,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,835 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-13 22:58:50,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105658204] [2019-10-13 22:58:50,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:58:50,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204132502] [2019-10-13 22:58:50,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:58:50,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:58:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:58:50,838 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2019-10-13 22:58:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:50,919 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-13 22:58:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:58:50,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-13 22:58:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:50,923 INFO L225 Difference]: With dead ends: 55 [2019-10-13 22:58:50,923 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 22:58:50,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:58:50,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 22:58:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2019-10-13 22:58:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 22:58:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-10-13 22:58:50,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2019-10-13 22:58:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:50,929 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-10-13 22:58:50,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:58:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-10-13 22:58:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:58:50,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:50,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:50,937 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:50,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1890917771, now seen corresponding path program 1 times [2019-10-13 22:58:50,938 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:50,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574105112] [2019-10-13 22:58:50,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:50,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:50,961 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-13 22:58:50,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574105112] [2019-10-13 22:58:50,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:58:50,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:58:50,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707105596] [2019-10-13 22:58:50,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:58:50,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:58:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:58:50,963 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2019-10-13 22:58:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:51,000 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-13 22:58:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:58:51,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 22:58:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:51,001 INFO L225 Difference]: With dead ends: 36 [2019-10-13 22:58:51,001 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:58:51,001 INFO L600 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-13 22:58:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:58:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:58:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:58:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:58:51,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-13 22:58:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:51,002 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:58:51,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:58:51,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:58:51,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:58:51,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:58:51,391 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:58:51,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:58:51,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:58:51,392 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 22:58:51,392 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:58:51,392 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 22:58:51,393 INFO L443 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2019-10-13 22:58:51,393 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2019-10-13 22:58:51,393 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-13 22:58:51,393 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2019-10-13 22:58:51,393 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-13 22:58:51,394 INFO L443 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2019-10-13 22:58:51,394 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-10-13 22:58:51,394 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2019-10-13 22:58:51,394 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2019-10-13 22:58:51,394 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2019-10-13 22:58:51,395 INFO L443 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2019-10-13 22:58:51,395 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2019-10-13 22:58:51,395 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2019-10-13 22:58:51,395 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2019-10-13 22:58:51,395 INFO L443 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2019-10-13 22:58:51,396 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-10-13 22:58:51,396 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2019-10-13 22:58:51,396 INFO L446 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2019-10-13 22:58:51,396 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2019-10-13 22:58:51,396 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-10-13 22:58:51,396 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2019-10-13 22:58:51,397 INFO L443 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2019-10-13 22:58:51,397 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2019-10-13 22:58:51,397 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2019-10-13 22:58:51,397 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2019-10-13 22:58:51,397 INFO L439 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 0 main_~main__t~0)) [2019-10-13 22:58:51,397 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2019-10-13 22:58:51,398 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-10-13 22:58:51,399 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2019-10-13 22:58:51,400 INFO L439 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-13 22:58:51,401 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-13 22:58:51,401 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2019-10-13 22:58:51,402 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2019-10-13 22:58:51,403 INFO L443 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-10-13 22:58:51,404 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2019-10-13 22:58:51,405 INFO L443 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2019-10-13 22:58:51,405 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2019-10-13 22:58:51,405 INFO L443 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2019-10-13 22:58:51,405 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2019-10-13 22:58:51,405 INFO L439 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~main__tagbuf_len~0 main_~main__t~0)) (<= 0 main_~main__t~0)) [2019-10-13 22:58:51,405 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2019-10-13 22:58:51,406 INFO L439 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= 1 main_~main__t~0)) [2019-10-13 22:58:51,406 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-13 22:58:51,406 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-13 22:58:51,406 INFO L443 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2019-10-13 22:58:51,406 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2019-10-13 22:58:51,407 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-13 22:58:51,407 INFO L443 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2019-10-13 22:58:51,407 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-13 22:58:51,407 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2019-10-13 22:58:51,407 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2019-10-13 22:58:51,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:58:51 BoogieIcfgContainer [2019-10-13 22:58:51,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 22:58:51,440 INFO L168 Benchmark]: Toolchain (without parser) took 4717.31 ms. Allocated memory was 143.7 MB in the beginning and 249.0 MB in the end (delta: 105.4 MB). Free memory was 100.2 MB in the beginning and 150.6 MB in the end (delta: -50.3 MB). Peak memory consumption was 55.1 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,443 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.61 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 179.3 MB in the end (delta: -79.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,451 INFO L168 Benchmark]: Boogie Preprocessor took 40.14 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 177.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,453 INFO L168 Benchmark]: RCFGBuilder took 458.49 ms. Allocated memory is still 200.8 MB. Free memory was 177.2 MB in the beginning and 153.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,458 INFO L168 Benchmark]: TraceAbstraction took 3760.82 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 153.0 MB in the beginning and 150.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:58:51,466 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.22 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 452.61 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 99.8 MB in the beginning and 179.3 MB in the end (delta: -79.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.14 ms. Allocated memory is still 200.8 MB. Free memory was 179.3 MB in the beginning and 177.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 458.49 ms. Allocated memory is still 200.8 MB. Free memory was 177.2 MB in the beginning and 153.0 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3760.82 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 153.0 MB in the beginning and 150.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((main__t <= main__tagbuf_len && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && !(main__tagbuf_len == main__t)) && !(__VERIFIER_assert__cond == 0)) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 75 locations, 17 error locations. Result: SAFE, OverallTime: 3.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 783 SDtfs, 1345 SDslu, 775 SDs, 0 SdLazy, 998 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 230 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 14 NumberOfFragments, 69 HoareAnnotationTreeSize, 9 FomulaSimplifications, 138182 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 3250 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 10120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...