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+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:41,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:41,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:41,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:41,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:41,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:41,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:41,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:41,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:41,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:41,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:41,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:41,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:41,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:41,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:41,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:41,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:41,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:41,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:41,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:41,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:41,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:41,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:41,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:41,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:41,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:41,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:41,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:41,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:42,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:42,000 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:42,001 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:42,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:42,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:42,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:42,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:42,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:42,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:42,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:42,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:42,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:42,015 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:42,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:42,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:42,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:42,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:42,047 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:42,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:42,047 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:42,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:42,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:42,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:42,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:42,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:42,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:42,050 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:42,050 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:42,050 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:42,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:42,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:42,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:42,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:42,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:42,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:42,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:42,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:42,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:42,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:42,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:42,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:42,054 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:42,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:42,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:42,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:42,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:42,416 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:42,417 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+sep-reducer.c [2019-10-13 23:21:42,483 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd937fba4/4923dc4b058944c5addf09a8bbfc43df/FLAG86fb63465 [2019-10-13 23:21:43,256 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:43,257 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+sep-reducer.c [2019-10-13 23:21:43,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd937fba4/4923dc4b058944c5addf09a8bbfc43df/FLAG86fb63465 [2019-10-13 23:21:43,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd937fba4/4923dc4b058944c5addf09a8bbfc43df [2019-10-13 23:21:43,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:43,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:43,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:43,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:43,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:43,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:43" (1/1) ... [2019-10-13 23:21:43,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d070c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:43, skipping insertion in model container [2019-10-13 23:21:43,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:43" (1/1) ... [2019-10-13 23:21:43,372 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:43,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:44,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:44,911 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:45,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:45,268 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:45,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:45 WrapperNode [2019-10-13 23:21:45,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:45,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:45,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:45,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:45,294 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:45" (1/1) ... [2019-10-13 23:21:45,295 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:45" (1/1) ... [2019-10-13 23:21:45,371 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:45" (1/1) ... [2019-10-13 23:21:45,371 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:45" (1/1) ... [2019-10-13 23:21:45,440 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:45" (1/1) ... [2019-10-13 23:21:45,479 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:45" (1/1) ... [2019-10-13 23:21:45,509 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:45" (1/1) ... [2019-10-13 23:21:45,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:45,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:45,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:45,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:45,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:45" (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:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:45,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:45,641 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:45,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:45,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:45,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:49,823 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:49,823 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:49,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:49 BoogieIcfgContainer [2019-10-13 23:21:49,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:49,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:49,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:49,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:49,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:43" (1/3) ... [2019-10-13 23:21:49,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a08ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:49, skipping insertion in model container [2019-10-13 23:21:49,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:45" (2/3) ... [2019-10-13 23:21:49,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a08ed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:49, skipping insertion in model container [2019-10-13 23:21:49,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:49" (3/3) ... [2019-10-13 23:21:49,835 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2019-10-13 23:21:49,845 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:49,856 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 23:21:49,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 23:21:49,901 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:49,902 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:49,902 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:49,902 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:49,902 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:49,902 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:49,903 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:49,903 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states. [2019-10-13 23:21:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:49,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:49,967 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:49,969 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash 733972695, now seen corresponding path program 1 times [2019-10-13 23:21:49,987 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:49,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214046630] [2019-10-13 23:21:49,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:50,669 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,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214046630] [2019-10-13 23:21:50,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:50,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:50,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546805572] [2019-10-13 23:21:50,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:50,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:50,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:50,695 INFO L87 Difference]: Start difference. First operand 1140 states. Second operand 6 states. [2019-10-13 23:21:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:52,481 INFO L93 Difference]: Finished difference Result 2212 states and 3775 transitions. [2019-10-13 23:21:52,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:52,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:21:52,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:52,526 INFO L225 Difference]: With dead ends: 2212 [2019-10-13 23:21:52,526 INFO L226 Difference]: Without dead ends: 1488 [2019-10-13 23:21:52,542 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-10-13 23:21:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1465. [2019-10-13 23:21:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2019-10-13 23:21:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1840 transitions. [2019-10-13 23:21:52,750 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1840 transitions. Word has length 55 [2019-10-13 23:21:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:52,751 INFO L462 AbstractCegarLoop]: Abstraction has 1465 states and 1840 transitions. [2019-10-13 23:21:52,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1840 transitions. [2019-10-13 23:21:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:52,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:52,759 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:52,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2111314929, now seen corresponding path program 1 times [2019-10-13 23:21:52,762 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:52,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794701420] [2019-10-13 23:21:52,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,762 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:53,097 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:53,099 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794701420] [2019-10-13 23:21:53,099 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:53,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:53,099 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021107354] [2019-10-13 23:21:53,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:53,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:53,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:53,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:53,102 INFO L87 Difference]: Start difference. First operand 1465 states and 1840 transitions. Second operand 6 states. [2019-10-13 23:21:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:54,368 INFO L93 Difference]: Finished difference Result 3061 states and 3889 transitions. [2019-10-13 23:21:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:54,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:21:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:54,381 INFO L225 Difference]: With dead ends: 3061 [2019-10-13 23:21:54,381 INFO L226 Difference]: Without dead ends: 2199 [2019-10-13 23:21:54,385 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:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2199 states. [2019-10-13 23:21:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2199 to 2183. [2019-10-13 23:21:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-10-13 23:21:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2764 transitions. [2019-10-13 23:21:54,481 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2764 transitions. Word has length 55 [2019-10-13 23:21:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:54,482 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2764 transitions. [2019-10-13 23:21:54,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2764 transitions. [2019-10-13 23:21:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:21:54,488 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:54,489 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,490 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:54,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1234087864, now seen corresponding path program 1 times [2019-10-13 23:21:54,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:54,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6990063] [2019-10-13 23:21:54,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,699 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,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6990063] [2019-10-13 23:21:54,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:54,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:54,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813278659] [2019-10-13 23:21:54,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:54,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:54,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:54,702 INFO L87 Difference]: Start difference. First operand 2183 states and 2764 transitions. Second operand 5 states. [2019-10-13 23:21:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:55,786 INFO L93 Difference]: Finished difference Result 4401 states and 5595 transitions. [2019-10-13 23:21:55,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:55,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-10-13 23:21:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:55,804 INFO L225 Difference]: With dead ends: 4401 [2019-10-13 23:21:55,804 INFO L226 Difference]: Without dead ends: 3325 [2019-10-13 23:21:55,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2019-10-13 23:21:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3319. [2019-10-13 23:21:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-13 23:21:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4153 transitions. [2019-10-13 23:21:56,000 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4153 transitions. Word has length 55 [2019-10-13 23:21:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:56,001 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4153 transitions. [2019-10-13 23:21:56,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4153 transitions. [2019-10-13 23:21:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:21:56,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:56,005 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, 1] [2019-10-13 23:21:56,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:56,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash -374787316, now seen corresponding path program 1 times [2019-10-13 23:21:56,007 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:56,007 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544804394] [2019-10-13 23:21:56,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,007 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:56,261 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,261 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544804394] [2019-10-13 23:21:56,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:56,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:21:56,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86786098] [2019-10-13 23:21:56,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:21:56,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:21:56,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:56,264 INFO L87 Difference]: Start difference. First operand 3319 states and 4153 transitions. Second operand 8 states. [2019-10-13 23:21:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:58,766 INFO L93 Difference]: Finished difference Result 7454 states and 9846 transitions. [2019-10-13 23:21:58,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:21:58,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-10-13 23:21:58,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:58,798 INFO L225 Difference]: With dead ends: 7454 [2019-10-13 23:21:58,798 INFO L226 Difference]: Without dead ends: 6490 [2019-10-13 23:21:58,802 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:58,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6490 states. [2019-10-13 23:21:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6490 to 3319. [2019-10-13 23:21:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-13 23:21:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4152 transitions. [2019-10-13 23:21:59,034 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4152 transitions. Word has length 57 [2019-10-13 23:21:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:59,035 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4152 transitions. [2019-10-13 23:21:59,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:21:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4152 transitions. [2019-10-13 23:21:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:21:59,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:59,041 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, 1] [2019-10-13 23:21:59,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1908353876, now seen corresponding path program 1 times [2019-10-13 23:21:59,042 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:59,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98685889] [2019-10-13 23:21:59,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:59,406 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:59,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98685889] [2019-10-13 23:21:59,407 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:59,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:59,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2396713] [2019-10-13 23:21:59,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:59,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:59,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:59,411 INFO L87 Difference]: Start difference. First operand 3319 states and 4152 transitions. Second operand 9 states. [2019-10-13 23:22:02,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:02,315 INFO L93 Difference]: Finished difference Result 5403 states and 6945 transitions. [2019-10-13 23:22:02,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:22:02,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 23:22:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:02,343 INFO L225 Difference]: With dead ends: 5403 [2019-10-13 23:22:02,343 INFO L226 Difference]: Without dead ends: 5397 [2019-10-13 23:22:02,345 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2019-10-13 23:22:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 3319. [2019-10-13 23:22:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-13 23:22:02,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4151 transitions. [2019-10-13 23:22:02,591 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4151 transitions. Word has length 57 [2019-10-13 23:22:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:02,595 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4151 transitions. [2019-10-13 23:22:02,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4151 transitions. [2019-10-13 23:22:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:02,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:02,600 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, 1] [2019-10-13 23:22:02,601 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:02,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:02,601 INFO L82 PathProgramCache]: Analyzing trace with hash -171785464, now seen corresponding path program 1 times [2019-10-13 23:22:02,601 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:02,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996981961] [2019-10-13 23:22:02,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,602 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:02,903 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:02,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996981961] [2019-10-13 23:22:02,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:02,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:02,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765369722] [2019-10-13 23:22:02,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:02,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:02,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:02,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:02,907 INFO L87 Difference]: Start difference. First operand 3319 states and 4151 transitions. Second operand 9 states. [2019-10-13 23:22:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,830 INFO L93 Difference]: Finished difference Result 6995 states and 9012 transitions. [2019-10-13 23:22:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:05,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-10-13 23:22:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,870 INFO L225 Difference]: With dead ends: 6995 [2019-10-13 23:22:05,870 INFO L226 Difference]: Without dead ends: 6709 [2019-10-13 23:22:05,874 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-10-13 23:22:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 3319. [2019-10-13 23:22:06,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3319 states. [2019-10-13 23:22:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4150 transitions. [2019-10-13 23:22:06,200 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4150 transitions. Word has length 57 [2019-10-13 23:22:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:06,200 INFO L462 AbstractCegarLoop]: Abstraction has 3319 states and 4150 transitions. [2019-10-13 23:22:06,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:06,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4150 transitions. [2019-10-13 23:22:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:06,214 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:06,214 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, 1, 1] [2019-10-13 23:22:06,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2090309520, now seen corresponding path program 1 times [2019-10-13 23:22:06,216 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:06,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847997655] [2019-10-13 23:22:06,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,216 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:06,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:06,341 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:06,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847997655] [2019-10-13 23:22:06,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:06,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:06,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067560722] [2019-10-13 23:22:06,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:06,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:06,345 INFO L87 Difference]: Start difference. First operand 3319 states and 4150 transitions. Second operand 3 states. [2019-10-13 23:22:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:06,833 INFO L93 Difference]: Finished difference Result 4537 states and 5821 transitions. [2019-10-13 23:22:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:06,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:06,866 INFO L225 Difference]: With dead ends: 4537 [2019-10-13 23:22:06,866 INFO L226 Difference]: Without dead ends: 3436 [2019-10-13 23:22:06,872 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:22:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2019-10-13 23:22:07,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3244. [2019-10-13 23:22:07,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2019-10-13 23:22:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 4047 transitions. [2019-10-13 23:22:07,152 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 4047 transitions. Word has length 58 [2019-10-13 23:22:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:07,154 INFO L462 AbstractCegarLoop]: Abstraction has 3244 states and 4047 transitions. [2019-10-13 23:22:07,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 4047 transitions. [2019-10-13 23:22:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:07,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:07,158 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, 1, 1] [2019-10-13 23:22:07,158 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1502019993, now seen corresponding path program 1 times [2019-10-13 23:22:07,159 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:07,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679114] [2019-10-13 23:22:07,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:07,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:07,269 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:07,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679114] [2019-10-13 23:22:07,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:07,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:07,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299594643] [2019-10-13 23:22:07,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:07,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:07,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:07,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:07,272 INFO L87 Difference]: Start difference. First operand 3244 states and 4047 transitions. Second operand 3 states. [2019-10-13 23:22:07,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:07,863 INFO L93 Difference]: Finished difference Result 4994 states and 6444 transitions. [2019-10-13 23:22:07,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:07,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:07,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:07,873 INFO L225 Difference]: With dead ends: 4994 [2019-10-13 23:22:07,874 INFO L226 Difference]: Without dead ends: 3758 [2019-10-13 23:22:07,878 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:22:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-10-13 23:22:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3472. [2019-10-13 23:22:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3472 states. [2019-10-13 23:22:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4377 transitions. [2019-10-13 23:22:08,202 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4377 transitions. Word has length 58 [2019-10-13 23:22:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:08,202 INFO L462 AbstractCegarLoop]: Abstraction has 3472 states and 4377 transitions. [2019-10-13 23:22:08,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4377 transitions. [2019-10-13 23:22:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:08,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:08,207 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, 1, 1] [2019-10-13 23:22:08,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -272730919, now seen corresponding path program 1 times [2019-10-13 23:22:08,208 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:08,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356331233] [2019-10-13 23:22:08,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,208 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:08,298 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,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356331233] [2019-10-13 23:22:08,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:08,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:08,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689627520] [2019-10-13 23:22:08,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:08,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:08,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:08,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:08,300 INFO L87 Difference]: Start difference. First operand 3472 states and 4377 transitions. Second operand 3 states. [2019-10-13 23:22:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:08,889 INFO L93 Difference]: Finished difference Result 5662 states and 7301 transitions. [2019-10-13 23:22:08,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:08,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:08,898 INFO L225 Difference]: With dead ends: 5662 [2019-10-13 23:22:08,898 INFO L226 Difference]: Without dead ends: 3376 [2019-10-13 23:22:08,904 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:22:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2019-10-13 23:22:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3374. [2019-10-13 23:22:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-10-13 23:22:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4207 transitions. [2019-10-13 23:22:09,314 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4207 transitions. Word has length 58 [2019-10-13 23:22:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:09,315 INFO L462 AbstractCegarLoop]: Abstraction has 3374 states and 4207 transitions. [2019-10-13 23:22:09,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4207 transitions. [2019-10-13 23:22:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:09,318 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:09,319 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, 1, 1, 1] [2019-10-13 23:22:09,319 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -475874997, now seen corresponding path program 1 times [2019-10-13 23:22:09,319 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:09,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162679446] [2019-10-13 23:22:09,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,320 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:09,397 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:09,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162679446] [2019-10-13 23:22:09,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:09,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:09,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402202474] [2019-10-13 23:22:09,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:09,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:09,400 INFO L87 Difference]: Start difference. First operand 3374 states and 4207 transitions. Second operand 3 states. [2019-10-13 23:22:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,074 INFO L93 Difference]: Finished difference Result 5820 states and 7391 transitions. [2019-10-13 23:22:10,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:10,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 23:22:10,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,083 INFO L225 Difference]: With dead ends: 5820 [2019-10-13 23:22:10,083 INFO L226 Difference]: Without dead ends: 3270 [2019-10-13 23:22:10,089 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:22:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2019-10-13 23:22:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2598. [2019-10-13 23:22:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-10-13 23:22:10,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3221 transitions. [2019-10-13 23:22:10,628 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3221 transitions. Word has length 59 [2019-10-13 23:22:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,629 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 3221 transitions. [2019-10-13 23:22:10,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3221 transitions. [2019-10-13 23:22:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:10,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,632 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, 1, 1, 1] [2019-10-13 23:22:10,633 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1742126863, now seen corresponding path program 1 times [2019-10-13 23:22:10,633 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772929960] [2019-10-13 23:22:10,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,725 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:10,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772929960] [2019-10-13 23:22:10,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:10,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927038814] [2019-10-13 23:22:10,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:10,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:10,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:10,727 INFO L87 Difference]: Start difference. First operand 2598 states and 3221 transitions. Second operand 3 states. [2019-10-13 23:22:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:11,530 INFO L93 Difference]: Finished difference Result 5758 states and 7340 transitions. [2019-10-13 23:22:11,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:11,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-10-13 23:22:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:11,542 INFO L225 Difference]: With dead ends: 5758 [2019-10-13 23:22:11,542 INFO L226 Difference]: Without dead ends: 3718 [2019-10-13 23:22:11,550 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:22:11,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3718 states. [2019-10-13 23:22:12,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3718 to 2993. [2019-10-13 23:22:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2993 states. [2019-10-13 23:22:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 3785 transitions. [2019-10-13 23:22:12,015 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 3785 transitions. Word has length 59 [2019-10-13 23:22:12,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:12,015 INFO L462 AbstractCegarLoop]: Abstraction has 2993 states and 3785 transitions. [2019-10-13 23:22:12,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 3785 transitions. [2019-10-13 23:22:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:12,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:12,018 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, 1, 1, 1] [2019-10-13 23:22:12,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:12,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2026503182, now seen corresponding path program 1 times [2019-10-13 23:22:12,019 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:12,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058662163] [2019-10-13 23:22:12,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:12,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat