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+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:22,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:22,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:22,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:22,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:22,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:22,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:22,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:22,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:22,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:22,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:22,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:22,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:22,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:22,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:22,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:22,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:22,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:22,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:22,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:22,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:22,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:22,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:22,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:22,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:22,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:22,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:22,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:22,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:22,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:22,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:22,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:22,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:22,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:22,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:22,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:22,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:22,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:22,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:22,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:22,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:22,964 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-15 03:26:22,985 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:22,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:22,987 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:22,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:22,987 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:22,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:22,988 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:22,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:22,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:22,989 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:22,990 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:22,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:22,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:22,991 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:22,991 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:22,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:22,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:22,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:22,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:22,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:22,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:22,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:22,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:22,994 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:22,994 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:22,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:22,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:22,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:22,995 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-15 03:26:23,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:23,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:23,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:23,325 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:23,326 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:23,326 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+cfa-reducer.c [2019-10-15 03:26:23,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd785cf09/791477d6c8c94c519251a2827aa6e6e8/FLAG5e00e0267 [2019-10-15 03:26:23,908 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:23,909 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+cfa-reducer.c [2019-10-15 03:26:23,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd785cf09/791477d6c8c94c519251a2827aa6e6e8/FLAG5e00e0267 [2019-10-15 03:26:24,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd785cf09/791477d6c8c94c519251a2827aa6e6e8 [2019-10-15 03:26:24,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:24,232 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:24,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:24,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:24,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:24,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c8dd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24, skipping insertion in model container [2019-10-15 03:26:24,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:24,301 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:24,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:24,555 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:24,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:24,706 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:24,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24 WrapperNode [2019-10-15 03:26:24,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:24,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:24,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:24,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:24,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (1/1) ... [2019-10-15 03:26:24,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:24,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:24,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:24,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:24,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (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-15 03:26:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:24,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:24,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:24,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:25,718 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:25,718 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:25,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:25 BoogieIcfgContainer [2019-10-15 03:26:25,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:25,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:25,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:25,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:25,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:24" (1/3) ... [2019-10-15 03:26:25,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122a92fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:25, skipping insertion in model container [2019-10-15 03:26:25,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:24" (2/3) ... [2019-10-15 03:26:25,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122a92fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:25, skipping insertion in model container [2019-10-15 03:26:25,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:25" (3/3) ... [2019-10-15 03:26:25,728 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 03:26:25,738 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:25,746 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:26:25,758 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:26:25,783 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:25,784 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:25,784 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:25,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:25,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:25,785 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:25,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:25,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2019-10-15 03:26:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-15 03:26:25,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:25,816 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] [2019-10-15 03:26:25,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:25,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1163152774, now seen corresponding path program 1 times [2019-10-15 03:26:25,833 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:25,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949637797] [2019-10-15 03:26:25,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,834 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:25,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,130 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-15 03:26:26,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949637797] [2019-10-15 03:26:26,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:26,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811953735] [2019-10-15 03:26:26,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:26,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:26,152 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2019-10-15 03:26:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,234 INFO L93 Difference]: Finished difference Result 143 states and 212 transitions. [2019-10-15 03:26:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:26,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-15 03:26:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,248 INFO L225 Difference]: With dead ends: 143 [2019-10-15 03:26:26,248 INFO L226 Difference]: Without dead ends: 93 [2019-10-15 03:26:26,252 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-15 03:26:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-15 03:26:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-15 03:26:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-15 03:26:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2019-10-15 03:26:26,312 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 32 [2019-10-15 03:26:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:26,313 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2019-10-15 03:26:26,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2019-10-15 03:26:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-15 03:26:26,315 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,315 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] [2019-10-15 03:26:26,316 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1597776346, now seen corresponding path program 1 times [2019-10-15 03:26:26,317 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736629146] [2019-10-15 03:26:26,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,317 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,504 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-15 03:26:26,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736629146] [2019-10-15 03:26:26,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:26,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739755702] [2019-10-15 03:26:26,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:26,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:26,511 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand 3 states. [2019-10-15 03:26:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,579 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2019-10-15 03:26:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:26,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-15 03:26:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,585 INFO L225 Difference]: With dead ends: 205 [2019-10-15 03:26:26,585 INFO L226 Difference]: Without dead ends: 137 [2019-10-15 03:26:26,589 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-15 03:26:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-15 03:26:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-15 03:26:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-15 03:26:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 188 transitions. [2019-10-15 03:26:26,636 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 188 transitions. Word has length 34 [2019-10-15 03:26:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:26,637 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 188 transitions. [2019-10-15 03:26:26,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 188 transitions. [2019-10-15 03:26:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-15 03:26:26,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,638 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] [2019-10-15 03:26:26,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash -420169279, now seen corresponding path program 1 times [2019-10-15 03:26:26,639 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072733176] [2019-10-15 03:26:26,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,640 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,762 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-15 03:26:26,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072733176] [2019-10-15 03:26:26,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:26,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077012410] [2019-10-15 03:26:26,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:26,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:26,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:26,765 INFO L87 Difference]: Start difference. First operand 135 states and 188 transitions. Second operand 3 states. [2019-10-15 03:26:26,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:26,807 INFO L93 Difference]: Finished difference Result 315 states and 450 transitions. [2019-10-15 03:26:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:26,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-15 03:26:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:26,817 INFO L225 Difference]: With dead ends: 315 [2019-10-15 03:26:26,818 INFO L226 Difference]: Without dead ends: 203 [2019-10-15 03:26:26,819 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-15 03:26:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-10-15 03:26:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-10-15 03:26:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-15 03:26:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 280 transitions. [2019-10-15 03:26:26,860 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 280 transitions. Word has length 37 [2019-10-15 03:26:26,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:26,861 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 280 transitions. [2019-10-15 03:26:26,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 280 transitions. [2019-10-15 03:26:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 03:26:26,862 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:26,862 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] [2019-10-15 03:26:26,863 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2107957381, now seen corresponding path program 1 times [2019-10-15 03:26:26,863 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:26,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178420275] [2019-10-15 03:26:26,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,864 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:26,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:26,975 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-15 03:26:26,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178420275] [2019-10-15 03:26:26,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:26,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:26,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680236555] [2019-10-15 03:26:26,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:26,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:26,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:26,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:26,978 INFO L87 Difference]: Start difference. First operand 201 states and 280 transitions. Second operand 5 states. [2019-10-15 03:26:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:27,062 INFO L93 Difference]: Finished difference Result 647 states and 915 transitions. [2019-10-15 03:26:27,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:27,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-10-15 03:26:27,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:27,066 INFO L225 Difference]: With dead ends: 647 [2019-10-15 03:26:27,066 INFO L226 Difference]: Without dead ends: 469 [2019-10-15 03:26:27,068 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-15 03:26:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2019-10-15 03:26:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-15 03:26:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 652 transitions. [2019-10-15 03:26:27,120 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 652 transitions. Word has length 40 [2019-10-15 03:26:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:27,121 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 652 transitions. [2019-10-15 03:26:27,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 652 transitions. [2019-10-15 03:26:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:26:27,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:27,127 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] [2019-10-15 03:26:27,127 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:27,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1569876850, now seen corresponding path program 1 times [2019-10-15 03:26:27,128 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:27,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162558604] [2019-10-15 03:26:27,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,266 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-15 03:26:27,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162558604] [2019-10-15 03:26:27,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:27,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013413871] [2019-10-15 03:26:27,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:27,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:27,270 INFO L87 Difference]: Start difference. First operand 465 states and 652 transitions. Second operand 6 states. [2019-10-15 03:26:27,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:27,409 INFO L93 Difference]: Finished difference Result 907 states and 1281 transitions. [2019-10-15 03:26:27,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:27,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-10-15 03:26:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:27,413 INFO L225 Difference]: With dead ends: 907 [2019-10-15 03:26:27,413 INFO L226 Difference]: Without dead ends: 465 [2019-10-15 03:26:27,416 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-15 03:26:27,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-10-15 03:26:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-10-15 03:26:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-10-15 03:26:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 636 transitions. [2019-10-15 03:26:27,475 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 636 transitions. Word has length 42 [2019-10-15 03:26:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:27,476 INFO L462 AbstractCegarLoop]: Abstraction has 465 states and 636 transitions. [2019-10-15 03:26:27,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 636 transitions. [2019-10-15 03:26:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-15 03:26:27,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:27,484 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] [2019-10-15 03:26:27,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:27,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1757243213, now seen corresponding path program 1 times [2019-10-15 03:26:27,485 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:27,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229720307] [2019-10-15 03:26:27,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:27,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:27,650 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-15 03:26:27,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229720307] [2019-10-15 03:26:27,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:27,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 03:26:27,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723470961] [2019-10-15 03:26:27,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 03:26:27,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:27,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 03:26:27,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:27,652 INFO L87 Difference]: Start difference. First operand 465 states and 636 transitions. Second operand 8 states. [2019-10-15 03:26:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:27,942 INFO L93 Difference]: Finished difference Result 1155 states and 1611 transitions. [2019-10-15 03:26:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 03:26:27,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-10-15 03:26:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:27,950 INFO L225 Difference]: With dead ends: 1155 [2019-10-15 03:26:27,950 INFO L226 Difference]: Without dead ends: 1153 [2019-10-15 03:26:27,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2019-10-15 03:26:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 589. [2019-10-15 03:26:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 03:26:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 807 transitions. [2019-10-15 03:26:28,036 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 807 transitions. Word has length 42 [2019-10-15 03:26:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:28,038 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 807 transitions. [2019-10-15 03:26:28,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 03:26:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 807 transitions. [2019-10-15 03:26:28,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-15 03:26:28,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:28,041 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:28,041 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:28,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:28,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1027619730, now seen corresponding path program 1 times [2019-10-15 03:26:28,042 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:28,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105803372] [2019-10-15 03:26:28,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:28,043 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:28,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:28,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105803372] [2019-10-15 03:26:28,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301961397] [2019-10-15 03:26:28,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:28,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-15 03:26:28,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:29,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:29,375 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:29,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:29,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,822 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-10-15 03:26:29,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:29,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:29,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:30,322 WARN L191 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-10-15 03:26:30,519 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-10-15 03:26:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 03:26:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:30,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:30,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:30,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2146222396] [2019-10-15 03:26:30,977 INFO L162 IcfgInterpreter]: Started Sifa with 43 locations of interest [2019-10-15 03:26:30,977 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:26:30,983 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:26:30,992 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:26:30,992 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:26:31,725 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 162 for LOIs [2019-10-15 03:26:31,974 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2019-10-15 03:26:37,482 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 94 for LOIs [2019-10-15 03:26:37,530 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-15 03:26:38,268 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 92 [2019-10-15 03:26:38,863 WARN L191 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 94 [2019-10-15 03:26:40,295 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 237 DAG size of output: 153 [2019-10-15 03:26:41,459 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 215 DAG size of output: 154 [2019-10-15 03:26:42,670 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 219 DAG size of output: 158 [2019-10-15 03:26:43,866 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 227 DAG size of output: 166 [2019-10-15 03:26:45,125 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 228 DAG size of output: 165 [2019-10-15 03:26:46,367 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 231 DAG size of output: 163 [2019-10-15 03:26:47,742 WARN L191 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 233 DAG size of output: 161 [2019-10-15 03:26:49,078 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 236 DAG size of output: 164 [2019-10-15 03:26:50,502 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 237 DAG size of output: 163 [2019-10-15 03:26:51,929 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 240 DAG size of output: 161 [2019-10-15 03:26:53,357 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 242 DAG size of output: 159 [2019-10-15 03:26:54,794 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 245 DAG size of output: 162 [2019-10-15 03:26:56,265 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 246 DAG size of output: 161 [2019-10-15 03:26:57,750 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 249 DAG size of output: 159 [2019-10-15 03:26:59,245 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 251 DAG size of output: 156 [2019-10-15 03:27:00,777 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 254 DAG size of output: 159 [2019-10-15 03:27:02,347 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 256 DAG size of output: 161