/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+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:57,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:57,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:57,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:57,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:57,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:57,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:57,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:57,817 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:57,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:57,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:57,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:57,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:57,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:57,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:57,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:57,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:57,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:57,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:57,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:57,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:57,847 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:57,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:57,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:57,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:57,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:57,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:57,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:57,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:57,858 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:57,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:57,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:57,861 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:57,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:57,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:57,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:57,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:57,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:57,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:57,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:57,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:57,867 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:41:57,893 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:57,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:57,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:57,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:57,895 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:57,895 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:57,896 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:57,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:57,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:57,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:57,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:57,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:57,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:57,898 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:57,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:57,898 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:57,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:57,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:57,899 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:57,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:57,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:57,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:57,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:57,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:57,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:57,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:57,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:57,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:57,902 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:41:58,178 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:58,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:58,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:58,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:58,197 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:58,197 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+nlh-reducer.c [2019-11-07 04:41:58,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6259a89e/5b97b993f66e451ca515e3aa9cc76345/FLAG575340448 [2019-11-07 04:41:58,742 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:58,745 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+nlh-reducer.c [2019-11-07 04:41:58,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6259a89e/5b97b993f66e451ca515e3aa9cc76345/FLAG575340448 [2019-11-07 04:41:59,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6259a89e/5b97b993f66e451ca515e3aa9cc76345 [2019-11-07 04:41:59,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:59,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:59,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:59,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:59,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:59,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2ebb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59, skipping insertion in model container [2019-11-07 04:41:59,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,142 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:59,225 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:59,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:59,530 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:59,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:59,759 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:59,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59 WrapperNode [2019-11-07 04:41:59,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:59,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:59,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:59,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:59,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (1/1) ... [2019-11-07 04:41:59,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:59,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:59,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:59,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:59,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (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:41:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:59,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:59,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:59,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:01,075 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:01,076 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:01,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:01 BoogieIcfgContainer [2019-11-07 04:42:01,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:01,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:01,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:01,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:01,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:59" (1/3) ... [2019-11-07 04:42:01,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40025a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:01, skipping insertion in model container [2019-11-07 04:42:01,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:59" (2/3) ... [2019-11-07 04:42:01,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40025a22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:01, skipping insertion in model container [2019-11-07 04:42:01,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:01" (3/3) ... [2019-11-07 04:42:01,088 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-11-07 04:42:01,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:01,110 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:42:01,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:42:01,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:01,158 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:01,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:01,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:01,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:01,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:01,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:01,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-07 04:42:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 04:42:01,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:01,209 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] [2019-11-07 04:42:01,211 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:01,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash -787153264, now seen corresponding path program 1 times [2019-11-07 04:42:01,228 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:01,228 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396678561] [2019-11-07 04:42:01,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:01,843 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:01,843 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396678561] [2019-11-07 04:42:01,844 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:01,845 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:01,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396679350] [2019-11-07 04:42:01,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:01,852 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:01,868 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 5 states. [2019-11-07 04:42:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:02,139 INFO L93 Difference]: Finished difference Result 292 states and 460 transitions. [2019-11-07 04:42:02,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:02,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-07 04:42:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:02,158 INFO L225 Difference]: With dead ends: 292 [2019-11-07 04:42:02,158 INFO L226 Difference]: Without dead ends: 212 [2019-11-07 04:42:02,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-07 04:42:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-11-07 04:42:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-07 04:42:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2019-11-07 04:42:02,237 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 45 [2019-11-07 04:42:02,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:02,238 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2019-11-07 04:42:02,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:02,238 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2019-11-07 04:42:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 04:42:02,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:02,241 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] [2019-11-07 04:42:02,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:02,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 422949447, now seen corresponding path program 1 times [2019-11-07 04:42:02,242 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:02,242 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592098544] [2019-11-07 04:42:02,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:02,366 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:02,367 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592098544] [2019-11-07 04:42:02,367 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:02,368 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:02,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864595930] [2019-11-07 04:42:02,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:02,370 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:02,371 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand 6 states. [2019-11-07 04:42:02,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:02,565 INFO L93 Difference]: Finished difference Result 347 states and 464 transitions. [2019-11-07 04:42:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:02,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-07 04:42:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:02,568 INFO L225 Difference]: With dead ends: 347 [2019-11-07 04:42:02,568 INFO L226 Difference]: Without dead ends: 208 [2019-11-07 04:42:02,570 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:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-07 04:42:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-11-07 04:42:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-07 04:42:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2019-11-07 04:42:02,593 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 46 [2019-11-07 04:42:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:02,593 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2019-11-07 04:42:02,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2019-11-07 04:42:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-07 04:42:02,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:02,596 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] [2019-11-07 04:42:02,596 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -752893704, now seen corresponding path program 1 times [2019-11-07 04:42:02,597 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:02,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072147270] [2019-11-07 04:42:02,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:02,704 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:02,705 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072147270] [2019-11-07 04:42:02,705 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:02,705 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:02,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809555432] [2019-11-07 04:42:02,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:02,707 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:02,708 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand 6 states. [2019-11-07 04:42:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:02,840 INFO L93 Difference]: Finished difference Result 372 states and 478 transitions. [2019-11-07 04:42:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:02,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-07 04:42:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:02,843 INFO L225 Difference]: With dead ends: 372 [2019-11-07 04:42:02,843 INFO L226 Difference]: Without dead ends: 208 [2019-11-07 04:42:02,844 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:02,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-07 04:42:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-11-07 04:42:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-07 04:42:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2019-11-07 04:42:02,864 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 46 [2019-11-07 04:42:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:02,865 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2019-11-07 04:42:02,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2019-11-07 04:42:02,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:42:02,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:02,867 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] [2019-11-07 04:42:02,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751131, now seen corresponding path program 1 times [2019-11-07 04:42:02,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:02,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327835834] [2019-11-07 04:42:02,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:03,080 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:03,080 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327835834] [2019-11-07 04:42:03,080 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:03,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:03,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477512424] [2019-11-07 04:42:03,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:03,081 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:03,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:03,082 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand 10 states. [2019-11-07 04:42:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:03,894 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-11-07 04:42:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:42:03,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-07 04:42:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:03,897 INFO L225 Difference]: With dead ends: 405 [2019-11-07 04:42:03,898 INFO L226 Difference]: Without dead ends: 380 [2019-11-07 04:42:03,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-11-07 04:42:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-07 04:42:03,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 288. [2019-11-07 04:42:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-07 04:42:03,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 356 transitions. [2019-11-07 04:42:03,929 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 356 transitions. Word has length 47 [2019-11-07 04:42:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:03,929 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 356 transitions. [2019-11-07 04:42:03,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 356 transitions. [2019-11-07 04:42:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:42:03,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:03,932 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] [2019-11-07 04:42:03,932 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1608472133, now seen corresponding path program 1 times [2019-11-07 04:42:03,933 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:03,933 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126897934] [2019-11-07 04:42:03,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:04,131 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:04,131 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126897934] [2019-11-07 04:42:04,132 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:04,132 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:04,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019940215] [2019-11-07 04:42:04,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:04,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:04,134 INFO L87 Difference]: Start difference. First operand 288 states and 356 transitions. Second operand 10 states. [2019-11-07 04:42:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:04,649 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2019-11-07 04:42:04,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 04:42:04,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-07 04:42:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:04,653 INFO L225 Difference]: With dead ends: 498 [2019-11-07 04:42:04,653 INFO L226 Difference]: Without dead ends: 444 [2019-11-07 04:42:04,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-11-07 04:42:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-11-07 04:42:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 350. [2019-11-07 04:42:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-07 04:42:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 434 transitions. [2019-11-07 04:42:04,686 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 434 transitions. Word has length 47 [2019-11-07 04:42:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:04,687 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 434 transitions. [2019-11-07 04:42:04,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 434 transitions. [2019-11-07 04:42:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-07 04:42:04,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:04,689 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] [2019-11-07 04:42:04,689 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:04,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1711689862, now seen corresponding path program 1 times [2019-11-07 04:42:04,690 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:04,690 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290242245] [2019-11-07 04:42:04,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:04,747 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:04,747 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290242245] [2019-11-07 04:42:04,747 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:04,748 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:04,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304851167] [2019-11-07 04:42:04,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:04,748 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:04,749 INFO L87 Difference]: Start difference. First operand 350 states and 434 transitions. Second operand 5 states. [2019-11-07 04:42:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:04,888 INFO L93 Difference]: Finished difference Result 478 states and 602 transitions. [2019-11-07 04:42:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:04,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-11-07 04:42:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:04,891 INFO L225 Difference]: With dead ends: 478 [2019-11-07 04:42:04,892 INFO L226 Difference]: Without dead ends: 350 [2019-11-07 04:42:04,892 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:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-07 04:42:04,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-11-07 04:42:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-07 04:42:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2019-11-07 04:42:04,926 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 47 [2019-11-07 04:42:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:04,927 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2019-11-07 04:42:04,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:04,927 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2019-11-07 04:42:04,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-07 04:42:04,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:04,928 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] [2019-11-07 04:42:04,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:04,929 INFO L82 PathProgramCache]: Analyzing trace with hash 829937832, now seen corresponding path program 1 times [2019-11-07 04:42:04,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:04,930 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362648485] [2019-11-07 04:42:04,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:05,170 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:05,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362648485] [2019-11-07 04:42:05,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:05,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 04:42:05,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270478615] [2019-11-07 04:42:05,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 04:42:05,173 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:05,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 04:42:05,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:42:05,173 INFO L87 Difference]: Start difference. First operand 350 states and 433 transitions. Second operand 10 states. [2019-11-07 04:42:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:05,848 INFO L93 Difference]: Finished difference Result 903 states and 1180 transitions. [2019-11-07 04:42:05,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-07 04:42:05,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-11-07 04:42:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:05,852 INFO L225 Difference]: With dead ends: 903 [2019-11-07 04:42:05,852 INFO L226 Difference]: Without dead ends: 815 [2019-11-07 04:42:05,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-11-07 04:42:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-11-07 04:42:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 596. [2019-11-07 04:42:05,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-07 04:42:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 760 transitions. [2019-11-07 04:42:05,928 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 760 transitions. Word has length 48 [2019-11-07 04:42:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:05,929 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 760 transitions. [2019-11-07 04:42:05,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 04:42:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 760 transitions. [2019-11-07 04:42:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-07 04:42:05,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:05,930 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] [2019-11-07 04:42:05,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1176215270, now seen corresponding path program 1 times [2019-11-07 04:42:05,931 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:05,931 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686961454] [2019-11-07 04:42:05,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:06,154 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:06,154 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686961454] [2019-11-07 04:42:06,154 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:06,154 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:42:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633738130] [2019-11-07 04:42:06,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:42:06,155 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:06,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:42:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:42:06,156 INFO L87 Difference]: Start difference. First operand 596 states and 760 transitions. Second operand 12 states. [2019-11-07 04:42:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:06,672 INFO L93 Difference]: Finished difference Result 1305 states and 1689 transitions. [2019-11-07 04:42:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:42:06,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-11-07 04:42:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:06,679 INFO L225 Difference]: With dead ends: 1305 [2019-11-07 04:42:06,679 INFO L226 Difference]: Without dead ends: 1253 [2019-11-07 04:42:06,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-11-07 04:42:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-11-07 04:42:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 605. [2019-11-07 04:42:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-07 04:42:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 768 transitions. [2019-11-07 04:42:06,768 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 768 transitions. Word has length 49 [2019-11-07 04:42:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:06,768 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 768 transitions. [2019-11-07 04:42:06,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:42:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 768 transitions. [2019-11-07 04:42:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:42:06,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:06,770 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] [2019-11-07 04:42:06,770 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:06,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:06,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1324463465, now seen corresponding path program 1 times [2019-11-07 04:42:06,771 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:06,771 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607780912] [2019-11-07 04:42:06,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:06,851 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:06,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607780912] [2019-11-07 04:42:06,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:06,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:06,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618975498] [2019-11-07 04:42:06,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:06,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:06,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:06,853 INFO L87 Difference]: Start difference. First operand 605 states and 768 transitions. Second operand 3 states. [2019-11-07 04:42:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:06,980 INFO L93 Difference]: Finished difference Result 1285 states and 1682 transitions. [2019-11-07 04:42:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:06,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-07 04:42:06,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:06,985 INFO L225 Difference]: With dead ends: 1285 [2019-11-07 04:42:06,986 INFO L226 Difference]: Without dead ends: 888 [2019-11-07 04:42:06,987 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:06,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-11-07 04:42:07,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 797. [2019-11-07 04:42:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-07 04:42:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1031 transitions. [2019-11-07 04:42:07,080 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1031 transitions. Word has length 50 [2019-11-07 04:42:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:07,081 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1031 transitions. [2019-11-07 04:42:07,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1031 transitions. [2019-11-07 04:42:07,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:42:07,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:07,082 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] [2019-11-07 04:42:07,082 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2023369027, now seen corresponding path program 1 times [2019-11-07 04:42:07,083 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:07,083 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100050639] [2019-11-07 04:42:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:07,352 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:07,352 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100050639] [2019-11-07 04:42:07,353 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:07,353 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:42:07,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001518290] [2019-11-07 04:42:07,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:42:07,355 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:42:07,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:42:07,356 INFO L87 Difference]: Start difference. First operand 797 states and 1031 transitions. Second operand 12 states. [2019-11-07 04:42:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:08,277 INFO L93 Difference]: Finished difference Result 1504 states and 1974 transitions. [2019-11-07 04:42:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-07 04:42:08,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-07 04:42:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:08,286 INFO L225 Difference]: With dead ends: 1504 [2019-11-07 04:42:08,288 INFO L226 Difference]: Without dead ends: 1361 [2019-11-07 04:42:08,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-11-07 04:42:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-07 04:42:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 809. [2019-11-07 04:42:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-11-07 04:42:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1043 transitions. [2019-11-07 04:42:08,386 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1043 transitions. Word has length 50 [2019-11-07 04:42:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:08,387 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 1043 transitions. [2019-11-07 04:42:08,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:42:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1043 transitions. [2019-11-07 04:42:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:42:08,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:08,388 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] [2019-11-07 04:42:08,388 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 854854237, now seen corresponding path program 1 times [2019-11-07 04:42:08,389 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:08,389 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015996563] [2019-11-07 04:42:08,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:08,583 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,583 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015996563] [2019-11-07 04:42:08,583 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:08,583 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 04:42:08,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495259007] [2019-11-07 04:42:08,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 04:42:08,584 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:08,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 04:42:08,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-07 04:42:08,584 INFO L87 Difference]: Start difference. First operand 809 states and 1043 transitions. Second operand 12 states. [2019-11-07 04:42:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:09,472 INFO L93 Difference]: Finished difference Result 2400 states and 3190 transitions. [2019-11-07 04:42:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-07 04:42:09,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-11-07 04:42:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:09,484 INFO L225 Difference]: With dead ends: 2400 [2019-11-07 04:42:09,485 INFO L226 Difference]: Without dead ends: 1894 [2019-11-07 04:42:09,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-11-07 04:42:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-11-07 04:42:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1333. [2019-11-07 04:42:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-11-07 04:42:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1749 transitions. [2019-11-07 04:42:09,632 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1749 transitions. Word has length 50 [2019-11-07 04:42:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:09,632 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1749 transitions. [2019-11-07 04:42:09,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 04:42:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1749 transitions. [2019-11-07 04:42:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:42:09,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:09,634 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] [2019-11-07 04:42:09,634 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash -533267837, now seen corresponding path program 1 times [2019-11-07 04:42:09,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:09,635 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409086300] [2019-11-07 04:42:09,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:09,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-11-07 04:42:09,670 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409086300] [2019-11-07 04:42:09,670 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:09,670 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:09,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137453682] [2019-11-07 04:42:09,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:09,671 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:09,672 INFO L87 Difference]: Start difference. First operand 1333 states and 1749 transitions. Second operand 3 states. [2019-11-07 04:42:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:09,899 INFO L93 Difference]: Finished difference Result 3106 states and 4159 transitions. [2019-11-07 04:42:09,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:09,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-07 04:42:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:09,909 INFO L225 Difference]: With dead ends: 3106 [2019-11-07 04:42:09,909 INFO L226 Difference]: Without dead ends: 2011 [2019-11-07 04:42:09,912 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:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-11-07 04:42:10,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2007. [2019-11-07 04:42:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-11-07 04:42:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2669 transitions. [2019-11-07 04:42:10,111 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2669 transitions. Word has length 51 [2019-11-07 04:42:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:10,111 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 2669 transitions. [2019-11-07 04:42:10,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2669 transitions. [2019-11-07 04:42:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-07 04:42:10,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:10,113 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] [2019-11-07 04:42:10,113 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash 446459698, now seen corresponding path program 1 times [2019-11-07 04:42:10,113 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:10,114 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238830862] [2019-11-07 04:42:10,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:10,722 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-11-07 04:42:11,515 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-07 04:42:11,676 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-11-07 04:42:11,835 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-11-07 04:42:12,003 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-07 04:42:12,195 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-07 04:42:12,365 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-11-07 04:42:12,520 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-11-07 04:42:12,789 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-07 04:42:12,961 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-07 04:42:13,375 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:13,376 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238830862] [2019-11-07 04:42:13,376 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:13,376 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-07 04:42:13,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096357269] [2019-11-07 04:42:13,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-07 04:42:13,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-07 04:42:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-11-07 04:42:13,378 INFO L87 Difference]: Start difference. First operand 2007 states and 2669 transitions. Second operand 26 states. [2019-11-07 04:42:13,570 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-07 04:42:14,116 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-07 04:42:14,285 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-07 04:42:14,475 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-11-07 04:42:14,739 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-11-07 04:42:14,988 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-11-07 04:42:15,298 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-07 04:42:15,730 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-11-07 04:42:16,181 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-11-07 04:42:16,663 WARN L191 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-11-07 04:42:17,204 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-11-07 04:42:17,880 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-11-07 04:42:18,615 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 127 [2019-11-07 04:42:19,312 WARN L191 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 135 [2019-11-07 04:42:19,770 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-11-07 04:42:20,509 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-07 04:42:22,264 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-11-07 04:42:22,914 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-07 04:42:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:24,086 INFO L93 Difference]: Finished difference Result 5645 states and 7571 transitions. [2019-11-07 04:42:24,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 04:42:24,086 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-11-07 04:42:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:24,111 INFO L225 Difference]: With dead ends: 5645 [2019-11-07 04:42:24,111 INFO L226 Difference]: Without dead ends: 5373 [2019-11-07 04:42:24,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=599, Invalid=1753, Unknown=0, NotChecked=0, Total=2352 [2019-11-07 04:42:24,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2019-11-07 04:42:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 1995. [2019-11-07 04:42:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-11-07 04:42:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2656 transitions. [2019-11-07 04:42:24,466 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2656 transitions. Word has length 52 [2019-11-07 04:42:24,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:24,467 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2656 transitions. [2019-11-07 04:42:24,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-07 04:42:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2656 transitions. [2019-11-07 04:42:24,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-07 04:42:24,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:24,468 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:24,468 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:24,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1542380715, now seen corresponding path program 1 times [2019-11-07 04:42:24,469 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:24,469 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53717254] [2019-11-07 04:42:24,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:24,526 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,527 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53717254] [2019-11-07 04:42:24,527 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:24,527 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:24,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132380560] [2019-11-07 04:42:24,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:24,528 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:24,528 INFO L87 Difference]: Start difference. First operand 1995 states and 2656 transitions. Second operand 3 states. [2019-11-07 04:42:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:25,071 INFO L93 Difference]: Finished difference Result 3998 states and 5329 transitions. [2019-11-07 04:42:25,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:25,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-07 04:42:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:25,082 INFO L225 Difference]: With dead ends: 3998 [2019-11-07 04:42:25,082 INFO L226 Difference]: Without dead ends: 2518 [2019-11-07 04:42:25,088 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,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-11-07 04:42:25,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2296. [2019-11-07 04:42:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-11-07 04:42:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3031 transitions. [2019-11-07 04:42:25,394 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3031 transitions. Word has length 55 [2019-11-07 04:42:25,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:25,395 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 3031 transitions. [2019-11-07 04:42:25,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:25,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3031 transitions. [2019-11-07 04:42:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-07 04:42:25,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:25,397 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:25,397 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:25,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1558584849, now seen corresponding path program 1 times [2019-11-07 04:42:25,398 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:25,398 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983750065] [2019-11-07 04:42:25,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:25,453 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,453 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983750065] [2019-11-07 04:42:25,453 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:25,453 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:25,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113983913] [2019-11-07 04:42:25,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:25,454 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:25,455 INFO L87 Difference]: Start difference. First operand 2296 states and 3031 transitions. Second operand 3 states. [2019-11-07 04:42:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:25,794 INFO L93 Difference]: Finished difference Result 3968 states and 5247 transitions. [2019-11-07 04:42:25,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:25,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-11-07 04:42:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:25,809 INFO L225 Difference]: With dead ends: 3968 [2019-11-07 04:42:25,809 INFO L226 Difference]: Without dead ends: 2735 [2019-11-07 04:42:25,814 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,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-11-07 04:42:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2553. [2019-11-07 04:42:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-11-07 04:42:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3356 transitions. [2019-11-07 04:42:26,125 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3356 transitions. Word has length 58 [2019-11-07 04:42:26,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:26,126 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 3356 transitions. [2019-11-07 04:42:26,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3356 transitions. [2019-11-07 04:42:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-07 04:42:26,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:26,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:26,127 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash -895213973, now seen corresponding path program 1 times [2019-11-07 04:42:26,128 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:26,128 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828747927] [2019-11-07 04:42:26,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:26,182 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,182 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828747927] [2019-11-07 04:42:26,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:26,183 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:26,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861821009] [2019-11-07 04:42:26,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:26,183 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:26,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:26,184 INFO L87 Difference]: Start difference. First operand 2553 states and 3356 transitions. Second operand 3 states. [2019-11-07 04:42:26,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:26,922 INFO L93 Difference]: Finished difference Result 5056 states and 6654 transitions. [2019-11-07 04:42:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:26,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-07 04:42:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:26,942 INFO L225 Difference]: With dead ends: 5056 [2019-11-07 04:42:26,942 INFO L226 Difference]: Without dead ends: 3570 [2019-11-07 04:42:26,948 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,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-11-07 04:42:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3346. [2019-11-07 04:42:27,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-11-07 04:42:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4348 transitions. [2019-11-07 04:42:27,505 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4348 transitions. Word has length 62 [2019-11-07 04:42:27,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:27,505 INFO L462 AbstractCegarLoop]: Abstraction has 3346 states and 4348 transitions. [2019-11-07 04:42:27,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4348 transitions. [2019-11-07 04:42:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-07 04:42:27,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:27,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:27,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:27,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 2069297178, now seen corresponding path program 1 times [2019-11-07 04:42:27,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:27,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531667116] [2019-11-07 04:42:27,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:27,640 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,640 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531667116] [2019-11-07 04:42:27,640 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:27,641 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:42:27,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267783883] [2019-11-07 04:42:27,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:42:27,641 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:27,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:42:27,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:27,642 INFO L87 Difference]: Start difference. First operand 3346 states and 4348 transitions. Second operand 7 states. [2019-11-07 04:42:28,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:28,684 INFO L93 Difference]: Finished difference Result 4712 states and 6067 transitions. [2019-11-07 04:42:28,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 04:42:28,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-07 04:42:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:28,704 INFO L225 Difference]: With dead ends: 4712 [2019-11-07 04:42:28,704 INFO L226 Difference]: Without dead ends: 4710 [2019-11-07 04:42:28,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-07 04:42:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2019-11-07 04:42:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 3961. [2019-11-07 04:42:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2019-11-07 04:42:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5110 transitions. [2019-11-07 04:42:29,269 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5110 transitions. Word has length 65 [2019-11-07 04:42:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:29,270 INFO L462 AbstractCegarLoop]: Abstraction has 3961 states and 5110 transitions. [2019-11-07 04:42:29,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:42:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5110 transitions. [2019-11-07 04:42:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-07 04:42:29,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:29,272 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,273 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:29,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:29,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1412306678, now seen corresponding path program 1 times [2019-11-07 04:42:29,273 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:29,273 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491624407] [2019-11-07 04:42:29,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:29,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491624407] [2019-11-07 04:42:29,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573637657] [2019-11-07 04:42:29,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:42:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:29,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-07 04:42:29,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:42:30,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:30,696 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:42:30,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:30,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:30,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,182 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-11-07 04:42:31,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-07 04:42:31,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:31,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-07 04:42:31,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:31,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:31,890 WARN L191 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-11-07 04:42:32,067 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-07 04:42:32,340 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-07 04:42:32,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-07 04:42:32,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 04:42:32,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:42:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:32,735 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [768177521] [2019-11-07 04:42:32,767 INFO L159 IcfgInterpreter]: Started Sifa with 67 locations of interest [2019-11-07 04:42:32,767 INFO L166 IcfgInterpreter]: Building call graph [2019-11-07 04:42:32,774 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-07 04:42:32,781 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-07 04:42:32,781 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-07 04:42:33,131 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 172 for LOIs [2019-11-07 04:42:34,055 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 103 for LOIs [2019-11-07 04:42:34,060 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-07 04:42:34,302 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-07 04:42:34,500 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-07 04:42:34,691 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 87