java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:51,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:51,022 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:51,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:51,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:51,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:51,048 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:51,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:51,063 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:51,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:51,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:51,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:51,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:51,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:51,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:51,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:51,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:51,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:51,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:51,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:51,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:51,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:51,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:51,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:51,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:51,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:51,101 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:51,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:51,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:51,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:51,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:51,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:51,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:51,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:51,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:51,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:51,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:51,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:51,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:51,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:51,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:51,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:21:51,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:51,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:51,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:51,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:51,151 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:51,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:51,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:51,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:51,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:51,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:51,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:51,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:51,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:51,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:51,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:51,154 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:51,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:51,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:51,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:51,155 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:51,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:51,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:51,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:51,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:51,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:51,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:51,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:51,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:51,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:21:51,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:51,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:51,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:51,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:51,464 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:51,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:51,520 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bbab936/97edb6ce103048c7873faf51fd8b58d1/FLAG3c972df1b [2019-10-13 23:21:52,168 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:52,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:52,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bbab936/97edb6ce103048c7873faf51fd8b58d1/FLAG3c972df1b [2019-10-13 23:21:52,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33bbab936/97edb6ce103048c7873faf51fd8b58d1 [2019-10-13 23:21:52,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:52,315 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:52,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:52,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:52,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:52,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:52" (1/1) ... [2019-10-13 23:21:52,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0e9bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:52, skipping insertion in model container [2019-10-13 23:21:52,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:52" (1/1) ... [2019-10-13 23:21:52,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:52,467 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:53,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:53,487 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:53,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:53,985 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:53,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53 WrapperNode [2019-10-13 23:21:53,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:53,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:53,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:53,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:54,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... [2019-10-13 23:21:54,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:54,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:54,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:54,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:54,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:54,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:54,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:54,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:21:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:54,326 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:54,327 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:54,328 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:54,329 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:54,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:54,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:58,913 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:58,914 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:58,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:58 BoogieIcfgContainer [2019-10-13 23:21:58,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:58,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:58,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:58,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:58,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:52" (1/3) ... [2019-10-13 23:21:58,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c536ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:58, skipping insertion in model container [2019-10-13 23:21:58,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:53" (2/3) ... [2019-10-13 23:21:58,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c536ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:58, skipping insertion in model container [2019-10-13 23:21:58,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:58" (3/3) ... [2019-10-13 23:21:58,943 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-10-13 23:21:58,958 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:58,974 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-10-13 23:21:58,990 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-10-13 23:21:59,039 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:59,039 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:59,040 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:59,040 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:59,040 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:59,040 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:59,040 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:59,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states. [2019-10-13 23:21:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:21:59,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:59,123 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:59,125 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:59,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1351038029, now seen corresponding path program 1 times [2019-10-13 23:21:59,142 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:59,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068365822] [2019-10-13 23:21:59,249 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,250 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:00,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068365822] [2019-10-13 23:22:00,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:00,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:00,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108827966] [2019-10-13 23:22:00,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:00,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:00,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:00,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:00,057 INFO L87 Difference]: Start difference. First operand 1059 states. Second operand 6 states. [2019-10-13 23:22:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:02,089 INFO L93 Difference]: Finished difference Result 1893 states and 3327 transitions. [2019-10-13 23:22:02,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:02,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-13 23:22:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:02,129 INFO L225 Difference]: With dead ends: 1893 [2019-10-13 23:22:02,129 INFO L226 Difference]: Without dead ends: 1259 [2019-10-13 23:22:02,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-10-13 23:22:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1243. [2019-10-13 23:22:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2019-10-13 23:22:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1619 transitions. [2019-10-13 23:22:02,315 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1619 transitions. Word has length 54 [2019-10-13 23:22:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:02,316 INFO L462 AbstractCegarLoop]: Abstraction has 1243 states and 1619 transitions. [2019-10-13 23:22:02,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1619 transitions. [2019-10-13 23:22:02,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:02,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:02,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:02,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1856787906, now seen corresponding path program 1 times [2019-10-13 23:22:02,324 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:02,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591343722] [2019-10-13 23:22:02,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,324 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:02,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591343722] [2019-10-13 23:22:02,550 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:02,550 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:02,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172635545] [2019-10-13 23:22:02,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:02,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:02,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:02,554 INFO L87 Difference]: Start difference. First operand 1243 states and 1619 transitions. Second operand 6 states. [2019-10-13 23:22:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:03,954 INFO L93 Difference]: Finished difference Result 2807 states and 3684 transitions. [2019-10-13 23:22:03,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:03,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-13 23:22:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:03,968 INFO L225 Difference]: With dead ends: 2807 [2019-10-13 23:22:03,969 INFO L226 Difference]: Without dead ends: 1946 [2019-10-13 23:22:03,971 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-10-13 23:22:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1926. [2019-10-13 23:22:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-10-13 23:22:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2520 transitions. [2019-10-13 23:22:04,043 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2520 transitions. Word has length 54 [2019-10-13 23:22:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:04,043 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 2520 transitions. [2019-10-13 23:22:04,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:04,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2520 transitions. [2019-10-13 23:22:04,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:04,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:04,048 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:04,048 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:04,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:04,049 INFO L82 PathProgramCache]: Analyzing trace with hash -333312361, now seen corresponding path program 1 times [2019-10-13 23:22:04,049 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:04,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440212372] [2019-10-13 23:22:04,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:04,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440212372] [2019-10-13 23:22:04,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:04,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:04,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402698143] [2019-10-13 23:22:04,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:04,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:04,182 INFO L87 Difference]: Start difference. First operand 1926 states and 2520 transitions. Second operand 5 states. [2019-10-13 23:22:05,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,558 INFO L93 Difference]: Finished difference Result 3860 states and 5085 transitions. [2019-10-13 23:22:05,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:05,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-10-13 23:22:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,573 INFO L225 Difference]: With dead ends: 3860 [2019-10-13 23:22:05,574 INFO L226 Difference]: Without dead ends: 2906 [2019-10-13 23:22:05,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2019-10-13 23:22:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2900. [2019-10-13 23:22:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-13 23:22:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3760 transitions. [2019-10-13 23:22:05,714 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3760 transitions. Word has length 54 [2019-10-13 23:22:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,715 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3760 transitions. [2019-10-13 23:22:05,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3760 transitions. [2019-10-13 23:22:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:05,719 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,719 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:05,719 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1049417886, now seen corresponding path program 1 times [2019-10-13 23:22:05,720 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638182626] [2019-10-13 23:22:05,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:05,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638182626] [2019-10-13 23:22:05,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:05,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926111149] [2019-10-13 23:22:05,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:05,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:05,978 INFO L87 Difference]: Start difference. First operand 2900 states and 3760 transitions. Second operand 9 states. [2019-10-13 23:22:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:09,563 INFO L93 Difference]: Finished difference Result 4761 states and 6326 transitions. [2019-10-13 23:22:09,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:22:09,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 23:22:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:09,586 INFO L225 Difference]: With dead ends: 4761 [2019-10-13 23:22:09,586 INFO L226 Difference]: Without dead ends: 4756 [2019-10-13 23:22:09,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2019-10-13 23:22:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 2900. [2019-10-13 23:22:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-13 23:22:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3759 transitions. [2019-10-13 23:22:09,826 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3759 transitions. Word has length 55 [2019-10-13 23:22:09,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:09,828 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3759 transitions. [2019-10-13 23:22:09,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:09,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3759 transitions. [2019-10-13 23:22:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:09,834 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:09,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:09,835 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -757116331, now seen corresponding path program 1 times [2019-10-13 23:22:09,836 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:09,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900433199] [2019-10-13 23:22:09,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,837 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:09,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900433199] [2019-10-13 23:22:10,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:10,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537762373] [2019-10-13 23:22:10,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:10,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:10,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:10,041 INFO L87 Difference]: Start difference. First operand 2900 states and 3759 transitions. Second operand 9 states. [2019-10-13 23:22:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:13,460 INFO L93 Difference]: Finished difference Result 6167 states and 8224 transitions. [2019-10-13 23:22:13,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:13,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-13 23:22:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:13,484 INFO L225 Difference]: With dead ends: 6167 [2019-10-13 23:22:13,484 INFO L226 Difference]: Without dead ends: 5918 [2019-10-13 23:22:13,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:13,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2019-10-13 23:22:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 2900. [2019-10-13 23:22:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-13 23:22:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3758 transitions. [2019-10-13 23:22:13,713 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3758 transitions. Word has length 55 [2019-10-13 23:22:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:13,716 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3758 transitions. [2019-10-13 23:22:13,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3758 transitions. [2019-10-13 23:22:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:13,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:13,720 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:13,720 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:13,721 INFO L82 PathProgramCache]: Analyzing trace with hash 2078575284, now seen corresponding path program 1 times [2019-10-13 23:22:13,721 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:13,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284328964] [2019-10-13 23:22:13,721 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:13,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284328964] [2019-10-13 23:22:13,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:13,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:13,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238806943] [2019-10-13 23:22:13,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:13,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:13,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:13,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:13,974 INFO L87 Difference]: Start difference. First operand 2900 states and 3758 transitions. Second operand 8 states. [2019-10-13 23:22:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:16,413 INFO L93 Difference]: Finished difference Result 6530 states and 8937 transitions. [2019-10-13 23:22:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:16,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-10-13 23:22:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:16,436 INFO L225 Difference]: With dead ends: 6530 [2019-10-13 23:22:16,437 INFO L226 Difference]: Without dead ends: 5690 [2019-10-13 23:22:16,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:22:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2019-10-13 23:22:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 2900. [2019-10-13 23:22:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-10-13 23:22:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3757 transitions. [2019-10-13 23:22:16,781 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3757 transitions. Word has length 55 [2019-10-13 23:22:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:16,782 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 3757 transitions. [2019-10-13 23:22:16,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3757 transitions. [2019-10-13 23:22:16,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:16,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:16,788 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:16,789 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash -146447767, now seen corresponding path program 1 times [2019-10-13 23:22:16,789 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:16,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013162158] [2019-10-13 23:22:16,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,790 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:16,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:16,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013162158] [2019-10-13 23:22:16,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:16,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:16,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185512927] [2019-10-13 23:22:16,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:16,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:16,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:16,895 INFO L87 Difference]: Start difference. First operand 2900 states and 3757 transitions. Second operand 3 states. [2019-10-13 23:22:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:17,325 INFO L93 Difference]: Finished difference Result 4060 states and 5396 transitions. [2019-10-13 23:22:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:17,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 23:22:17,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:17,343 INFO L225 Difference]: With dead ends: 4060 [2019-10-13 23:22:17,344 INFO L226 Difference]: Without dead ends: 3013 [2019-10-13 23:22:17,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2019-10-13 23:22:17,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2845. [2019-10-13 23:22:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-10-13 23:22:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3674 transitions. [2019-10-13 23:22:17,584 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3674 transitions. Word has length 56 [2019-10-13 23:22:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:17,585 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 3674 transitions. [2019-10-13 23:22:17,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3674 transitions. [2019-10-13 23:22:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:17,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:17,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:17,589 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash -384770931, now seen corresponding path program 1 times [2019-10-13 23:22:17,590 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:17,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453690942] [2019-10-13 23:22:17,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:17,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:17,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:17,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453690942] [2019-10-13 23:22:17,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:17,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:17,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685286992] [2019-10-13 23:22:17,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:17,677 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:17,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:17,677 INFO L87 Difference]: Start difference. First operand 2845 states and 3674 transitions. Second operand 3 states. [2019-10-13 23:22:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:18,117 INFO L93 Difference]: Finished difference Result 4346 states and 5822 transitions. [2019-10-13 23:22:18,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:18,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 23:22:18,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:18,150 INFO L225 Difference]: With dead ends: 4346 [2019-10-13 23:22:18,150 INFO L226 Difference]: Without dead ends: 3289 [2019-10-13 23:22:18,155 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2019-10-13 23:22:18,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3043. [2019-10-13 23:22:18,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3043 states. [2019-10-13 23:22:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 3976 transitions. [2019-10-13 23:22:18,506 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 3976 transitions. Word has length 56 [2019-10-13 23:22:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:18,506 INFO L462 AbstractCegarLoop]: Abstraction has 3043 states and 3976 transitions. [2019-10-13 23:22:18,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 3976 transitions. [2019-10-13 23:22:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-13 23:22:18,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:18,510 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:18,510 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1124901437, now seen corresponding path program 1 times [2019-10-13 23:22:18,511 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:18,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724480618] [2019-10-13 23:22:18,511 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:18,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:18,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724480618] [2019-10-13 23:22:18,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:18,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:18,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144090999] [2019-10-13 23:22:18,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:18,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:18,575 INFO L87 Difference]: Start difference. First operand 3043 states and 3976 transitions. Second operand 3 states. [2019-10-13 23:22:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:18,893 INFO L93 Difference]: Finished difference Result 4905 states and 6564 transitions. [2019-10-13 23:22:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:18,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-13 23:22:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:18,899 INFO L225 Difference]: With dead ends: 4905 [2019-10-13 23:22:18,899 INFO L226 Difference]: Without dead ends: 2925 [2019-10-13 23:22:18,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2925 states. [2019-10-13 23:22:19,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2925 to 2923. [2019-10-13 23:22:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2923 states. [2019-10-13 23:22:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2923 states to 2923 states and 3768 transitions. [2019-10-13 23:22:19,157 INFO L78 Accepts]: Start accepts. Automaton has 2923 states and 3768 transitions. Word has length 56 [2019-10-13 23:22:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:19,157 INFO L462 AbstractCegarLoop]: Abstraction has 2923 states and 3768 transitions. [2019-10-13 23:22:19,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2923 states and 3768 transitions. [2019-10-13 23:22:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:19,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:19,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:19,161 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:19,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash 56463115, now seen corresponding path program 1 times [2019-10-13 23:22:19,162 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:19,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171097389] [2019-10-13 23:22:19,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:19,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171097389] [2019-10-13 23:22:19,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:19,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:19,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403328286] [2019-10-13 23:22:19,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:19,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:19,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:19,224 INFO L87 Difference]: Start difference. First operand 2923 states and 3768 transitions. Second operand 3 states. [2019-10-13 23:22:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:19,607 INFO L93 Difference]: Finished difference Result 5048 states and 6640 transitions. [2019-10-13 23:22:19,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:19,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:19,613 INFO L225 Difference]: With dead ends: 5048 [2019-10-13 23:22:19,613 INFO L226 Difference]: Without dead ends: 2820 [2019-10-13 23:22:19,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2019-10-13 23:22:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2240. [2019-10-13 23:22:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2240 states. [2019-10-13 23:22:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2240 states to 2240 states and 2866 transitions. [2019-10-13 23:22:19,921 INFO L78 Accepts]: Start accepts. Automaton has 2240 states and 2866 transitions. Word has length 57 [2019-10-13 23:22:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:19,922 INFO L462 AbstractCegarLoop]: Abstraction has 2240 states and 2866 transitions. [2019-10-13 23:22:19,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2240 states and 2866 transitions. [2019-10-13 23:22:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 23:22:19,924 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:19,925 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:19,925 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1071477093, now seen corresponding path program 1 times [2019-10-13 23:22:19,926 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:19,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649862989] [2019-10-13 23:22:19,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,927 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:19,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:19,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649862989] [2019-10-13 23:22:19,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:19,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:19,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917554618] [2019-10-13 23:22:19,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:19,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:19,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:19,983 INFO L87 Difference]: Start difference. First operand 2240 states and 2866 transitions. Second operand 3 states. [2019-10-13 23:22:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:20,436 INFO L93 Difference]: Finished difference Result 4951 states and 6544 transitions. [2019-10-13 23:22:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:20,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-13 23:22:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:20,447 INFO L225 Difference]: With dead ends: 4951 [2019-10-13 23:22:20,447 INFO L226 Difference]: Without dead ends: 3189 [2019-10-13 23:22:20,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:20,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-13 23:22:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 2569. [2019-10-13 23:22:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-10-13 23:22:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3365 transitions. [2019-10-13 23:22:20,800 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3365 transitions. Word has length 57 [2019-10-13 23:22:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:20,800 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 3365 transitions. [2019-10-13 23:22:20,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3365 transitions. [2019-10-13 23:22:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:20,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:20,802 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:20,802 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1030838178, now seen corresponding path program 1 times [2019-10-13 23:22:20,803 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:20,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923674971] [2019-10-13 23:22:20,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:21,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:21,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923674971] [2019-10-13 23:22:21,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:21,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-13 23:22:21,514 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205743512] [2019-10-13 23:22:21,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 23:22:21,515 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:21,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 23:22:21,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:22:21,515 INFO L87 Difference]: Start difference. First operand 2569 states and 3365 transitions. Second operand 19 states. [2019-10-13 23:22:21,733 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-13 23:22:22,621 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-10-13 23:22:22,859 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-13 23:22:23,156 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-13 23:22:23,357 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-13 23:22:23,648 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-13 23:22:24,389 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-10-13 23:22:24,542 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-10-13 23:22:25,414 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39