/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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:41:15,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:41:15,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:41:15,834 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:41:15,835 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:41:15,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:41:15,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:41:15,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:41:15,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:41:15,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:41:15,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:41:15,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:41:15,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:41:15,846 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:41:15,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:41:15,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:41:15,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:41:15,850 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:41:15,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:41:15,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:41:15,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:41:15,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:41:15,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:41:15,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:41:15,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:41:15,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:41:15,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:41:15,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:41:15,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:41:15,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:41:15,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:41:15,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:41:15,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:41:15,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:41:15,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:41:15,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:41:15,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:41:15,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:41:15,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:41:15,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:41:15,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:41:15,871 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:15,885 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:41:15,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:41:15,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:41:15,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:41:15,887 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:41:15,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:41:15,887 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:41:15,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:41:15,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:41:15,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:41:15,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:41:15,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:41:15,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:41:15,889 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:41:15,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:41:15,889 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:41:15,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:41:15,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:41:15,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:41:15,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:41:15,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:41:15,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:41:15,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:41:15,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:41:15,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:41:15,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:41:15,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:41:15,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:41:15,892 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:16,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:41:16,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:41:16,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:41:16,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:41:16,186 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:41:16,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:16,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced7e5610/070bc91f75a949f8bd01b42562c72154/FLAG24a6b60f0 [2019-11-07 04:41:16,827 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:41:16,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:16,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced7e5610/070bc91f75a949f8bd01b42562c72154/FLAG24a6b60f0 [2019-11-07 04:41:17,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ced7e5610/070bc91f75a949f8bd01b42562c72154 [2019-11-07 04:41:17,028 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:41:17,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:41:17,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:17,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:41:17,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:41:17,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:17" (1/1) ... [2019-11-07 04:41:17,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360e8eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:17, skipping insertion in model container [2019-11-07 04:41:17,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:41:17" (1/1) ... [2019-11-07 04:41:17,047 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:41:17,111 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:41:17,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:17,743 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:41:18,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:41:18,233 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:41:18,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:18 WrapperNode [2019-11-07 04:41:18,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:41:18,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:41:18,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:41:18,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:41:18,246 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:18" (1/1) ... [2019-11-07 04:41:18,247 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:18" (1/1) ... [2019-11-07 04:41:18,265 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:18" (1/1) ... [2019-11-07 04:41:18,266 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:18" (1/1) ... [2019-11-07 04:41:18,301 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:18" (1/1) ... [2019-11-07 04:41:18,320 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:18" (1/1) ... [2019-11-07 04:41:18,327 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:18" (1/1) ... [2019-11-07 04:41:18,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:41:18,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:41:18,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:41:18,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:41:18,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:18" (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:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:41:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:41:18,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:41:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:41:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:41:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:41:18,427 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:41:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:41:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:41:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:41:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:41:18,428 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:41:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:41:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:41:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:41:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:41:18,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:41:18,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:41:21,049 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:41:21,049 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:41:21,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:21 BoogieIcfgContainer [2019-11-07 04:41:21,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:41:21,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:41:21,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:41:21,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:41:21,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:41:17" (1/3) ... [2019-11-07 04:41:21,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f538d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:21, skipping insertion in model container [2019-11-07 04:41:21,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:41:18" (2/3) ... [2019-11-07 04:41:21,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f538d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:41:21, skipping insertion in model container [2019-11-07 04:41:21,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:41:21" (3/3) ... [2019-11-07 04:41:21,060 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-07 04:41:21,070 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:41:21,084 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-07 04:41:21,096 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-07 04:41:21,139 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:41:21,139 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:41:21,139 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:41:21,140 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:41:21,140 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:41:21,140 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:41:21,140 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:41:21,140 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:41:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-11-07 04:41:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-07 04:41:21,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:21,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,191 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:21,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2122019626, now seen corresponding path program 1 times [2019-11-07 04:41:21,204 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:21,205 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620240092] [2019-11-07 04:41:21,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:22,548 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:41:22,549 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620240092] [2019-11-07 04:41:22,550 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:22,550 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:41:22,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904034088] [2019-11-07 04:41:22,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:41:22,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:22,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:41:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:22,576 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 7 states. [2019-11-07 04:41:22,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:22,964 INFO L93 Difference]: Finished difference Result 966 states and 1683 transitions. [2019-11-07 04:41:22,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:41:22,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-11-07 04:41:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:22,994 INFO L225 Difference]: With dead ends: 966 [2019-11-07 04:41:22,994 INFO L226 Difference]: Without dead ends: 728 [2019-11-07 04:41:23,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-11-07 04:41:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 686. [2019-11-07 04:41:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-07 04:41:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 895 transitions. [2019-11-07 04:41:23,143 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 895 transitions. Word has length 118 [2019-11-07 04:41:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:23,144 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 895 transitions. [2019-11-07 04:41:23,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:41:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 895 transitions. [2019-11-07 04:41:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-07 04:41:23,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:23,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:23,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:23,157 INFO L82 PathProgramCache]: Analyzing trace with hash -750036124, now seen corresponding path program 1 times [2019-11-07 04:41:23,158 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:23,158 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636509414] [2019-11-07 04:41:23,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:23,372 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:41:23,373 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636509414] [2019-11-07 04:41:23,373 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:23,373 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:23,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379965483] [2019-11-07 04:41:23,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:23,376 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:23,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:23,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:23,376 INFO L87 Difference]: Start difference. First operand 686 states and 895 transitions. Second operand 5 states. [2019-11-07 04:41:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:23,644 INFO L93 Difference]: Finished difference Result 1281 states and 1671 transitions. [2019-11-07 04:41:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:23,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-07 04:41:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:23,651 INFO L225 Difference]: With dead ends: 1281 [2019-11-07 04:41:23,651 INFO L226 Difference]: Without dead ends: 686 [2019-11-07 04:41:23,658 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:41:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-07 04:41:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2019-11-07 04:41:23,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-07 04:41:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 883 transitions. [2019-11-07 04:41:23,704 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 883 transitions. Word has length 124 [2019-11-07 04:41:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:23,706 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 883 transitions. [2019-11-07 04:41:23,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 883 transitions. [2019-11-07 04:41:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-07 04:41:23,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:23,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:23,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 889076878, now seen corresponding path program 1 times [2019-11-07 04:41:23,713 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:23,714 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995510329] [2019-11-07 04:41:23,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:24,313 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:41:24,313 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995510329] [2019-11-07 04:41:24,314 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:24,314 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:41:24,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579592308] [2019-11-07 04:41:24,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:41:24,315 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:24,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:41:24,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:24,316 INFO L87 Difference]: Start difference. First operand 686 states and 883 transitions. Second operand 7 states. [2019-11-07 04:41:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:24,654 INFO L93 Difference]: Finished difference Result 2140 states and 2800 transitions. [2019-11-07 04:41:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:41:24,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-11-07 04:41:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:24,664 INFO L225 Difference]: With dead ends: 2140 [2019-11-07 04:41:24,664 INFO L226 Difference]: Without dead ends: 1590 [2019-11-07 04:41:24,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-07 04:41:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-11-07 04:41:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1548. [2019-11-07 04:41:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-11-07 04:41:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2040 transitions. [2019-11-07 04:41:24,783 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2040 transitions. Word has length 124 [2019-11-07 04:41:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:24,784 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2040 transitions. [2019-11-07 04:41:24,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:41:24,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2040 transitions. [2019-11-07 04:41:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-07 04:41:24,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:24,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,789 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash -477679404, now seen corresponding path program 1 times [2019-11-07 04:41:24,790 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:24,790 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755933661] [2019-11-07 04:41:24,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:24,968 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:41:24,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755933661] [2019-11-07 04:41:24,969 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:24,970 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:24,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906792953] [2019-11-07 04:41:24,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:24,971 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:24,971 INFO L87 Difference]: Start difference. First operand 1548 states and 2040 transitions. Second operand 5 states. [2019-11-07 04:41:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:25,253 INFO L93 Difference]: Finished difference Result 3021 states and 3984 transitions. [2019-11-07 04:41:25,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:25,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-07 04:41:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:25,261 INFO L225 Difference]: With dead ends: 3021 [2019-11-07 04:41:25,261 INFO L226 Difference]: Without dead ends: 1548 [2019-11-07 04:41:25,264 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:41:25,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2019-11-07 04:41:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2019-11-07 04:41:25,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-11-07 04:41:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2009 transitions. [2019-11-07 04:41:25,363 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2009 transitions. Word has length 124 [2019-11-07 04:41:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:25,364 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2009 transitions. [2019-11-07 04:41:25,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2009 transitions. [2019-11-07 04:41:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-07 04:41:25,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:25,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1624067626, now seen corresponding path program 1 times [2019-11-07 04:41:25,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:25,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699419875] [2019-11-07 04:41:25,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:25,850 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:41:25,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699419875] [2019-11-07 04:41:25,851 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:25,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:25,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443059817] [2019-11-07 04:41:25,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:25,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:25,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:25,854 INFO L87 Difference]: Start difference. First operand 1548 states and 2009 transitions. Second operand 5 states. [2019-11-07 04:41:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:26,063 INFO L93 Difference]: Finished difference Result 2533 states and 3343 transitions. [2019-11-07 04:41:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:26,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-07 04:41:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:26,073 INFO L225 Difference]: With dead ends: 2533 [2019-11-07 04:41:26,073 INFO L226 Difference]: Without dead ends: 1791 [2019-11-07 04:41:26,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-11-07 04:41:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1500. [2019-11-07 04:41:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-11-07 04:41:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1929 transitions. [2019-11-07 04:41:26,205 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1929 transitions. Word has length 124 [2019-11-07 04:41:26,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:26,206 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 1929 transitions. [2019-11-07 04:41:26,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1929 transitions. [2019-11-07 04:41:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:41:26,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:26,209 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash -788819286, now seen corresponding path program 1 times [2019-11-07 04:41:26,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:26,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121733757] [2019-11-07 04:41:26,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:26,586 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:41:26,586 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121733757] [2019-11-07 04:41:26,587 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:26,587 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:26,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012158777] [2019-11-07 04:41:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:26,590 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:26,591 INFO L87 Difference]: Start difference. First operand 1500 states and 1929 transitions. Second operand 5 states. [2019-11-07 04:41:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:26,877 INFO L93 Difference]: Finished difference Result 2317 states and 2974 transitions. [2019-11-07 04:41:26,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:26,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 04:41:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:26,889 INFO L225 Difference]: With dead ends: 2317 [2019-11-07 04:41:26,889 INFO L226 Difference]: Without dead ends: 1765 [2019-11-07 04:41:26,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-11-07 04:41:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1636. [2019-11-07 04:41:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-11-07 04:41:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2077 transitions. [2019-11-07 04:41:27,022 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2077 transitions. Word has length 130 [2019-11-07 04:41:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:27,028 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2077 transitions. [2019-11-07 04:41:27,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2077 transitions. [2019-11-07 04:41:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:41:27,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:27,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,032 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1869731908, now seen corresponding path program 1 times [2019-11-07 04:41:27,033 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:27,034 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664876579] [2019-11-07 04:41:27,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:27,387 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:41:27,387 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664876579] [2019-11-07 04:41:27,388 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:27,388 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:27,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438331643] [2019-11-07 04:41:27,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:27,389 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:27,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:27,389 INFO L87 Difference]: Start difference. First operand 1636 states and 2077 transitions. Second operand 5 states. [2019-11-07 04:41:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:27,584 INFO L93 Difference]: Finished difference Result 3154 states and 4087 transitions. [2019-11-07 04:41:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:27,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 04:41:27,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:27,594 INFO L225 Difference]: With dead ends: 3154 [2019-11-07 04:41:27,594 INFO L226 Difference]: Without dead ends: 1889 [2019-11-07 04:41:27,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:41:27,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-11-07 04:41:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1664. [2019-11-07 04:41:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-11-07 04:41:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2109 transitions. [2019-11-07 04:41:27,769 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2109 transitions. Word has length 130 [2019-11-07 04:41:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:27,769 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2109 transitions. [2019-11-07 04:41:27,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2109 transitions. [2019-11-07 04:41:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 04:41:27,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:27,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:27,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1348043834, now seen corresponding path program 1 times [2019-11-07 04:41:27,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:27,775 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190412038] [2019-11-07 04:41:27,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:28,147 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:41:28,147 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190412038] [2019-11-07 04:41:28,147 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:28,148 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:28,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990225452] [2019-11-07 04:41:28,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:28,149 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:28,149 INFO L87 Difference]: Start difference. First operand 1664 states and 2109 transitions. Second operand 5 states. [2019-11-07 04:41:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:28,424 INFO L93 Difference]: Finished difference Result 3144 states and 3975 transitions. [2019-11-07 04:41:28,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:28,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-11-07 04:41:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:28,435 INFO L225 Difference]: With dead ends: 3144 [2019-11-07 04:41:28,435 INFO L226 Difference]: Without dead ends: 2421 [2019-11-07 04:41:28,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:41:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-11-07 04:41:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2400. [2019-11-07 04:41:28,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-11-07 04:41:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3022 transitions. [2019-11-07 04:41:28,665 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3022 transitions. Word has length 136 [2019-11-07 04:41:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:28,666 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 3022 transitions. [2019-11-07 04:41:28,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:28,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3022 transitions. [2019-11-07 04:41:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 04:41:28,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:28,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,671 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:28,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:28,671 INFO L82 PathProgramCache]: Analyzing trace with hash -901341700, now seen corresponding path program 1 times [2019-11-07 04:41:28,672 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:28,672 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630664048] [2019-11-07 04:41:28,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:28,790 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:41:28,791 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630664048] [2019-11-07 04:41:28,791 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:28,791 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:28,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384014286] [2019-11-07 04:41:28,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:28,792 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:28,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:28,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:28,793 INFO L87 Difference]: Start difference. First operand 2400 states and 3022 transitions. Second operand 5 states. [2019-11-07 04:41:29,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:29,137 INFO L93 Difference]: Finished difference Result 4758 states and 5997 transitions. [2019-11-07 04:41:29,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:29,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-11-07 04:41:29,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:29,148 INFO L225 Difference]: With dead ends: 4758 [2019-11-07 04:41:29,149 INFO L226 Difference]: Without dead ends: 2400 [2019-11-07 04:41:29,154 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:41:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-11-07 04:41:29,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2400. [2019-11-07 04:41:29,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-11-07 04:41:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 2979 transitions. [2019-11-07 04:41:29,337 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 2979 transitions. Word has length 136 [2019-11-07 04:41:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:29,337 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 2979 transitions. [2019-11-07 04:41:29,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2979 transitions. [2019-11-07 04:41:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 04:41:29,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:29,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,342 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1514093286, now seen corresponding path program 1 times [2019-11-07 04:41:29,343 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:29,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540957900] [2019-11-07 04:41:29,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:29,825 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:41:29,825 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540957900] [2019-11-07 04:41:29,826 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:29,826 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:41:29,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408132739] [2019-11-07 04:41:29,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:41:29,827 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:41:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:41:29,828 INFO L87 Difference]: Start difference. First operand 2400 states and 2979 transitions. Second operand 5 states. [2019-11-07 04:41:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:41:30,170 INFO L93 Difference]: Finished difference Result 3104 states and 3853 transitions. [2019-11-07 04:41:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:41:30,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-11-07 04:41:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:41:30,182 INFO L225 Difference]: With dead ends: 3104 [2019-11-07 04:41:30,183 INFO L226 Difference]: Without dead ends: 2417 [2019-11-07 04:41:30,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:41:30,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-11-07 04:41:30,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2392. [2019-11-07 04:41:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-11-07 04:41:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 2969 transitions. [2019-11-07 04:41:30,385 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 2969 transitions. Word has length 136 [2019-11-07 04:41:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:41:30,386 INFO L462 AbstractCegarLoop]: Abstraction has 2392 states and 2969 transitions. [2019-11-07 04:41:30,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:41:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2969 transitions. [2019-11-07 04:41:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-07 04:41:30,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:41:30,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:30,393 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:41:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:41:30,393 INFO L82 PathProgramCache]: Analyzing trace with hash -58368430, now seen corresponding path program 1 times [2019-11-07 04:41:30,394 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:41:30,394 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482363498] [2019-11-07 04:41:30,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:41:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:41:31,778 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-07 04:41:32,097 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-11-07 04:41:32,353 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-07 04:41:32,607 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-11-07 04:41:32,808 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-11-07 04:41:33,071 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-11-07 04:41:33,368 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-11-07 04:41:33,689 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-11-07 04:41:33,987 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-11-07 04:41:34,295 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-11-07 04:41:34,558 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-11-07 04:41:34,873 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-11-07 04:41:35,150 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-11-07 04:41:35,447 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-11-07 04:41:35,691 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-11-07 04:41:36,085 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-11-07 04:41:36,348 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-07 04:41:36,544 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-07 04:41:36,945 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-11-07 04:41:37,159 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-11-07 04:41:37,532 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-11-07 04:41:37,796 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-11-07 04:41:38,061 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-11-07 04:41:38,275 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-11-07 04:41:39,127 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:41:39,128 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482363498] [2019-11-07 04:41:39,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:41:39,128 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-11-07 04:41:39,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165641758] [2019-11-07 04:41:39,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-07 04:41:39,129 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:41:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-07 04:41:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-11-07 04:41:39,130 INFO L87 Difference]: Start difference. First operand 2392 states and 2969 transitions. Second operand 34 states. [2019-11-07 04:41:39,663 WARN L191 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-11-07 04:41:40,327 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-11-07 04:41:40,655 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-11-07 04:41:41,196 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-11-07 04:41:41,778 WARN L191 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-11-07 04:41:42,653 WARN L191 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-11-07 04:41:43,326 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-11-07 04:41:43,875 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-11-07 04:41:44,552 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-11-07 04:41:45,059 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-11-07 04:41:45,644 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-11-07 04:41:46,310 WARN L191 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-11-07 04:41:46,966 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2019-11-07 04:41:47,380 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-11-07 04:41:48,678 WARN L191 SmtUtils]: Spent 968.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 152 [2019-11-07 04:41:49,690 WARN L191 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-11-07 04:41:50,080 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2019-11-07 04:41:51,192 WARN L191 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 140 [2019-11-07 04:41:52,461 WARN L191 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 133 [2019-11-07 04:41:53,169 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-11-07 04:41:53,796 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 113 [2019-11-07 04:41:54,878 WARN L191 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 149