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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:38,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:38,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:38,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:38,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:38,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:38,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:38,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:38,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:38,119 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:38,120 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:38,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:38,122 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:38,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:38,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:38,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:38,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:38,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:38,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:38,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:38,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:38,134 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:38,135 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:38,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:38,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:38,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:38,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:38,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:38,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:38,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:38,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:38,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:38,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:38,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:38,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:38,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:38,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:38,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:38,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:38,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:38,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:38,150 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 23:21:38,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:38,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:38,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:38,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:38,170 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:38,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:38,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:38,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:38,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:38,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:38,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:38,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:38,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:38,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:38,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:38,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:38,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:38,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:38,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:38,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:38,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:38,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:38,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:38,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:38,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:38,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:38,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:38,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:38,176 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 23:21:38,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:38,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:38,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:38,523 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:38,524 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:38,524 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:38,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1074029ad/cedf03a3b0f04a34af903ef05c44e6c5/FLAG03ca25159 [2019-10-13 23:21:39,217 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:39,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:39,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1074029ad/cedf03a3b0f04a34af903ef05c44e6c5/FLAG03ca25159 [2019-10-13 23:21:39,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1074029ad/cedf03a3b0f04a34af903ef05c44e6c5 [2019-10-13 23:21:39,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:39,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:39,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:39,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:39,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:39,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:39" (1/1) ... [2019-10-13 23:21:39,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:39, skipping insertion in model container [2019-10-13 23:21:39,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:39" (1/1) ... [2019-10-13 23:21:39,456 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:39,552 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:40,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:40,270 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:40,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:40,729 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:40,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40 WrapperNode [2019-10-13 23:21:40,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:40,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:40,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:40,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:40,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (1/1) ... [2019-10-13 23:21:40,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:40,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:40,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:40,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:40,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (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 23:21:40,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:40,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:40,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:40,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:40,990 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:40,991 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:40,993 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:40,994 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:40,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:40,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:43,341 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:43,342 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:43,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:43 BoogieIcfgContainer [2019-10-13 23:21:43,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:43,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:43,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:43,350 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:43,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:39" (1/3) ... [2019-10-13 23:21:43,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba5381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:43, skipping insertion in model container [2019-10-13 23:21:43,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:40" (2/3) ... [2019-10-13 23:21:43,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ba5381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:43, skipping insertion in model container [2019-10-13 23:21:43,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:43" (3/3) ... [2019-10-13 23:21:43,363 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:43,375 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:43,387 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 23:21:43,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 23:21:43,442 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:43,442 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:43,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:43,442 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:43,443 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:43,443 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:43,443 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:43,443 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states. [2019-10-13 23:21:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:43,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:43,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:43,508 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 118183988, now seen corresponding path program 1 times [2019-10-13 23:21:43,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:43,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52808621] [2019-10-13 23:21:43,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:43,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:43,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:44,070 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 23:21:44,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52808621] [2019-10-13 23:21:44,072 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:44,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:44,073 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688821114] [2019-10-13 23:21:44,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:44,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:44,100 INFO L87 Difference]: Start difference. First operand 422 states. Second operand 3 states. [2019-10-13 23:21:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:44,269 INFO L93 Difference]: Finished difference Result 626 states and 1096 transitions. [2019-10-13 23:21:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:44,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-13 23:21:44,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:44,303 INFO L225 Difference]: With dead ends: 626 [2019-10-13 23:21:44,303 INFO L226 Difference]: Without dead ends: 503 [2019-10-13 23:21:44,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-13 23:21:44,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 497. [2019-10-13 23:21:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-10-13 23:21:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 637 transitions. [2019-10-13 23:21:44,422 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 637 transitions. Word has length 53 [2019-10-13 23:21:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:44,423 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 637 transitions. [2019-10-13 23:21:44,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 637 transitions. [2019-10-13 23:21:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:44,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:44,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:44,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:44,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:44,434 INFO L82 PathProgramCache]: Analyzing trace with hash 986153255, now seen corresponding path program 1 times [2019-10-13 23:21:44,435 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:44,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934691494] [2019-10-13 23:21:44,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:44,613 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 23:21:44,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934691494] [2019-10-13 23:21:44,614 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:44,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:44,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543118911] [2019-10-13 23:21:44,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:44,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:44,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:44,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:44,617 INFO L87 Difference]: Start difference. First operand 497 states and 637 transitions. Second operand 3 states. [2019-10-13 23:21:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:44,685 INFO L93 Difference]: Finished difference Result 828 states and 1093 transitions. [2019-10-13 23:21:44,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:44,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-13 23:21:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:44,689 INFO L225 Difference]: With dead ends: 828 [2019-10-13 23:21:44,690 INFO L226 Difference]: Without dead ends: 633 [2019-10-13 23:21:44,692 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-13 23:21:44,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 627. [2019-10-13 23:21:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 23:21:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 814 transitions. [2019-10-13 23:21:44,718 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 814 transitions. Word has length 53 [2019-10-13 23:21:44,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:44,719 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 814 transitions. [2019-10-13 23:21:44,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 814 transitions. [2019-10-13 23:21:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:44,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:44,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:44,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:44,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1690641165, now seen corresponding path program 1 times [2019-10-13 23:21:44,723 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:44,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578858409] [2019-10-13 23:21:44,723 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:44,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:44,999 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 23:21:45,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578858409] [2019-10-13 23:21:45,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:45,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:45,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111744546] [2019-10-13 23:21:45,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:45,005 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:45,005 INFO L87 Difference]: Start difference. First operand 627 states and 814 transitions. Second operand 10 states. [2019-10-13 23:21:46,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:46,941 INFO L93 Difference]: Finished difference Result 1680 states and 2273 transitions. [2019-10-13 23:21:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:21:46,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-13 23:21:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:46,961 INFO L225 Difference]: With dead ends: 1680 [2019-10-13 23:21:46,961 INFO L226 Difference]: Without dead ends: 1584 [2019-10-13 23:21:46,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:21:46,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2019-10-13 23:21:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 638. [2019-10-13 23:21:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-13 23:21:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 828 transitions. [2019-10-13 23:21:47,013 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 828 transitions. Word has length 53 [2019-10-13 23:21:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:47,015 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 828 transitions. [2019-10-13 23:21:47,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:47,015 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 828 transitions. [2019-10-13 23:21:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:47,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:47,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:47,018 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:47,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash 826964088, now seen corresponding path program 1 times [2019-10-13 23:21:47,018 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:47,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522356847] [2019-10-13 23:21:47,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:47,139 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 23:21:47,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522356847] [2019-10-13 23:21:47,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:47,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:47,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073082236] [2019-10-13 23:21:47,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:47,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:47,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:47,142 INFO L87 Difference]: Start difference. First operand 638 states and 828 transitions. Second operand 3 states. [2019-10-13 23:21:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:47,252 INFO L93 Difference]: Finished difference Result 1145 states and 1509 transitions. [2019-10-13 23:21:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:47,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-13 23:21:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:47,258 INFO L225 Difference]: With dead ends: 1145 [2019-10-13 23:21:47,259 INFO L226 Difference]: Without dead ends: 900 [2019-10-13 23:21:47,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-10-13 23:21:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 893. [2019-10-13 23:21:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-10-13 23:21:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1164 transitions. [2019-10-13 23:21:47,341 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1164 transitions. Word has length 54 [2019-10-13 23:21:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:47,343 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1164 transitions. [2019-10-13 23:21:47,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1164 transitions. [2019-10-13 23:21:47,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:47,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:47,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:47,348 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash 720923157, now seen corresponding path program 1 times [2019-10-13 23:21:47,349 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:47,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451880711] [2019-10-13 23:21:47,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:47,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:47,580 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 23:21:47,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451880711] [2019-10-13 23:21:47,581 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:47,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:47,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311486165] [2019-10-13 23:21:47,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:47,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:47,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:47,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:47,583 INFO L87 Difference]: Start difference. First operand 893 states and 1164 transitions. Second operand 12 states. [2019-10-13 23:21:50,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:50,573 INFO L93 Difference]: Finished difference Result 2772 states and 3661 transitions. [2019-10-13 23:21:50,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:50,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-13 23:21:50,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:50,587 INFO L225 Difference]: With dead ends: 2772 [2019-10-13 23:21:50,587 INFO L226 Difference]: Without dead ends: 2639 [2019-10-13 23:21:50,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:21:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-10-13 23:21:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 909. [2019-10-13 23:21:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-13 23:21:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1187 transitions. [2019-10-13 23:21:50,706 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1187 transitions. Word has length 54 [2019-10-13 23:21:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:50,706 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1187 transitions. [2019-10-13 23:21:50,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1187 transitions. [2019-10-13 23:21:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:50,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:50,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:50,709 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:50,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1425411067, now seen corresponding path program 1 times [2019-10-13 23:21:50,710 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:50,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358837802] [2019-10-13 23:21:50,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,711 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:50,848 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 23:21:50,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358837802] [2019-10-13 23:21:50,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:50,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:50,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365210613] [2019-10-13 23:21:50,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:50,850 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:50,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:50,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:50,851 INFO L87 Difference]: Start difference. First operand 909 states and 1187 transitions. Second operand 9 states. [2019-10-13 23:21:52,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:52,086 INFO L93 Difference]: Finished difference Result 3241 states and 4310 transitions. [2019-10-13 23:21:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:21:52,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 23:21:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:52,101 INFO L225 Difference]: With dead ends: 3241 [2019-10-13 23:21:52,102 INFO L226 Difference]: Without dead ends: 2641 [2019-10-13 23:21:52,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:21:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-10-13 23:21:52,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1900. [2019-10-13 23:21:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-10-13 23:21:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2528 transitions. [2019-10-13 23:21:52,270 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2528 transitions. Word has length 54 [2019-10-13 23:21:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:52,270 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 2528 transitions. [2019-10-13 23:21:52,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:21:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2528 transitions. [2019-10-13 23:21:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:52,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:52,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:52,274 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 671280621, now seen corresponding path program 1 times [2019-10-13 23:21:52,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:52,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748520737] [2019-10-13 23:21:52,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,275 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:52,428 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 23:21:52,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748520737] [2019-10-13 23:21:52,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:52,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:52,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278967902] [2019-10-13 23:21:52,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:52,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:52,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:52,431 INFO L87 Difference]: Start difference. First operand 1900 states and 2528 transitions. Second operand 10 states. [2019-10-13 23:21:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:54,236 INFO L93 Difference]: Finished difference Result 4351 states and 5721 transitions. [2019-10-13 23:21:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:21:54,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-13 23:21:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:54,253 INFO L225 Difference]: With dead ends: 4351 [2019-10-13 23:21:54,253 INFO L226 Difference]: Without dead ends: 4092 [2019-10-13 23:21:54,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:21:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4092 states. [2019-10-13 23:21:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4092 to 1911. [2019-10-13 23:21:54,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1911 states. [2019-10-13 23:21:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2542 transitions. [2019-10-13 23:21:54,474 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2542 transitions. Word has length 54 [2019-10-13 23:21:54,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:54,475 INFO L462 AbstractCegarLoop]: Abstraction has 1911 states and 2542 transitions. [2019-10-13 23:21:54,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:54,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2542 transitions. [2019-10-13 23:21:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:54,479 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:54,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:54,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:54,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:54,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1263798090, now seen corresponding path program 1 times [2019-10-13 23:21:54,480 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:54,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943646796] [2019-10-13 23:21:54,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,480 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,632 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 23:21:54,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943646796] [2019-10-13 23:21:54,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:54,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:54,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214484384] [2019-10-13 23:21:54,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:54,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:54,635 INFO L87 Difference]: Start difference. First operand 1911 states and 2542 transitions. Second operand 9 states. [2019-10-13 23:21:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:56,121 INFO L93 Difference]: Finished difference Result 4351 states and 5791 transitions. [2019-10-13 23:21:56,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:21:56,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 23:21:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:56,134 INFO L225 Difference]: With dead ends: 4351 [2019-10-13 23:21:56,134 INFO L226 Difference]: Without dead ends: 3985 [2019-10-13 23:21:56,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:21:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3985 states. [2019-10-13 23:21:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3985 to 1926. [2019-10-13 23:21:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-10-13 23:21:56,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2564 transitions. [2019-10-13 23:21:56,449 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2564 transitions. Word has length 55 [2019-10-13 23:21:56,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:56,449 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2564 transitions. [2019-10-13 23:21:56,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:21:56,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2564 transitions. [2019-10-13 23:21:56,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:56,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:56,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:56,454 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:56,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1901142492, now seen corresponding path program 1 times [2019-10-13 23:21:56,454 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:56,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804002148] [2019-10-13 23:21:56,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:56,564 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 23:21:56,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804002148] [2019-10-13 23:21:56,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:56,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:56,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609862232] [2019-10-13 23:21:56,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:56,567 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:56,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:56,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:56,569 INFO L87 Difference]: Start difference. First operand 1926 states and 2564 transitions. Second operand 6 states. [2019-10-13 23:21:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:57,266 INFO L93 Difference]: Finished difference Result 3137 states and 4192 transitions. [2019-10-13 23:21:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:57,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:21:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:57,272 INFO L225 Difference]: With dead ends: 3137 [2019-10-13 23:21:57,273 INFO L226 Difference]: Without dead ends: 1813 [2019-10-13 23:21:57,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2019-10-13 23:21:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1342. [2019-10-13 23:21:57,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-13 23:21:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-10-13 23:21:57,470 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-10-13 23:21:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:57,471 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-10-13 23:21:57,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:57,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-10-13 23:21:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:57,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:57,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:57,474 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1734009014, now seen corresponding path program 1 times [2019-10-13 23:21:57,481 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:57,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910358241] [2019-10-13 23:21:57,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:57,481 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:57,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:57,664 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 23:21:57,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910358241] [2019-10-13 23:21:57,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:57,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:57,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490539127] [2019-10-13 23:21:57,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:57,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:57,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:57,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:57,667 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 10 states. [2019-10-13 23:22:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:01,242 INFO L93 Difference]: Finished difference Result 6178 states and 8352 transitions. [2019-10-13 23:22:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 23:22:01,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-13 23:22:01,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:01,260 INFO L225 Difference]: With dead ends: 6178 [2019-10-13 23:22:01,260 INFO L226 Difference]: Without dead ends: 5828 [2019-10-13 23:22:01,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2019-10-13 23:22:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 1342. [2019-10-13 23:22:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-10-13 23:22:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 1765 transitions. [2019-10-13 23:22:01,440 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 1765 transitions. Word has length 55 [2019-10-13 23:22:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:01,441 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 1765 transitions. [2019-10-13 23:22:01,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:22:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 1765 transitions. [2019-10-13 23:22:01,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:01,444 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:01,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:01,444 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:01,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:01,444 INFO L82 PathProgramCache]: Analyzing trace with hash -810802093, now seen corresponding path program 1 times [2019-10-13 23:22:01,445 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:01,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821959804] [2019-10-13 23:22:01,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:01,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:01,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:01,570 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 23:22:01,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821959804] [2019-10-13 23:22:01,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:01,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:01,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205360484] [2019-10-13 23:22:01,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:01,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:01,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:01,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:01,572 INFO L87 Difference]: Start difference. First operand 1342 states and 1765 transitions. Second operand 9 states. [2019-10-13 23:22:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,201 INFO L93 Difference]: Finished difference Result 5855 states and 7757 transitions. [2019-10-13 23:22:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:03,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 23:22:03,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,220 INFO L225 Difference]: With dead ends: 5855 [2019-10-13 23:22:03,220 INFO L226 Difference]: Without dead ends: 4755 [2019-10-13 23:22:03,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2019-10-13 23:22:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3230. [2019-10-13 23:22:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2019-10-13 23:22:03,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 4279 transitions. [2019-10-13 23:22:03,668 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 4279 transitions. Word has length 55 [2019-10-13 23:22:03,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:03,668 INFO L462 AbstractCegarLoop]: Abstraction has 3230 states and 4279 transitions. [2019-10-13 23:22:03,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:03,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 4279 transitions. [2019-10-13 23:22:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:03,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:03,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:03,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:03,674 INFO L82 PathProgramCache]: Analyzing trace with hash -890852479, now seen corresponding path program 1 times [2019-10-13 23:22:03,674 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:03,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597180839] [2019-10-13 23:22:03,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,674 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:03,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:03,787 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 23:22:03,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597180839] [2019-10-13 23:22:03,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:03,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:03,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778671851] [2019-10-13 23:22:03,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:03,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:03,790 INFO L87 Difference]: Start difference. First operand 3230 states and 4279 transitions. Second operand 9 states. [2019-10-13 23:22:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:07,881 INFO L93 Difference]: Finished difference Result 12907 states and 17014 transitions. [2019-10-13 23:22:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:07,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 23:22:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:07,905 INFO L225 Difference]: With dead ends: 12907 [2019-10-13 23:22:07,906 INFO L226 Difference]: Without dead ends: 11893 [2019-10-13 23:22:07,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11893 states. [2019-10-13 23:22:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11893 to 3244. [2019-10-13 23:22:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-10-13 23:22:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4297 transitions. [2019-10-13 23:22:08,522 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4297 transitions. Word has length 55 [2019-10-13 23:22:08,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:08,522 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4297 transitions. [2019-10-13 23:22:08,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4297 transitions. [2019-10-13 23:22:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:08,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:08,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:08,527 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:08,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash 154971769, now seen corresponding path program 1 times [2019-10-13 23:22:08,527 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:08,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330589940] [2019-10-13 23:22:08,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:08,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:08,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330589940] [2019-10-13 23:22:08,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:08,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:08,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362488241] [2019-10-13 23:22:08,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:08,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:08,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:08,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:08,627 INFO L87 Difference]: Start difference. First operand 3244 states and 4297 transitions. Second operand 7 states. [2019-10-13 23:22:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,769 INFO L93 Difference]: Finished difference Result 7810 states and 10405 transitions. [2019-10-13 23:22:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:10,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-13 23:22:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,787 INFO L225 Difference]: With dead ends: 7810 [2019-10-13 23:22:10,787 INFO L226 Difference]: Without dead ends: 7307 [2019-10-13 23:22:10,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:22:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2019-10-13 23:22:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 3262. [2019-10-13 23:22:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-10-13 23:22:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4321 transitions. [2019-10-13 23:22:11,422 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4321 transitions. Word has length 55 [2019-10-13 23:22:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:11,423 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4321 transitions. [2019-10-13 23:22:11,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4321 transitions. [2019-10-13 23:22:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:11,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:11,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:11,427 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash 377850356, now seen corresponding path program 1 times [2019-10-13 23:22:11,428 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:11,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779302667] [2019-10-13 23:22:11,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,428 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:11,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:11,520 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 23:22:11,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779302667] [2019-10-13 23:22:11,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:11,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:11,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433763401] [2019-10-13 23:22:11,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:11,522 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:11,523 INFO L87 Difference]: Start difference. First operand 3262 states and 4321 transitions. Second operand 7 states. [2019-10-13 23:22:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:14,311 INFO L93 Difference]: Finished difference Result 10032 states and 13495 transitions. [2019-10-13 23:22:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:14,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-10-13 23:22:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:14,331 INFO L225 Difference]: With dead ends: 10032 [2019-10-13 23:22:14,331 INFO L226 Difference]: Without dead ends: 9148 [2019-10-13 23:22:14,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:22:14,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9148 states. [2019-10-13 23:22:15,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9148 to 3262. [2019-10-13 23:22:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2019-10-13 23:22:15,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 4321 transitions. [2019-10-13 23:22:15,144 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 4321 transitions. Word has length 56 [2019-10-13 23:22:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:15,144 INFO L462 AbstractCegarLoop]: Abstraction has 3262 states and 4321 transitions. [2019-10-13 23:22:15,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 4321 transitions. [2019-10-13 23:22:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:15,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:15,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:15,148 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:15,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:15,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1917395009, now seen corresponding path program 1 times [2019-10-13 23:22:15,149 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:15,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99940144] [2019-10-13 23:22:15,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,149 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:15,238 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 23:22:15,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99940144] [2019-10-13 23:22:15,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:15,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:15,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852943933] [2019-10-13 23:22:15,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:15,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:15,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:15,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:15,240 INFO L87 Difference]: Start difference. First operand 3262 states and 4321 transitions. Second operand 7 states.