/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:42:00,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:42:00,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:42:00,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:42:00,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:42:00,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:42:00,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:42:00,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:42:00,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:42:00,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:42:00,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:42:00,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:42:00,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:42:00,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:42:00,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:42:00,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:42:00,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:42:00,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:42:00,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:42:00,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:42:00,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:42:00,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:42:00,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:42:00,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:42:00,692 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:42:00,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:42:00,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:42:00,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:42:00,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:42:00,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:42:00,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:42:00,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:42:00,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:42:00,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:42:00,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:42:00,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:42:00,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:42:00,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:42:00,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:42:00,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:42:00,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:42:00,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 04:42:00,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:42:00,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:42:00,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:42:00,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:42:00,721 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:42:00,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:42:00,722 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:42:00,722 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:42:00,722 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:42:00,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:42:00,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:42:00,723 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:42:00,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:42:00,723 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:42:00,723 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:42:00,723 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:42:00,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:42:00,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:42:00,724 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:42:00,724 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:42:00,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:42:00,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:00,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:42:00,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:42:00,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:42:00,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:42:00,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:42:00,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:42:00,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 04:42:01,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:42:01,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:42:01,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:42:01,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:42:01,078 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:42:01,079 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.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:01,154 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb883c31d/d72e74539091483abdef1591566392e4/FLAGf92992f5e [2019-11-07 04:42:01,996 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:42:01,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:02,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb883c31d/d72e74539091483abdef1591566392e4/FLAGf92992f5e [2019-11-07 04:42:02,090 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb883c31d/d72e74539091483abdef1591566392e4 [2019-11-07 04:42:02,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:42:02,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:42:02,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:02,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:42:02,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:42:02,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:02" (1/1) ... [2019-11-07 04:42:02,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0f1a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:02, skipping insertion in model container [2019-11-07 04:42:02,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:02" (1/1) ... [2019-11-07 04:42:02,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:42:02,259 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:42:03,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:03,257 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:42:03,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:03,610 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:42:03,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03 WrapperNode [2019-11-07 04:42:03,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:03,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:42:03,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:42:03,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:42:03,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,820 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... [2019-11-07 04:42:03,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:42:03,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:42:03,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:42:03,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:42:03,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:03,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:42:03,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:42:03,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:42:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:42:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:42:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:42:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:42:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:42:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:42:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:42:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:42:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:42:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:42:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:42:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:42:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:42:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:42:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:42:03,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:08,059 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:08,060 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:08,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:08 BoogieIcfgContainer [2019-11-07 04:42:08,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:08,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:08,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:08,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:08,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:02" (1/3) ... [2019-11-07 04:42:08,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee31aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:08, skipping insertion in model container [2019-11-07 04:42:08,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:03" (2/3) ... [2019-11-07 04:42:08,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee31aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:08, skipping insertion in model container [2019-11-07 04:42:08,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:08" (3/3) ... [2019-11-07 04:42:08,078 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-07 04:42:08,093 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:08,103 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-07 04:42:08,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-07 04:42:08,165 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:08,165 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:08,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:08,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:08,166 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:08,166 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:08,166 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:08,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states. [2019-11-07 04:42:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:08,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:08,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1351038029, now seen corresponding path program 1 times [2019-11-07 04:42:08,283 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823587] [2019-11-07 04:42:08,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:08,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823587] [2019-11-07 04:42:08,880 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:08,881 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:08,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27107658] [2019-11-07 04:42:08,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:08,891 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:08,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:08,914 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand 6 states. [2019-11-07 04:42:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:10,588 INFO L93 Difference]: Finished difference Result 1893 states and 3327 transitions. [2019-11-07 04:42:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:10,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-07 04:42:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:10,614 INFO L225 Difference]: With dead ends: 1893 [2019-11-07 04:42:10,614 INFO L226 Difference]: Without dead ends: 1259 [2019-11-07 04:42:10,623 INFO L630 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-11-07 04:42:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-11-07 04:42:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1243. [2019-11-07 04:42:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-11-07 04:42:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1619 transitions. [2019-11-07 04:42:10,748 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1619 transitions. Word has length 54 [2019-11-07 04:42:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:10,749 INFO L462 AbstractCegarLoop]: Abstraction has 1243 states and 1619 transitions. [2019-11-07 04:42:10,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1619 transitions. [2019-11-07 04:42:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:10,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:10,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:10,754 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:10,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:10,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1856787906, now seen corresponding path program 1 times [2019-11-07 04:42:10,755 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:10,755 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909715982] [2019-11-07 04:42:10,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:10,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909715982] [2019-11-07 04:42:10,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:10,942 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:10,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121336038] [2019-11-07 04:42:10,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:10,945 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:10,945 INFO L87 Difference]: Start difference. First operand 1243 states and 1619 transitions. Second operand 6 states. [2019-11-07 04:42:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:12,334 INFO L93 Difference]: Finished difference Result 2807 states and 3684 transitions. [2019-11-07 04:42:12,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:12,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-11-07 04:42:12,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:12,346 INFO L225 Difference]: With dead ends: 2807 [2019-11-07 04:42:12,347 INFO L226 Difference]: Without dead ends: 1946 [2019-11-07 04:42:12,350 INFO L630 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-11-07 04:42:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-11-07 04:42:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1926. [2019-11-07 04:42:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-11-07 04:42:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2520 transitions. [2019-11-07 04:42:12,435 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2520 transitions. Word has length 54 [2019-11-07 04:42:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:12,436 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2520 transitions. [2019-11-07 04:42:12,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2520 transitions. [2019-11-07 04:42:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-07 04:42:12,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:12,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:12,440 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -333312361, now seen corresponding path program 1 times [2019-11-07 04:42:12,441 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:12,441 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868404524] [2019-11-07 04:42:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:12,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868404524] [2019-11-07 04:42:12,595 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:12,595 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:12,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146075303] [2019-11-07 04:42:12,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:12,596 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:12,598 INFO L87 Difference]: Start difference. First operand 1926 states and 2520 transitions. Second operand 5 states. [2019-11-07 04:42:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:13,745 INFO L93 Difference]: Finished difference Result 3860 states and 5085 transitions. [2019-11-07 04:42:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:13,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-07 04:42:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:13,767 INFO L225 Difference]: With dead ends: 3860 [2019-11-07 04:42:13,768 INFO L226 Difference]: Without dead ends: 2906 [2019-11-07 04:42:13,772 INFO L630 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-11-07 04:42:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2019-11-07 04:42:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2900. [2019-11-07 04:42:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-11-07 04:42:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3760 transitions. [2019-11-07 04:42:13,958 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3760 transitions. Word has length 54 [2019-11-07 04:42:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:13,959 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3760 transitions. [2019-11-07 04:42:13,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3760 transitions. [2019-11-07 04:42:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:13,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:13,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:13,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:13,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:13,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1049417886, now seen corresponding path program 1 times [2019-11-07 04:42:13,967 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:13,967 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093500105] [2019-11-07 04:42:13,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:14,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093500105] [2019-11-07 04:42:14,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:14,242 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:14,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154772248] [2019-11-07 04:42:14,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:14,243 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:14,245 INFO L87 Difference]: Start difference. First operand 2900 states and 3760 transitions. Second operand 9 states. [2019-11-07 04:42:15,211 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 20 [2019-11-07 04:42:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:17,631 INFO L93 Difference]: Finished difference Result 4761 states and 6326 transitions. [2019-11-07 04:42:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-07 04:42:17,632 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 04:42:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:17,658 INFO L225 Difference]: With dead ends: 4761 [2019-11-07 04:42:17,658 INFO L226 Difference]: Without dead ends: 4756 [2019-11-07 04:42:17,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:42:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-11-07 04:42:17,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2900. [2019-11-07 04:42:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-11-07 04:42:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3759 transitions. [2019-11-07 04:42:17,952 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3759 transitions. Word has length 55 [2019-11-07 04:42:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:17,954 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3759 transitions. [2019-11-07 04:42:17,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3759 transitions. [2019-11-07 04:42:17,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:17,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:17,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:17,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:17,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash -757116331, now seen corresponding path program 1 times [2019-11-07 04:42:17,961 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:17,961 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654886860] [2019-11-07 04:42:17,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:18,212 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654886860] [2019-11-07 04:42:18,213 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:18,213 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-07 04:42:18,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79369215] [2019-11-07 04:42:18,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 04:42:18,214 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:18,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 04:42:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:42:18,215 INFO L87 Difference]: Start difference. First operand 2900 states and 3759 transitions. Second operand 9 states. [2019-11-07 04:42:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:21,160 INFO L93 Difference]: Finished difference Result 6167 states and 8224 transitions. [2019-11-07 04:42:21,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-07 04:42:21,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-07 04:42:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:21,198 INFO L225 Difference]: With dead ends: 6167 [2019-11-07 04:42:21,198 INFO L226 Difference]: Without dead ends: 5918 [2019-11-07 04:42:21,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-07 04:42:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2019-11-07 04:42:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 2900. [2019-11-07 04:42:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-11-07 04:42:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3758 transitions. [2019-11-07 04:42:21,508 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3758 transitions. Word has length 55 [2019-11-07 04:42:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:21,512 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3758 transitions. [2019-11-07 04:42:21,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 04:42:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3758 transitions. [2019-11-07 04:42:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:21,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:21,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:21,518 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:21,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:21,518 INFO L82 PathProgramCache]: Analyzing trace with hash 2078575284, now seen corresponding path program 1 times [2019-11-07 04:42:21,518 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:21,519 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736898268] [2019-11-07 04:42:21,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:21,743 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736898268] [2019-11-07 04:42:21,744 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:21,744 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 04:42:21,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712690356] [2019-11-07 04:42:21,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:42:21,745 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:42:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-07 04:42:21,746 INFO L87 Difference]: Start difference. First operand 2900 states and 3758 transitions. Second operand 8 states. [2019-11-07 04:42:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:23,983 INFO L93 Difference]: Finished difference Result 6530 states and 8937 transitions. [2019-11-07 04:42:23,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:23,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-07 04:42:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:24,009 INFO L225 Difference]: With dead ends: 6530 [2019-11-07 04:42:24,009 INFO L226 Difference]: Without dead ends: 5690 [2019-11-07 04:42:24,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:42:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2019-11-07 04:42:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 2900. [2019-11-07 04:42:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-11-07 04:42:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3757 transitions. [2019-11-07 04:42:24,248 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3757 transitions. Word has length 55 [2019-11-07 04:42:24,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:24,248 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3757 transitions. [2019-11-07 04:42:24,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:42:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3757 transitions. [2019-11-07 04:42:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:24,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:24,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:24,253 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash -146447767, now seen corresponding path program 1 times [2019-11-07 04:42:24,254 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:24,254 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072270053] [2019-11-07 04:42:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:24,332 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072270053] [2019-11-07 04:42:24,333 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:24,333 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:24,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783483609] [2019-11-07 04:42:24,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:24,334 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:24,335 INFO L87 Difference]: Start difference. First operand 2900 states and 3757 transitions. Second operand 3 states. [2019-11-07 04:42:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:24,634 INFO L93 Difference]: Finished difference Result 4060 states and 5396 transitions. [2019-11-07 04:42:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:24,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 04:42:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:24,652 INFO L225 Difference]: With dead ends: 4060 [2019-11-07 04:42:24,652 INFO L226 Difference]: Without dead ends: 3013 [2019-11-07 04:42:24,656 INFO L630 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-11-07 04:42:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2019-11-07 04:42:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2845. [2019-11-07 04:42:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-11-07 04:42:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3674 transitions. [2019-11-07 04:42:24,905 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3674 transitions. Word has length 56 [2019-11-07 04:42:24,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:24,906 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 3674 transitions. [2019-11-07 04:42:24,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3674 transitions. [2019-11-07 04:42:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:24,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:24,910 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:24,910 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:24,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -384770931, now seen corresponding path program 1 times [2019-11-07 04:42:24,911 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:24,911 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523341515] [2019-11-07 04:42:24,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:25,017 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523341515] [2019-11-07 04:42:25,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:25,017 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:25,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888582108] [2019-11-07 04:42:25,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:25,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:25,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:25,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:25,019 INFO L87 Difference]: Start difference. First operand 2845 states and 3674 transitions. Second operand 3 states. [2019-11-07 04:42:25,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:25,408 INFO L93 Difference]: Finished difference Result 4346 states and 5822 transitions. [2019-11-07 04:42:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:25,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 04:42:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:25,437 INFO L225 Difference]: With dead ends: 4346 [2019-11-07 04:42:25,438 INFO L226 Difference]: Without dead ends: 3289 [2019-11-07 04:42:25,442 INFO L630 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-11-07 04:42:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-11-07 04:42:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3043. [2019-11-07 04:42:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-11-07 04:42:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3976 transitions. [2019-11-07 04:42:25,735 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3976 transitions. Word has length 56 [2019-11-07 04:42:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:25,736 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 3976 transitions. [2019-11-07 04:42:25,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3976 transitions. [2019-11-07 04:42:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-07 04:42:25,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:25,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:25,740 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:25,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1124901437, now seen corresponding path program 1 times [2019-11-07 04:42:25,741 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:25,741 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909116230] [2019-11-07 04:42:25,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:25,815 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909116230] [2019-11-07 04:42:25,815 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:25,815 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:25,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028376616] [2019-11-07 04:42:25,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:25,816 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:25,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:25,817 INFO L87 Difference]: Start difference. First operand 3043 states and 3976 transitions. Second operand 3 states. [2019-11-07 04:42:26,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:26,160 INFO L93 Difference]: Finished difference Result 4905 states and 6564 transitions. [2019-11-07 04:42:26,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:26,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-07 04:42:26,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:26,167 INFO L225 Difference]: With dead ends: 4905 [2019-11-07 04:42:26,168 INFO L226 Difference]: Without dead ends: 2925 [2019-11-07 04:42:26,173 INFO L630 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-11-07 04:42:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-11-07 04:42:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2923. [2019-11-07 04:42:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-11-07 04:42:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3768 transitions. [2019-11-07 04:42:26,530 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3768 transitions. Word has length 56 [2019-11-07 04:42:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:26,531 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 3768 transitions. [2019-11-07 04:42:26,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3768 transitions. [2019-11-07 04:42:26,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:26,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:26,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:26,535 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash 56463115, now seen corresponding path program 1 times [2019-11-07 04:42:26,535 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:26,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23448896] [2019-11-07 04:42:26,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:26,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23448896] [2019-11-07 04:42:26,598 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:26,598 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:26,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247089092] [2019-11-07 04:42:26,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:26,599 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:26,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:26,600 INFO L87 Difference]: Start difference. First operand 2923 states and 3768 transitions. Second operand 3 states. [2019-11-07 04:42:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:27,234 INFO L93 Difference]: Finished difference Result 5048 states and 6640 transitions. [2019-11-07 04:42:27,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:27,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:27,242 INFO L225 Difference]: With dead ends: 5048 [2019-11-07 04:42:27,242 INFO L226 Difference]: Without dead ends: 2820 [2019-11-07 04:42:27,248 INFO L630 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-11-07 04:42:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-11-07 04:42:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2240. [2019-11-07 04:42:27,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-11-07 04:42:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2866 transitions. [2019-11-07 04:42:27,555 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2866 transitions. Word has length 57 [2019-11-07 04:42:27,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:27,556 INFO L462 AbstractCegarLoop]: Abstraction has 2240 states and 2866 transitions. [2019-11-07 04:42:27,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2866 transitions. [2019-11-07 04:42:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-07 04:42:27,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:27,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:27,567 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1071477093, now seen corresponding path program 1 times [2019-11-07 04:42:27,568 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:27,568 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53323225] [2019-11-07 04:42:27,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:27,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53323225] [2019-11-07 04:42:27,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:27,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:27,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634790453] [2019-11-07 04:42:27,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:27,643 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:27,643 INFO L87 Difference]: Start difference. First operand 2240 states and 2866 transitions. Second operand 3 states. [2019-11-07 04:42:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:28,289 INFO L93 Difference]: Finished difference Result 4951 states and 6544 transitions. [2019-11-07 04:42:28,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:28,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-07 04:42:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:28,296 INFO L225 Difference]: With dead ends: 4951 [2019-11-07 04:42:28,296 INFO L226 Difference]: Without dead ends: 3189 [2019-11-07 04:42:28,301 INFO L630 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-11-07 04:42:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-07 04:42:28,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2569. [2019-11-07 04:42:28,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-11-07 04:42:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3365 transitions. [2019-11-07 04:42:28,608 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3365 transitions. Word has length 57 [2019-11-07 04:42:28,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:28,608 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 3365 transitions. [2019-11-07 04:42:28,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3365 transitions. [2019-11-07 04:42:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:28,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:28,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:28,611 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:28,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1030838178, now seen corresponding path program 1 times [2019-11-07 04:42:28,612 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:28,612 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136074689] [2019-11-07 04:42:28,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:29,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:29,372 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136074689] [2019-11-07 04:42:29,372 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:29,373 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-07 04:42:29,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749516035] [2019-11-07 04:42:29,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-07 04:42:29,373 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:29,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-07 04:42:29,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-07 04:42:29,374 INFO L87 Difference]: Start difference. First operand 2569 states and 3365 transitions. Second operand 19 states. [2019-11-07 04:42:29,619 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-11-07 04:42:30,676 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-07 04:42:30,951 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-07 04:42:31,136 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48