/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/kundu1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:04:00,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:04:00,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:04:00,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:04:00,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:04:00,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:04:00,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:04:00,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:04:00,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:04:00,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:04:00,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:04:00,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:04:00,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:04:00,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:04:00,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:04:00,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:04:00,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:04:00,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:04:00,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:04:00,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:04:00,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:04:00,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:04:00,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:04:00,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:04:00,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:04:00,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:04:00,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:04:00,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:04:00,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:04:00,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:04:00,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:04:00,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:04:00,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:04:00,527 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:04:00,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:04:00,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:04:00,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:04:00,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:04:00,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:04:00,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:04:00,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:04:00,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:04:00,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:04:00,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:04:00,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:04:00,564 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:04:00,564 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:04:00,565 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:04:00,566 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:04:00,566 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:04:00,566 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:04:00,566 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:04:00,567 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:04:00,567 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:04:00,568 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:04:00,568 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:04:00,568 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:04:00,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:04:00,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:04:00,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:04:00,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:04:00,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:04:00,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:04:00,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:04:00,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:04:00,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:04:00,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:04:00,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:04:00,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:04:00,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:04:00,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:04:00,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:04:00,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:04:00,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:04:00,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:04:00,574 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:04:00,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:04:00,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:04:00,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:04:00,575 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:04:00,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:04:00,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:04:00,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:04:00,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:04:00,869 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:04:00,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/kundu1.cil.c [2019-11-24 06:04:00,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5001dd6/de820887962e42958eea324e962bab8f/FLAG695dca0e2 [2019-11-24 06:04:01,368 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:04:01,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/kundu1.cil.c [2019-11-24 06:04:01,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5001dd6/de820887962e42958eea324e962bab8f/FLAG695dca0e2 [2019-11-24 06:04:01,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c5001dd6/de820887962e42958eea324e962bab8f [2019-11-24 06:04:01,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:04:01,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:04:01,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:04:01,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:04:01,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:04:01,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:04:01" (1/1) ... [2019-11-24 06:04:01,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ef28fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:01, skipping insertion in model container [2019-11-24 06:04:01,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:04:01" (1/1) ... [2019-11-24 06:04:01,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:04:01,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:04:02,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:04:02,075 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:04:02,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:04:02,217 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:04:02,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02 WrapperNode [2019-11-24 06:04:02,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:04:02,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:04:02,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:04:02,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:04:02,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:04:02,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:04:02,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:04:02,265 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:04:02,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... [2019-11-24 06:04:02,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:04:02,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:04:02,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:04:02,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:04:02,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:04:02,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:04:02,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:04:03,341 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:04:03,341 INFO L284 CfgBuilder]: Removed 72 assume(true) statements. [2019-11-24 06:04:03,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:04:03 BoogieIcfgContainer [2019-11-24 06:04:03,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:04:03,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:04:03,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:04:03,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:04:03,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:04:01" (1/3) ... [2019-11-24 06:04:03,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793d4543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:04:03, skipping insertion in model container [2019-11-24 06:04:03,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:04:02" (2/3) ... [2019-11-24 06:04:03,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793d4543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:04:03, skipping insertion in model container [2019-11-24 06:04:03,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:04:03" (3/3) ... [2019-11-24 06:04:03,351 INFO L109 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2019-11-24 06:04:03,361 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:04:03,369 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-24 06:04:03,380 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-24 06:04:03,409 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:04:03,410 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:04:03,410 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:04:03,410 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:04:03,410 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:04:03,411 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:04:03,411 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:04:03,411 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:04:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-11-24 06:04:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:04:03,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:03,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:03,441 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1208173702, now seen corresponding path program 1 times [2019-11-24 06:04:03,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:03,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293283123] [2019-11-24 06:04:03,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:03,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293283123] [2019-11-24 06:04:03,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:03,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:03,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273491047] [2019-11-24 06:04:03,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:03,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:03,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:03,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:03,617 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-11-24 06:04:03,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:03,699 INFO L93 Difference]: Finished difference Result 176 states and 274 transitions. [2019-11-24 06:04:03,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:03,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:04:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:03,716 INFO L225 Difference]: With dead ends: 176 [2019-11-24 06:04:03,716 INFO L226 Difference]: Without dead ends: 110 [2019-11-24 06:04:03,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-24 06:04:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2019-11-24 06:04:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-24 06:04:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2019-11-24 06:04:03,763 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 16 [2019-11-24 06:04:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:03,763 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2019-11-24 06:04:03,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2019-11-24 06:04:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 06:04:03,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:03,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:03,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 137750023, now seen corresponding path program 1 times [2019-11-24 06:04:03,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:03,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516132600] [2019-11-24 06:04:03,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:03,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:03,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516132600] [2019-11-24 06:04:03,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:03,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:03,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979402874] [2019-11-24 06:04:03,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:03,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:03,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:03,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:03,830 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 3 states. [2019-11-24 06:04:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:03,925 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions. [2019-11-24 06:04:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:03,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 06:04:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:03,928 INFO L225 Difference]: With dead ends: 278 [2019-11-24 06:04:03,928 INFO L226 Difference]: Without dead ends: 182 [2019-11-24 06:04:03,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-24 06:04:03,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 162. [2019-11-24 06:04:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-24 06:04:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 233 transitions. [2019-11-24 06:04:03,950 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 233 transitions. Word has length 16 [2019-11-24 06:04:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:03,951 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 233 transitions. [2019-11-24 06:04:03,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 233 transitions. [2019-11-24 06:04:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 06:04:03,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:03,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:03,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:03,953 INFO L82 PathProgramCache]: Analyzing trace with hash -2019009583, now seen corresponding path program 1 times [2019-11-24 06:04:03,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:03,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116680195] [2019-11-24 06:04:03,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:04,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116680195] [2019-11-24 06:04:04,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:04,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:04,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467803129] [2019-11-24 06:04:04,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:04,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:04,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:04,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:04,108 INFO L87 Difference]: Start difference. First operand 162 states and 233 transitions. Second operand 5 states. [2019-11-24 06:04:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:04,304 INFO L93 Difference]: Finished difference Result 726 states and 1078 transitions. [2019-11-24 06:04:04,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 06:04:04,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 06:04:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:04,309 INFO L225 Difference]: With dead ends: 726 [2019-11-24 06:04:04,310 INFO L226 Difference]: Without dead ends: 572 [2019-11-24 06:04:04,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:04:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-11-24 06:04:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 294. [2019-11-24 06:04:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-11-24 06:04:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 427 transitions. [2019-11-24 06:04:04,366 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 427 transitions. Word has length 17 [2019-11-24 06:04:04,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:04,367 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 427 transitions. [2019-11-24 06:04:04,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 427 transitions. [2019-11-24 06:04:04,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 06:04:04,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:04,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:04,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:04,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1448539629, now seen corresponding path program 1 times [2019-11-24 06:04:04,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:04,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987623588] [2019-11-24 06:04:04,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:04,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987623588] [2019-11-24 06:04:04,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:04,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:04,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080461819] [2019-11-24 06:04:04,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:04,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:04,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,449 INFO L87 Difference]: Start difference. First operand 294 states and 427 transitions. Second operand 4 states. [2019-11-24 06:04:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:04,497 INFO L93 Difference]: Finished difference Result 527 states and 776 transitions. [2019-11-24 06:04:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:04,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-24 06:04:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:04,501 INFO L225 Difference]: With dead ends: 527 [2019-11-24 06:04:04,501 INFO L226 Difference]: Without dead ends: 373 [2019-11-24 06:04:04,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-24 06:04:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 365. [2019-11-24 06:04:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-24 06:04:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 533 transitions. [2019-11-24 06:04:04,544 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 533 transitions. Word has length 24 [2019-11-24 06:04:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:04,544 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 533 transitions. [2019-11-24 06:04:04,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 533 transitions. [2019-11-24 06:04:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 06:04:04,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:04,549 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:04,549 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1918787086, now seen corresponding path program 1 times [2019-11-24 06:04:04,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:04,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597664194] [2019-11-24 06:04:04,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:04,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597664194] [2019-11-24 06:04:04,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:04,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:04,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018296510] [2019-11-24 06:04:04,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:04,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,638 INFO L87 Difference]: Start difference. First operand 365 states and 533 transitions. Second operand 4 states. [2019-11-24 06:04:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:04,720 INFO L93 Difference]: Finished difference Result 1024 states and 1526 transitions. [2019-11-24 06:04:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:04,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-24 06:04:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:04,725 INFO L225 Difference]: With dead ends: 1024 [2019-11-24 06:04:04,725 INFO L226 Difference]: Without dead ends: 667 [2019-11-24 06:04:04,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-11-24 06:04:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 466. [2019-11-24 06:04:04,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-11-24 06:04:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 697 transitions. [2019-11-24 06:04:04,762 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 697 transitions. Word has length 25 [2019-11-24 06:04:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:04,762 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 697 transitions. [2019-11-24 06:04:04,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 697 transitions. [2019-11-24 06:04:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 06:04:04,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:04,764 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:04,764 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash -820984507, now seen corresponding path program 1 times [2019-11-24 06:04:04,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:04,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440682512] [2019-11-24 06:04:04,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:04,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440682512] [2019-11-24 06:04:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:04,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390646258] [2019-11-24 06:04:04,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:04,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,831 INFO L87 Difference]: Start difference. First operand 466 states and 697 transitions. Second operand 4 states. [2019-11-24 06:04:04,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:04,940 INFO L93 Difference]: Finished difference Result 1336 states and 2008 transitions. [2019-11-24 06:04:04,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:04,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-24 06:04:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:04,945 INFO L225 Difference]: With dead ends: 1336 [2019-11-24 06:04:04,945 INFO L226 Difference]: Without dead ends: 878 [2019-11-24 06:04:04,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-11-24 06:04:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 574. [2019-11-24 06:04:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-24 06:04:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 859 transitions. [2019-11-24 06:04:04,985 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 859 transitions. Word has length 27 [2019-11-24 06:04:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:04,986 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 859 transitions. [2019-11-24 06:04:04,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 859 transitions. [2019-11-24 06:04:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 06:04:04,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:04,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:04,987 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1901714217, now seen corresponding path program 1 times [2019-11-24 06:04:04,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:04,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595682244] [2019-11-24 06:04:04,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:05,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595682244] [2019-11-24 06:04:05,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:05,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 06:04:05,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302278859] [2019-11-24 06:04:05,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 06:04:05,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 06:04:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-24 06:04:05,087 INFO L87 Difference]: Start difference. First operand 574 states and 859 transitions. Second operand 7 states. [2019-11-24 06:04:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:05,457 INFO L93 Difference]: Finished difference Result 2385 states and 3583 transitions. [2019-11-24 06:04:05,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 06:04:05,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-24 06:04:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:05,468 INFO L225 Difference]: With dead ends: 2385 [2019-11-24 06:04:05,468 INFO L226 Difference]: Without dead ends: 1819 [2019-11-24 06:04:05,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:04:05,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2019-11-24 06:04:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 798. [2019-11-24 06:04:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-11-24 06:04:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1199 transitions. [2019-11-24 06:04:05,537 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1199 transitions. Word has length 27 [2019-11-24 06:04:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:05,539 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1199 transitions. [2019-11-24 06:04:05,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 06:04:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1199 transitions. [2019-11-24 06:04:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 06:04:05,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:05,543 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:05,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1344892011, now seen corresponding path program 1 times [2019-11-24 06:04:05,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:05,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592264534] [2019-11-24 06:04:05,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:05,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592264534] [2019-11-24 06:04:05,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:05,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:05,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423841752] [2019-11-24 06:04:05,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:05,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:05,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:05,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:05,619 INFO L87 Difference]: Start difference. First operand 798 states and 1199 transitions. Second operand 3 states. [2019-11-24 06:04:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:05,678 INFO L93 Difference]: Finished difference Result 1400 states and 2110 transitions. [2019-11-24 06:04:05,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:05,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 06:04:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:05,683 INFO L225 Difference]: With dead ends: 1400 [2019-11-24 06:04:05,683 INFO L226 Difference]: Without dead ends: 818 [2019-11-24 06:04:05,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-24 06:04:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 798. [2019-11-24 06:04:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-11-24 06:04:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1179 transitions. [2019-11-24 06:04:05,737 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1179 transitions. Word has length 39 [2019-11-24 06:04:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:05,737 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 1179 transitions. [2019-11-24 06:04:05,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1179 transitions. [2019-11-24 06:04:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 06:04:05,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:05,739 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:05,739 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:05,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1958910612, now seen corresponding path program 1 times [2019-11-24 06:04:05,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:05,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146925004] [2019-11-24 06:04:05,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:05,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146925004] [2019-11-24 06:04:05,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:05,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:05,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72638555] [2019-11-24 06:04:05,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:05,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:05,804 INFO L87 Difference]: Start difference. First operand 798 states and 1179 transitions. Second operand 3 states. [2019-11-24 06:04:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:05,895 INFO L93 Difference]: Finished difference Result 2048 states and 3055 transitions. [2019-11-24 06:04:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:05,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 06:04:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:05,903 INFO L225 Difference]: With dead ends: 2048 [2019-11-24 06:04:05,903 INFO L226 Difference]: Without dead ends: 1466 [2019-11-24 06:04:05,905 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-11-24 06:04:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1460. [2019-11-24 06:04:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-11-24 06:04:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2177 transitions. [2019-11-24 06:04:05,997 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2177 transitions. Word has length 39 [2019-11-24 06:04:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:05,997 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2177 transitions. [2019-11-24 06:04:05,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2177 transitions. [2019-11-24 06:04:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:04:05,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:05,999 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:06,000 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1645190002, now seen corresponding path program 1 times [2019-11-24 06:04:06,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:06,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755661508] [2019-11-24 06:04:06,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:06,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755661508] [2019-11-24 06:04:06,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:06,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:06,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600963331] [2019-11-24 06:04:06,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:06,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:06,083 INFO L87 Difference]: Start difference. First operand 1460 states and 2177 transitions. Second operand 3 states. [2019-11-24 06:04:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:06,178 INFO L93 Difference]: Finished difference Result 2912 states and 4346 transitions. [2019-11-24 06:04:06,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:06,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 06:04:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:06,195 INFO L225 Difference]: With dead ends: 2912 [2019-11-24 06:04:06,195 INFO L226 Difference]: Without dead ends: 1460 [2019-11-24 06:04:06,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-24 06:04:06,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1460. [2019-11-24 06:04:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-11-24 06:04:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2156 transitions. [2019-11-24 06:04:06,291 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2156 transitions. Word has length 40 [2019-11-24 06:04:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:06,292 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2156 transitions. [2019-11-24 06:04:06,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2156 transitions. [2019-11-24 06:04:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 06:04:06,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:06,294 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:06,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1798000326, now seen corresponding path program 1 times [2019-11-24 06:04:06,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:06,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428332466] [2019-11-24 06:04:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:06,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428332466] [2019-11-24 06:04:06,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:06,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:06,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906826050] [2019-11-24 06:04:06,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:06,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:06,368 INFO L87 Difference]: Start difference. First operand 1460 states and 2156 transitions. Second operand 3 states. [2019-11-24 06:04:06,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:06,523 INFO L93 Difference]: Finished difference Result 3644 states and 5330 transitions. [2019-11-24 06:04:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:06,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 06:04:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:06,535 INFO L225 Difference]: With dead ends: 3644 [2019-11-24 06:04:06,535 INFO L226 Difference]: Without dead ends: 2192 [2019-11-24 06:04:06,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-11-24 06:04:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2190. [2019-11-24 06:04:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2190 states. [2019-11-24 06:04:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3125 transitions. [2019-11-24 06:04:06,729 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3125 transitions. Word has length 40 [2019-11-24 06:04:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:06,729 INFO L462 AbstractCegarLoop]: Abstraction has 2190 states and 3125 transitions. [2019-11-24 06:04:06,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3125 transitions. [2019-11-24 06:04:06,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 06:04:06,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:06,732 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:06,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:06,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:06,733 INFO L82 PathProgramCache]: Analyzing trace with hash -889708313, now seen corresponding path program 1 times [2019-11-24 06:04:06,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:06,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305308796] [2019-11-24 06:04:06,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:06,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305308796] [2019-11-24 06:04:06,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:06,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:06,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061797154] [2019-11-24 06:04:06,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:06,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:06,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:06,778 INFO L87 Difference]: Start difference. First operand 2190 states and 3125 transitions. Second operand 3 states. [2019-11-24 06:04:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:07,040 INFO L93 Difference]: Finished difference Result 4962 states and 7106 transitions. [2019-11-24 06:04:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:07,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 06:04:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:07,056 INFO L225 Difference]: With dead ends: 4962 [2019-11-24 06:04:07,057 INFO L226 Difference]: Without dead ends: 2780 [2019-11-24 06:04:07,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-11-24 06:04:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2716. [2019-11-24 06:04:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-11-24 06:04:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3779 transitions. [2019-11-24 06:04:07,300 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3779 transitions. Word has length 41 [2019-11-24 06:04:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:07,300 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 3779 transitions. [2019-11-24 06:04:07,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3779 transitions. [2019-11-24 06:04:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 06:04:07,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:07,302 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:07,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:07,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2122125699, now seen corresponding path program 1 times [2019-11-24 06:04:07,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:07,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708910768] [2019-11-24 06:04:07,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:07,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708910768] [2019-11-24 06:04:07,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692313310] [2019-11-24 06:04:07,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:07,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 06:04:07,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:04:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:07,566 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:04:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:07,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [410280276] [2019-11-24 06:04:07,665 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2019-11-24 06:04:07,665 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:04:07,681 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:04:07,691 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:04:07,692 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:04:09,629 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:04:10,027 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-11-24 06:04:10,257 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-11-24 06:04:10,466 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-11-24 06:04:11,125 WARN L192 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 84 [2019-11-24 06:04:11,818 WARN L192 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 93 [2019-11-24 06:04:12,350 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 65 [2019-11-24 06:04:12,589 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 66 [2019-11-24 06:04:12,862 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 75 [2019-11-24 06:04:13,150 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-11-24 06:04:13,593 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 76 [2019-11-24 06:04:14,082 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-11-24 06:04:14,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:04:14,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [6, 4, 4] total 22 [2019-11-24 06:04:14,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311236342] [2019-11-24 06:04:14,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-24 06:04:14,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-24 06:04:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-11-24 06:04:14,166 INFO L87 Difference]: Start difference. First operand 2716 states and 3779 transitions. Second operand 15 states. [2019-11-24 06:04:14,574 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-11-24 06:04:15,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:15,380 INFO L93 Difference]: Finished difference Result 5448 states and 7585 transitions. [2019-11-24 06:04:15,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-24 06:04:15,381 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-11-24 06:04:15,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:15,397 INFO L225 Difference]: With dead ends: 5448 [2019-11-24 06:04:15,397 INFO L226 Difference]: Without dead ends: 2740 [2019-11-24 06:04:15,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-24 06:04:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2019-11-24 06:04:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2739. [2019-11-24 06:04:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2739 states. [2019-11-24 06:04:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 3807 transitions. [2019-11-24 06:04:15,652 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 3807 transitions. Word has length 41 [2019-11-24 06:04:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:15,652 INFO L462 AbstractCegarLoop]: Abstraction has 2739 states and 3807 transitions. [2019-11-24 06:04:15,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-24 06:04:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3807 transitions. [2019-11-24 06:04:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:04:15,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:15,654 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:15,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:15,859 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1432714486, now seen corresponding path program 1 times [2019-11-24 06:04:15,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:15,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435106349] [2019-11-24 06:04:15,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 06:04:15,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435106349] [2019-11-24 06:04:15,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:15,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:15,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892464324] [2019-11-24 06:04:15,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:15,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:15,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:15,968 INFO L87 Difference]: Start difference. First operand 2739 states and 3807 transitions. Second operand 3 states. [2019-11-24 06:04:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:16,298 INFO L93 Difference]: Finished difference Result 6933 states and 9420 transitions. [2019-11-24 06:04:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:16,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-24 06:04:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:16,320 INFO L225 Difference]: With dead ends: 6933 [2019-11-24 06:04:16,321 INFO L226 Difference]: Without dead ends: 4220 [2019-11-24 06:04:16,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2019-11-24 06:04:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 4213. [2019-11-24 06:04:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4213 states. [2019-11-24 06:04:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 5529 transitions. [2019-11-24 06:04:16,580 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 5529 transitions. Word has length 42 [2019-11-24 06:04:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:16,581 INFO L462 AbstractCegarLoop]: Abstraction has 4213 states and 5529 transitions. [2019-11-24 06:04:16,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 5529 transitions. [2019-11-24 06:04:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 06:04:16,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:16,582 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:16,582 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:16,583 INFO L82 PathProgramCache]: Analyzing trace with hash -583875274, now seen corresponding path program 1 times [2019-11-24 06:04:16,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:16,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43991554] [2019-11-24 06:04:16,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:16,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43991554] [2019-11-24 06:04:16,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:16,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:16,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607990871] [2019-11-24 06:04:16,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:16,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:16,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:16,622 INFO L87 Difference]: Start difference. First operand 4213 states and 5529 transitions. Second operand 4 states. [2019-11-24 06:04:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:16,978 INFO L93 Difference]: Finished difference Result 8824 states and 11601 transitions. [2019-11-24 06:04:16,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:16,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-11-24 06:04:16,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:16,999 INFO L225 Difference]: With dead ends: 8824 [2019-11-24 06:04:17,000 INFO L226 Difference]: Without dead ends: 4634 [2019-11-24 06:04:17,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2019-11-24 06:04:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4542. [2019-11-24 06:04:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4542 states. [2019-11-24 06:04:17,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4542 states to 4542 states and 5914 transitions. [2019-11-24 06:04:17,282 INFO L78 Accepts]: Start accepts. Automaton has 4542 states and 5914 transitions. Word has length 43 [2019-11-24 06:04:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:17,284 INFO L462 AbstractCegarLoop]: Abstraction has 4542 states and 5914 transitions. [2019-11-24 06:04:17,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4542 states and 5914 transitions. [2019-11-24 06:04:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-24 06:04:17,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:17,286 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 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] [2019-11-24 06:04:17,286 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash -779726822, now seen corresponding path program 1 times [2019-11-24 06:04:17,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:17,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492169951] [2019-11-24 06:04:17,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492169951] [2019-11-24 06:04:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010734336] [2019-11-24 06:04:17,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:17,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-24 06:04:17,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:04:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:17,486 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:04:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:17,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 06:04:17,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 8 [2019-11-24 06:04:17,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124111453] [2019-11-24 06:04:17,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 06:04:17,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 06:04:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-24 06:04:17,516 INFO L87 Difference]: Start difference. First operand 4542 states and 5914 transitions. Second operand 6 states. [2019-11-24 06:04:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:17,810 INFO L93 Difference]: Finished difference Result 7260 states and 9634 transitions. [2019-11-24 06:04:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 06:04:17,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-11-24 06:04:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:17,835 INFO L225 Difference]: With dead ends: 7260 [2019-11-24 06:04:17,836 INFO L226 Difference]: Without dead ends: 2972 [2019-11-24 06:04:17,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-24 06:04:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2019-11-24 06:04:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2368. [2019-11-24 06:04:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-11-24 06:04:17,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3171 transitions. [2019-11-24 06:04:17,987 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3171 transitions. Word has length 44 [2019-11-24 06:04:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:17,987 INFO L462 AbstractCegarLoop]: Abstraction has 2368 states and 3171 transitions. [2019-11-24 06:04:17,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 06:04:17,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3171 transitions. [2019-11-24 06:04:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:04:17,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:17,989 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:18,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:18,193 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash -267024189, now seen corresponding path program 1 times [2019-11-24 06:04:18,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:18,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689624143] [2019-11-24 06:04:18,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:18,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689624143] [2019-11-24 06:04:18,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:18,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:04:18,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139519807] [2019-11-24 06:04:18,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:18,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:18,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:18,248 INFO L87 Difference]: Start difference. First operand 2368 states and 3171 transitions. Second operand 3 states. [2019-11-24 06:04:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:18,485 INFO L93 Difference]: Finished difference Result 4700 states and 6297 transitions. [2019-11-24 06:04:18,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:18,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:04:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:18,491 INFO L225 Difference]: With dead ends: 4700 [2019-11-24 06:04:18,491 INFO L226 Difference]: Without dead ends: 2374 [2019-11-24 06:04:18,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-11-24 06:04:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2368. [2019-11-24 06:04:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2368 states. [2019-11-24 06:04:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2368 states to 2368 states and 3161 transitions. [2019-11-24 06:04:18,633 INFO L78 Accepts]: Start accepts. Automaton has 2368 states and 3161 transitions. Word has length 49 [2019-11-24 06:04:18,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:18,634 INFO L462 AbstractCegarLoop]: Abstraction has 2368 states and 3161 transitions. [2019-11-24 06:04:18,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2368 states and 3161 transitions. [2019-11-24 06:04:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 06:04:18,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:18,635 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:18,635 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:18,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1337447868, now seen corresponding path program 1 times [2019-11-24 06:04:18,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:18,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115308501] [2019-11-24 06:04:18,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:04:18,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115308501] [2019-11-24 06:04:18,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:18,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:04:18,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105050697] [2019-11-24 06:04:18,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:04:18,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:04:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:18,688 INFO L87 Difference]: Start difference. First operand 2368 states and 3161 transitions. Second operand 3 states. [2019-11-24 06:04:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:18,804 INFO L93 Difference]: Finished difference Result 3712 states and 4974 transitions. [2019-11-24 06:04:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:04:18,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 06:04:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:18,808 INFO L225 Difference]: With dead ends: 3712 [2019-11-24 06:04:18,808 INFO L226 Difference]: Without dead ends: 1386 [2019-11-24 06:04:18,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:04:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-11-24 06:04:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1338. [2019-11-24 06:04:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-11-24 06:04:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1707 transitions. [2019-11-24 06:04:18,903 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1707 transitions. Word has length 49 [2019-11-24 06:04:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:18,904 INFO L462 AbstractCegarLoop]: Abstraction has 1338 states and 1707 transitions. [2019-11-24 06:04:18,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:04:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1707 transitions. [2019-11-24 06:04:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:04:18,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:18,906 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 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] [2019-11-24 06:04:18,906 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:18,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1452283833, now seen corresponding path program 1 times [2019-11-24 06:04:18,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:18,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870985793] [2019-11-24 06:04:18,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:18,985 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:04:18,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870985793] [2019-11-24 06:04:18,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:18,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 06:04:18,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804955330] [2019-11-24 06:04:18,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 06:04:18,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:18,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 06:04:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 06:04:18,988 INFO L87 Difference]: Start difference. First operand 1338 states and 1707 transitions. Second operand 5 states. [2019-11-24 06:04:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:19,306 INFO L93 Difference]: Finished difference Result 3656 states and 4687 transitions. [2019-11-24 06:04:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 06:04:19,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 06:04:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:19,315 INFO L225 Difference]: With dead ends: 3656 [2019-11-24 06:04:19,315 INFO L226 Difference]: Without dead ends: 2510 [2019-11-24 06:04:19,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 06:04:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2019-11-24 06:04:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 1492. [2019-11-24 06:04:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-11-24 06:04:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1897 transitions. [2019-11-24 06:04:19,447 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1897 transitions. Word has length 50 [2019-11-24 06:04:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:19,447 INFO L462 AbstractCegarLoop]: Abstraction has 1492 states and 1897 transitions. [2019-11-24 06:04:19,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 06:04:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1897 transitions. [2019-11-24 06:04:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 06:04:19,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:19,449 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-11-24 06:04:19,449 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 806557985, now seen corresponding path program 1 times [2019-11-24 06:04:19,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:19,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015882943] [2019-11-24 06:04:19,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:19,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015882943] [2019-11-24 06:04:19,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:04:19,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:04:19,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608743088] [2019-11-24 06:04:19,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:04:19,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:19,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:04:19,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:19,521 INFO L87 Difference]: Start difference. First operand 1492 states and 1897 transitions. Second operand 4 states. [2019-11-24 06:04:19,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:19,695 INFO L93 Difference]: Finished difference Result 3057 states and 3859 transitions. [2019-11-24 06:04:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:04:19,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 06:04:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:19,702 INFO L225 Difference]: With dead ends: 3057 [2019-11-24 06:04:19,702 INFO L226 Difference]: Without dead ends: 1719 [2019-11-24 06:04:19,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:04:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-11-24 06:04:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1476. [2019-11-24 06:04:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-11-24 06:04:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 1827 transitions. [2019-11-24 06:04:19,903 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 1827 transitions. Word has length 50 [2019-11-24 06:04:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:19,904 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 1827 transitions. [2019-11-24 06:04:19,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:04:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 1827 transitions. [2019-11-24 06:04:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 06:04:19,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:19,910 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 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-11-24 06:04:19,910 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash 958549301, now seen corresponding path program 1 times [2019-11-24 06:04:19,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:19,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806368799] [2019-11-24 06:04:19,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:20,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806368799] [2019-11-24 06:04:20,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756622404] [2019-11-24 06:04:20,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:20,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 06:04:20,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:04:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:20,129 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:04:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:20,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [131903757] [2019-11-24 06:04:20,154 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2019-11-24 06:04:20,154 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:04:20,156 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:04:20,156 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:04:20,156 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:04:22,336 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 206 [2019-11-24 06:04:22,513 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 206 [2019-11-24 06:04:22,746 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 206 [2019-11-24 06:04:22,937 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 206 [2019-11-24 06:04:23,122 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 204 [2019-11-24 06:04:28,265 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 196 [2019-11-24 06:04:28,460 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 196 [2019-11-24 06:04:28,568 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 196 [2019-11-24 06:04:29,242 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:04:29,575 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-11-24 06:04:29,755 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-24 06:04:30,510 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 108 [2019-11-24 06:04:31,661 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 200 DAG size of output: 113 [2019-11-24 06:04:32,894 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 203 DAG size of output: 123 [2019-11-24 06:04:33,853 WARN L192 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 118 [2019-11-24 06:04:34,796 WARN L192 SmtUtils]: Spent 849.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 109 [2019-11-24 06:04:36,116 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 176 DAG size of output: 114 [2019-11-24 06:04:36,804 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 89 [2019-11-24 06:04:37,557 WARN L192 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2019-11-24 06:04:38,740 WARN L192 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 109 [2019-11-24 06:04:39,622 WARN L192 SmtUtils]: Spent 775.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 108 [2019-11-24 06:04:40,623 WARN L192 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 89 [2019-11-24 06:04:41,358 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 84 [2019-11-24 06:04:42,040 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 77 [2019-11-24 06:04:43,070 WARN L192 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 80 [2019-11-24 06:04:43,810 WARN L192 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 80 [2019-11-24 06:04:45,135 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 82 [2019-11-24 06:04:46,207 WARN L192 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 267 DAG size of output: 88 [2019-11-24 06:04:47,098 WARN L192 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 80 [2019-11-24 06:04:48,224 WARN L192 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 82 [2019-11-24 06:04:48,866 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 81 [2019-11-24 06:04:50,167 WARN L192 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 83 [2019-11-24 06:04:51,044 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 87 [2019-11-24 06:04:51,809 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 95 [2019-11-24 06:04:52,609 WARN L192 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 86 [2019-11-24 06:04:52,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:04:52,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [4, 4, 4] total 32 [2019-11-24 06:04:52,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710065724] [2019-11-24 06:04:52,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-24 06:04:52,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:04:52,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-24 06:04:52,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 06:04:52,614 INFO L87 Difference]: Start difference. First operand 1476 states and 1827 transitions. Second operand 30 states. [2019-11-24 06:04:53,073 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 53 [2019-11-24 06:04:53,956 WARN L192 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 113 [2019-11-24 06:04:54,439 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 69 [2019-11-24 06:04:55,547 WARN L192 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2019-11-24 06:04:57,379 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2019-11-24 06:04:59,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:04:59,370 INFO L93 Difference]: Finished difference Result 3012 states and 3738 transitions. [2019-11-24 06:04:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-24 06:04:59,370 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-11-24 06:04:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:04:59,373 INFO L225 Difference]: With dead ends: 3012 [2019-11-24 06:04:59,374 INFO L226 Difference]: Without dead ends: 1549 [2019-11-24 06:04:59,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 15 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=141, Invalid=1265, Unknown=0, NotChecked=0, Total=1406 [2019-11-24 06:04:59,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-11-24 06:04:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1479. [2019-11-24 06:04:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1479 states. [2019-11-24 06:04:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 1828 transitions. [2019-11-24 06:04:59,465 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 1828 transitions. Word has length 58 [2019-11-24 06:04:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:04:59,465 INFO L462 AbstractCegarLoop]: Abstraction has 1479 states and 1828 transitions. [2019-11-24 06:04:59,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-24 06:04:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 1828 transitions. [2019-11-24 06:04:59,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 06:04:59,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:04:59,467 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:04:59,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:59,671 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:04:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:04:59,671 INFO L82 PathProgramCache]: Analyzing trace with hash 736719378, now seen corresponding path program 1 times [2019-11-24 06:04:59,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:04:59,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728785056] [2019-11-24 06:04:59,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:04:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 06:04:59,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728785056] [2019-11-24 06:04:59,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015577189] [2019-11-24 06:04:59,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:04:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:04:59,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-24 06:04:59,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:04:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:59,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:04:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 06:04:59,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1195313744] [2019-11-24 06:04:59,950 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2019-11-24 06:04:59,950 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:04:59,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:04:59,951 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:04:59,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:05:01,659 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 180 [2019-11-24 06:05:01,766 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 178 [2019-11-24 06:05:01,880 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 202 [2019-11-24 06:05:01,987 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 202 [2019-11-24 06:05:02,351 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 180 [2019-11-24 06:05:02,497 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 213 DAG size of output: 180 [2019-11-24 06:05:02,630 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 167 [2019-11-24 06:05:02,905 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2019-11-24 06:05:03,136 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2019-11-24 06:05:03,290 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 204 [2019-11-24 06:05:03,479 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 219 DAG size of output: 205 [2019-11-24 06:05:03,748 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 254 [2019-11-24 06:05:04,011 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 239 [2019-11-24 06:05:04,150 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 239 [2019-11-24 06:05:04,260 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 237 [2019-11-24 06:05:04,433 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 295 [2019-11-24 06:05:04,603 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 311 DAG size of output: 295 [2019-11-24 06:05:04,769 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 294 [2019-11-24 06:05:05,241 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 260 [2019-11-24 06:05:05,398 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 320 DAG size of output: 260 [2019-11-24 06:05:05,518 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 249 [2019-11-24 06:05:05,714 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 289 [2019-11-24 06:05:05,878 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 333 DAG size of output: 289 [2019-11-24 06:05:06,025 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 278 [2019-11-24 06:05:06,438 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 317 [2019-11-24 06:05:06,664 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 317 [2019-11-24 06:05:06,797 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 314 DAG size of output: 312 [2019-11-24 06:05:07,862 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 226 [2019-11-24 06:05:08,173 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 289 [2019-11-24 06:05:08,316 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 289 [2019-11-24 06:05:08,437 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 286 DAG size of output: 277 [2019-11-24 06:05:08,632 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 200 [2019-11-24 06:05:08,806 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 200 [2019-11-24 06:05:08,921 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2019-11-24 06:05:09,102 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 259 [2019-11-24 06:05:09,244 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 259 [2019-11-24 06:05:09,372 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 253 [2019-11-24 06:05:09,539 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:09,683 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:09,842 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:09,986 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:10,130 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:10,278 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 290 [2019-11-24 06:05:10,861 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2019-11-24 06:05:12,029 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:12,206 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:12,390 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:12,561 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:12,732 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:12,908 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 307 [2019-11-24 06:05:13,119 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 355 DAG size of output: 323 [2019-11-24 06:05:13,325 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 355 DAG size of output: 323 [2019-11-24 06:05:13,526 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 320 [2019-11-24 06:05:13,751 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 355 DAG size of output: 323 [2019-11-24 06:05:13,956 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 355 DAG size of output: 323 [2019-11-24 06:05:14,158 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 320 [2019-11-24 06:05:14,410 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 327 [2019-11-24 06:05:14,656 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 327 [2019-11-24 06:05:14,887 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 327 [2019-11-24 06:05:15,062 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:15,186 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:15,402 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:15,527 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:15,739 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:15,866 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 240 [2019-11-24 06:05:16,154 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2019-11-24 06:05:16,329 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2019-11-24 06:05:16,523 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2019-11-24 06:05:16,783 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 285 [2019-11-24 06:05:17,024 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 285 [2019-11-24 06:05:17,198 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2019-11-24 06:05:17,431 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 285 [2019-11-24 06:05:17,659 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 285 [2019-11-24 06:05:17,844 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2019-11-24 06:05:17,887 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:05:18,267 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-11-24 06:05:18,486 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-11-24 06:05:19,790 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 307 DAG size of output: 132 [2019-11-24 06:05:22,199 WARN L192 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 313 DAG size of output: 152