/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/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:18:28,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:18:28,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:18:28,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:18:28,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:18:28,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:18:28,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:18:28,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:18:28,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:18:28,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:18:28,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:18:28,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:18:28,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:18:28,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:18:28,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:18:28,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:18:28,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:18:28,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:18:28,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:18:28,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:18:28,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:18:28,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:18:28,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:18:28,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:18:28,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:18:28,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:18:28,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:18:28,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:18:28,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:18:28,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:18:28,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:18:28,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:18:28,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:18:28,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:18:28,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:18:28,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:18:28,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:18:28,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:18:28,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:18:28,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:18:28,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:18:28,350 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 04:18:28,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:18:28,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:18:28,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:18:28,388 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:18:28,388 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:18:28,388 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:18:28,389 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:18:28,389 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:18:28,389 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:18:28,389 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:18:28,389 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:18:28,390 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:18:28,390 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:18:28,390 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:18:28,390 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:18:28,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:18:28,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:18:28,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:18:28,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:18:28,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:18:28,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:18:28,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:18:28,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:18:28,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:18:28,395 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:18:28,395 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:18:28,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:18:28,396 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:18:28,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:18:28,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:18:28,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:18:28,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:18:28,397 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:18:28,397 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:18:28,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:18:28,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:18:28,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:18:28,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:18:28,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:18:28,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:18:28,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:18:28,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:18:28,735 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:18:28,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-24 04:18:28,809 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f3e04c/3480e6ed3b884d0facfb68df09f7988d/FLAG10602ac20 [2019-11-24 04:18:29,269 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:18:29,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2019-11-24 04:18:29,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f3e04c/3480e6ed3b884d0facfb68df09f7988d/FLAG10602ac20 [2019-11-24 04:18:29,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42f3e04c/3480e6ed3b884d0facfb68df09f7988d [2019-11-24 04:18:29,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:18:29,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:18:29,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:29,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:18:29,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:18:29,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:29" (1/1) ... [2019-11-24 04:18:29,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6163be9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:29, skipping insertion in model container [2019-11-24 04:18:29,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:18:29" (1/1) ... [2019-11-24 04:18:29,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:18:29,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:18:29,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:29,982 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:18:30,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:18:30,137 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:18:30,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30 WrapperNode [2019-11-24 04:18:30,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:18:30,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:30,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:18:30,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:18:30,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:18:30,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:18:30,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:18:30,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:18:30,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (1/1) ... [2019-11-24 04:18:30,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:18:30,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:18:30,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:18:30,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:18:30,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (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 04:18:30,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:18:30,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:18:30,752 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:18:30,752 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 04:18:30,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:30 BoogieIcfgContainer [2019-11-24 04:18:30,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:18:30,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:18:30,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:18:30,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:18:30,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:18:29" (1/3) ... [2019-11-24 04:18:30,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c9730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:30, skipping insertion in model container [2019-11-24 04:18:30,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:18:30" (2/3) ... [2019-11-24 04:18:30,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23c9730b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:18:30, skipping insertion in model container [2019-11-24 04:18:30,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:18:30" (3/3) ... [2019-11-24 04:18:30,762 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2019-11-24 04:18:30,771 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:18:30,779 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-11-24 04:18:30,791 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-11-24 04:18:30,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:18:30,816 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:18:30,816 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:18:30,816 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:18:30,816 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:18:30,817 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:18:30,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:18:30,817 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:18:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-24 04:18:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:18:30,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:30,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:30,843 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:30,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:30,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1091334804, now seen corresponding path program 1 times [2019-11-24 04:18:30,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:30,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213228669] [2019-11-24 04:18:30,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:31,018 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 04:18:31,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213228669] [2019-11-24 04:18:31,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:31,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:18:31,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008537148] [2019-11-24 04:18:31,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:18:31,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:31,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:18:31,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:31,040 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2019-11-24 04:18:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:31,077 INFO L93 Difference]: Finished difference Result 84 states and 119 transitions. [2019-11-24 04:18:31,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:18:31,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-24 04:18:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:31,091 INFO L225 Difference]: With dead ends: 84 [2019-11-24 04:18:31,092 INFO L226 Difference]: Without dead ends: 75 [2019-11-24 04:18:31,095 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 04:18:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-24 04:18:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-24 04:18:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-24 04:18:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2019-11-24 04:18:31,142 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 14 [2019-11-24 04:18:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:31,143 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2019-11-24 04:18:31,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:18:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2019-11-24 04:18:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:18:31,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:31,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:31,145 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 528363536, now seen corresponding path program 1 times [2019-11-24 04:18:31,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:31,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737508735] [2019-11-24 04:18:31,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:31,238 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 04:18:31,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737508735] [2019-11-24 04:18:31,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:31,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:31,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214592948] [2019-11-24 04:18:31,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:31,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:31,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:31,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:31,242 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2019-11-24 04:18:31,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:31,348 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2019-11-24 04:18:31,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:31,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 04:18:31,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:31,350 INFO L225 Difference]: With dead ends: 75 [2019-11-24 04:18:31,350 INFO L226 Difference]: Without dead ends: 73 [2019-11-24 04:18:31,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-24 04:18:31,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-24 04:18:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-24 04:18:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2019-11-24 04:18:31,362 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 15 [2019-11-24 04:18:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:31,362 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2019-11-24 04:18:31,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2019-11-24 04:18:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:18:31,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:31,364 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 04:18:31,364 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 951344371, now seen corresponding path program 1 times [2019-11-24 04:18:31,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:31,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896052619] [2019-11-24 04:18:31,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:31,424 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 04:18:31,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896052619] [2019-11-24 04:18:31,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:31,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:18:31,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707859774] [2019-11-24 04:18:31,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:18:31,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:31,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:18:31,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:18:31,427 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 4 states. [2019-11-24 04:18:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:31,563 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2019-11-24 04:18:31,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:31,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:18:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:31,566 INFO L225 Difference]: With dead ends: 96 [2019-11-24 04:18:31,566 INFO L226 Difference]: Without dead ends: 94 [2019-11-24 04:18:31,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-24 04:18:31,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-11-24 04:18:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-24 04:18:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-11-24 04:18:31,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 17 [2019-11-24 04:18:31,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:31,592 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-11-24 04:18:31,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:18:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-11-24 04:18:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:18:31,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:31,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:31,594 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash -573091462, now seen corresponding path program 1 times [2019-11-24 04:18:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:31,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883699006] [2019-11-24 04:18:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:31,697 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 04:18:31,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883699006] [2019-11-24 04:18:31,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:31,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:31,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607011895] [2019-11-24 04:18:31,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:31,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:31,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:31,701 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 5 states. [2019-11-24 04:18:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:31,786 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-11-24 04:18:31,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:31,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:18:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:31,788 INFO L225 Difference]: With dead ends: 71 [2019-11-24 04:18:31,788 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 04:18:31,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 04:18:31,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-24 04:18:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-24 04:18:31,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-11-24 04:18:31,796 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 18 [2019-11-24 04:18:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:31,796 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-11-24 04:18:31,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-11-24 04:18:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:18:31,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:31,798 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] [2019-11-24 04:18:31,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash -468627622, now seen corresponding path program 1 times [2019-11-24 04:18:31,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:31,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128127332] [2019-11-24 04:18:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:31,890 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 04:18:31,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128127332] [2019-11-24 04:18:31,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:31,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:31,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787518179] [2019-11-24 04:18:31,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:31,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:31,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:31,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:31,893 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2019-11-24 04:18:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:32,089 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2019-11-24 04:18:32,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:18:32,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:18:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:32,093 INFO L225 Difference]: With dead ends: 136 [2019-11-24 04:18:32,093 INFO L226 Difference]: Without dead ends: 134 [2019-11-24 04:18:32,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-24 04:18:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-24 04:18:32,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-24 04:18:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-11-24 04:18:32,109 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 21 [2019-11-24 04:18:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:32,110 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-11-24 04:18:32,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-11-24 04:18:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:18:32,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:32,112 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] [2019-11-24 04:18:32,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash -464459857, now seen corresponding path program 1 times [2019-11-24 04:18:32,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:32,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478042021] [2019-11-24 04:18:32,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:32,232 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 04:18:32,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478042021] [2019-11-24 04:18:32,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:32,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:32,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339753656] [2019-11-24 04:18:32,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:32,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:32,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:32,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:32,238 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 5 states. [2019-11-24 04:18:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:32,377 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2019-11-24 04:18:32,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:18:32,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:18:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:32,378 INFO L225 Difference]: With dead ends: 103 [2019-11-24 04:18:32,379 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 04:18:32,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:18:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 04:18:32,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 74. [2019-11-24 04:18:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-24 04:18:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-11-24 04:18:32,387 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 21 [2019-11-24 04:18:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:32,387 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-11-24 04:18:32,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-11-24 04:18:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:18:32,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:32,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:32,389 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1642550139, now seen corresponding path program 1 times [2019-11-24 04:18:32,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:32,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487593990] [2019-11-24 04:18:32,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:32,468 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 04:18:32,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487593990] [2019-11-24 04:18:32,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:32,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:32,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815864413] [2019-11-24 04:18:32,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:32,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:32,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:32,472 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2019-11-24 04:18:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:32,585 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-11-24 04:18:32,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:32,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:18:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:32,587 INFO L225 Difference]: With dead ends: 116 [2019-11-24 04:18:32,587 INFO L226 Difference]: Without dead ends: 114 [2019-11-24 04:18:32,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-24 04:18:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2019-11-24 04:18:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-24 04:18:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2019-11-24 04:18:32,600 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 22 [2019-11-24 04:18:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:32,600 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2019-11-24 04:18:32,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2019-11-24 04:18:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:18:32,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:32,602 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] [2019-11-24 04:18:32,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:32,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1513349547, now seen corresponding path program 1 times [2019-11-24 04:18:32,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:32,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690012650] [2019-11-24 04:18:32,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:32,662 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 04:18:32,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690012650] [2019-11-24 04:18:32,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:32,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:32,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918373414] [2019-11-24 04:18:32,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:32,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:32,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:32,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:32,665 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 5 states. [2019-11-24 04:18:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:32,771 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2019-11-24 04:18:32,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:32,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 04:18:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:32,773 INFO L225 Difference]: With dead ends: 72 [2019-11-24 04:18:32,773 INFO L226 Difference]: Without dead ends: 70 [2019-11-24 04:18:32,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-24 04:18:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-24 04:18:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-24 04:18:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-11-24 04:18:32,790 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 22 [2019-11-24 04:18:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:32,791 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-11-24 04:18:32,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:32,794 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-11-24 04:18:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:18:32,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:32,795 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 04:18:32,795 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:32,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:32,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1665131132, now seen corresponding path program 1 times [2019-11-24 04:18:32,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:32,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210769121] [2019-11-24 04:18:32,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:32,869 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 04:18:32,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210769121] [2019-11-24 04:18:32,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:32,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:18:32,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044193299] [2019-11-24 04:18:32,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:18:32,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:32,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:18:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:18:32,872 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 3 states. [2019-11-24 04:18:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:32,915 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-24 04:18:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:18:32,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:18:32,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:32,917 INFO L225 Difference]: With dead ends: 110 [2019-11-24 04:18:32,917 INFO L226 Difference]: Without dead ends: 70 [2019-11-24 04:18:32,918 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 04:18:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-24 04:18:32,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-24 04:18:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-24 04:18:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-11-24 04:18:32,931 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 24 [2019-11-24 04:18:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:32,931 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-11-24 04:18:32,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:18:32,931 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-11-24 04:18:32,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:18:32,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:32,932 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:32,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:32,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash -649021887, now seen corresponding path program 1 times [2019-11-24 04:18:32,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:32,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-24 04:18:32,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:33,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:33,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-24 04:18:33,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338112389] [2019-11-24 04:18:33,015 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 04:18:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:33,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-24 04:18:33,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:18:33,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 04:18:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:33,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:18:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:33,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [605353228] [2019-11-24 04:18:33,212 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2019-11-24 04:18:33,212 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:18:33,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:18:33,225 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:18:33,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:18:33,325 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:18:33,351 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:18:33,965 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 04:18:34,322 WARN L192 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 66 [2019-11-24 04:18:35,520 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-11-24 04:18:35,729 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-11-24 04:18:35,963 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-11-24 04:18:36,943 WARN L192 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 98 [2019-11-24 04:18:38,014 WARN L192 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 98 [2019-11-24 04:18:38,568 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 86 [2019-11-24 04:18:39,058 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 80 [2019-11-24 04:18:39,063 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-24 04:18:39,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-24 04:18:39,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 8 [2019-11-24 04:18:39,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091533305] [2019-11-24 04:18:39,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:18:39,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:18:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=560, Unknown=0, NotChecked=0, Total=812 [2019-11-24 04:18:39,066 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 8 states. [2019-11-24 04:18:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:39,224 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2019-11-24 04:18:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:39,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-24 04:18:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:39,226 INFO L225 Difference]: With dead ends: 110 [2019-11-24 04:18:39,226 INFO L226 Difference]: Without dead ends: 108 [2019-11-24 04:18:39,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=279, Invalid=713, Unknown=0, NotChecked=0, Total=992 [2019-11-24 04:18:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-24 04:18:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 67. [2019-11-24 04:18:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-24 04:18:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-11-24 04:18:39,235 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2019-11-24 04:18:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:39,235 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-11-24 04:18:39,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:18:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-11-24 04:18:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:18:39,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:39,242 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] [2019-11-24 04:18:39,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:18:39,448 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:39,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:39,448 INFO L82 PathProgramCache]: Analyzing trace with hash 535752363, now seen corresponding path program 1 times [2019-11-24 04:18:39,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:39,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844710947] [2019-11-24 04:18:39,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:39,508 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 04:18:39,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844710947] [2019-11-24 04:18:39,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:39,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:39,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900775944] [2019-11-24 04:18:39,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:39,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:39,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:39,510 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 5 states. [2019-11-24 04:18:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:39,572 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-24 04:18:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:39,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 04:18:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:39,574 INFO L225 Difference]: With dead ends: 68 [2019-11-24 04:18:39,574 INFO L226 Difference]: Without dead ends: 66 [2019-11-24 04:18:39,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-24 04:18:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-11-24 04:18:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-24 04:18:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2019-11-24 04:18:39,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 25 [2019-11-24 04:18:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:39,580 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2019-11-24 04:18:39,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2019-11-24 04:18:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:18:39,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:39,581 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:18:39,581 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1351309273, now seen corresponding path program 1 times [2019-11-24 04:18:39,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:39,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20753423] [2019-11-24 04:18:39,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:39,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20753423] [2019-11-24 04:18:39,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519819066] [2019-11-24 04:18:39,616 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 04:18:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:39,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-24 04:18:39,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:18:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:39,711 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:18:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 04:18:39,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11024107] [2019-11-24 04:18:39,734 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2019-11-24 04:18:39,734 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:18:39,735 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:18:39,735 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:18:39,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:18:39,803 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:18:39,821 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:18:40,475 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 04:18:41,539 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-11-24 04:18:41,758 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-11-24 04:18:42,044 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-11-24 04:18:43,128 WARN L192 SmtUtils]: Spent 947.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2019-11-24 04:18:44,222 WARN L192 SmtUtils]: Spent 951.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 103 [2019-11-24 04:18:45,252 WARN L192 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 99 [2019-11-24 04:18:45,768 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 81 [2019-11-24 04:18:46,906 WARN L192 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 106 [2019-11-24 04:18:48,082 WARN L192 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 189 DAG size of output: 112 [2019-11-24 04:18:48,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 04:18:48,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [5, 6, 6] total 30 [2019-11-24 04:18:48,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695212523] [2019-11-24 04:18:48,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-24 04:18:48,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:48,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-24 04:18:48,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=593, Unknown=0, NotChecked=0, Total=870 [2019-11-24 04:18:48,088 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 24 states. [2019-11-24 04:18:48,566 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2019-11-24 04:18:48,831 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2019-11-24 04:18:49,109 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2019-11-24 04:18:49,484 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 61 [2019-11-24 04:18:49,775 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 61 [2019-11-24 04:18:50,286 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2019-11-24 04:18:50,811 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-11-24 04:18:51,277 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-11-24 04:18:51,847 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-11-24 04:18:52,454 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-11-24 04:18:52,994 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-11-24 04:18:53,525 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-11-24 04:18:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:53,678 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-11-24 04:18:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-24 04:18:53,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-24 04:18:53,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:53,679 INFO L225 Difference]: With dead ends: 125 [2019-11-24 04:18:53,680 INFO L226 Difference]: Without dead ends: 123 [2019-11-24 04:18:53,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-11-24 04:18:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-24 04:18:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 59. [2019-11-24 04:18:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 04:18:53,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-11-24 04:18:53,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 26 [2019-11-24 04:18:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:53,692 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-11-24 04:18:53,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-24 04:18:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-11-24 04:18:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:18:53,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:53,695 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] [2019-11-24 04:18:53,903 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:18:53,904 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash -571541778, now seen corresponding path program 1 times [2019-11-24 04:18:53,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:53,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351467624] [2019-11-24 04:18:53,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:53,944 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 04:18:53,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351467624] [2019-11-24 04:18:53,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:53,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:53,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446653313] [2019-11-24 04:18:53,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:53,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:53,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:53,946 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 5 states. [2019-11-24 04:18:54,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,005 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-24 04:18:54,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:54,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-24 04:18:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,006 INFO L225 Difference]: With dead ends: 59 [2019-11-24 04:18:54,006 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 04:18:54,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 04:18:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-24 04:18:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-24 04:18:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-11-24 04:18:54,011 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 26 [2019-11-24 04:18:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,012 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-11-24 04:18:54,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-11-24 04:18:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-24 04:18:54,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,013 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1546681483, now seen corresponding path program 1 times [2019-11-24 04:18:54,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121450026] [2019-11-24 04:18:54,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,061 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 04:18:54,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121450026] [2019-11-24 04:18:54,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612685383] [2019-11-24 04:18:54,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,063 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2019-11-24 04:18:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,123 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-24 04:18:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:54,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-24 04:18:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,124 INFO L225 Difference]: With dead ends: 58 [2019-11-24 04:18:54,124 INFO L226 Difference]: Without dead ends: 56 [2019-11-24 04:18:54,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-24 04:18:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-11-24 04:18:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 04:18:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-11-24 04:18:54,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 29 [2019-11-24 04:18:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,129 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-11-24 04:18:54,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-11-24 04:18:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-24 04:18:54,130 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,132 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash -702481542, now seen corresponding path program 1 times [2019-11-24 04:18:54,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071315043] [2019-11-24 04:18:54,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,221 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 04:18:54,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071315043] [2019-11-24 04:18:54,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 04:18:54,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485519923] [2019-11-24 04:18:54,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:18:54,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:18:54,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:54,224 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 6 states. [2019-11-24 04:18:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,311 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-11-24 04:18:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:18:54,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-24 04:18:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,313 INFO L225 Difference]: With dead ends: 66 [2019-11-24 04:18:54,313 INFO L226 Difference]: Without dead ends: 64 [2019-11-24 04:18:54,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-24 04:18:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-24 04:18:54,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-11-24 04:18:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-24 04:18:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-11-24 04:18:54,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 30 [2019-11-24 04:18:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,323 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-11-24 04:18:54,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:18:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-11-24 04:18:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 04:18:54,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,324 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1752072319, now seen corresponding path program 1 times [2019-11-24 04:18:54,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653008115] [2019-11-24 04:18:54,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,382 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 04:18:54,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653008115] [2019-11-24 04:18:54,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351911393] [2019-11-24 04:18:54,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,384 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2019-11-24 04:18:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,483 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2019-11-24 04:18:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:18:54,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-24 04:18:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,484 INFO L225 Difference]: With dead ends: 86 [2019-11-24 04:18:54,485 INFO L226 Difference]: Without dead ends: 84 [2019-11-24 04:18:54,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-24 04:18:54,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2019-11-24 04:18:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-24 04:18:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-11-24 04:18:54,492 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 33 [2019-11-24 04:18:54,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,492 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-11-24 04:18:54,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-11-24 04:18:54,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:18:54,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,493 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1520328763, now seen corresponding path program 1 times [2019-11-24 04:18:54,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052143340] [2019-11-24 04:18:54,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:54,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052143340] [2019-11-24 04:18:54,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896937553] [2019-11-24 04:18:54,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,551 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 5 states. [2019-11-24 04:18:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,625 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-11-24 04:18:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:54,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-24 04:18:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,626 INFO L225 Difference]: With dead ends: 56 [2019-11-24 04:18:54,627 INFO L226 Difference]: Without dead ends: 54 [2019-11-24 04:18:54,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:54,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-24 04:18:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-24 04:18:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-24 04:18:54,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-24 04:18:54,633 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 34 [2019-11-24 04:18:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-24 04:18:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-24 04:18:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 04:18:54,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,634 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -746930072, now seen corresponding path program 1 times [2019-11-24 04:18:54,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343576293] [2019-11-24 04:18:54,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,668 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 04:18:54,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343576293] [2019-11-24 04:18:54,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430052935] [2019-11-24 04:18:54,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,671 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2019-11-24 04:18:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,691 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2019-11-24 04:18:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:54,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-11-24 04:18:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,692 INFO L225 Difference]: With dead ends: 65 [2019-11-24 04:18:54,692 INFO L226 Difference]: Without dead ends: 63 [2019-11-24 04:18:54,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-24 04:18:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-24 04:18:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:18:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-11-24 04:18:54,701 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 36 [2019-11-24 04:18:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,701 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-11-24 04:18:54,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-11-24 04:18:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:18:54,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,702 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1679991539, now seen corresponding path program 1 times [2019-11-24 04:18:54,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877673568] [2019-11-24 04:18:54,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,740 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 04:18:54,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877673568] [2019-11-24 04:18:54,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132355675] [2019-11-24 04:18:54,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,742 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2019-11-24 04:18:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,773 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2019-11-24 04:18:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:54,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-24 04:18:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,775 INFO L225 Difference]: With dead ends: 63 [2019-11-24 04:18:54,775 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:18:54,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:18:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:18:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-11-24 04:18:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 04:18:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-11-24 04:18:54,783 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 37 [2019-11-24 04:18:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,784 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-24 04:18:54,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-11-24 04:18:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 04:18:54,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,785 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,785 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash -540125937, now seen corresponding path program 1 times [2019-11-24 04:18:54,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741073981] [2019-11-24 04:18:54,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:54,837 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 04:18:54,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741073981] [2019-11-24 04:18:54,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:54,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:54,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963883754] [2019-11-24 04:18:54,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:54,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:54,840 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 5 states. [2019-11-24 04:18:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:54,956 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-11-24 04:18:54,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 04:18:54,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-24 04:18:54,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:54,957 INFO L225 Difference]: With dead ends: 85 [2019-11-24 04:18:54,957 INFO L226 Difference]: Without dead ends: 83 [2019-11-24 04:18:54,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:54,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-24 04:18:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2019-11-24 04:18:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-24 04:18:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2019-11-24 04:18:54,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 38 [2019-11-24 04:18:54,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:54,964 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2019-11-24 04:18:54,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2019-11-24 04:18:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:18:54,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:54,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:18:54,965 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash 435969364, now seen corresponding path program 1 times [2019-11-24 04:18:54,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:54,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508410667] [2019-11-24 04:18:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:55,013 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 04:18:55,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508410667] [2019-11-24 04:18:55,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:18:55,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:18:55,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683216229] [2019-11-24 04:18:55,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:18:55,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:18:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:18:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:18:55,015 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 5 states. [2019-11-24 04:18:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:18:55,093 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-24 04:18:55,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:18:55,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-24 04:18:55,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:18:55,095 INFO L225 Difference]: With dead ends: 70 [2019-11-24 04:18:55,095 INFO L226 Difference]: Without dead ends: 68 [2019-11-24 04:18:55,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:18:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-24 04:18:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2019-11-24 04:18:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 04:18:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-24 04:18:55,101 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 39 [2019-11-24 04:18:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:18:55,102 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-24 04:18:55,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:18:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-24 04:18:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:18:55,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:18:55,103 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:18:55,103 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:18:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:18:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1372292551, now seen corresponding path program 1 times [2019-11-24 04:18:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:18:55,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870650718] [2019-11-24 04:18:55,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:18:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:55,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870650718] [2019-11-24 04:18:55,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133213512] [2019-11-24 04:18:55,178 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 04:18:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:18:55,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-24 04:18:55,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:18:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:55,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:18:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:18:55,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1760085099] [2019-11-24 04:18:55,351 INFO L159 IcfgInterpreter]: Started Sifa with 37 locations of interest [2019-11-24 04:18:55,351 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:18:55,351 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:18:55,352 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:18:55,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:18:55,449 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-24 04:18:55,513 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-24 04:18:55,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-24 04:18:55,885 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 04:18:56,904 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-11-24 04:18:57,127 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-11-24 04:18:57,384 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-11-24 04:18:57,779 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-11-24 04:18:58,128 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 53 [2019-11-24 04:18:58,492 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 59 [2019-11-24 04:18:58,912 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-11-24 04:18:59,493 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 71 [2019-11-24 04:18:59,972 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 75 [2019-11-24 04:19:00,357 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-24 04:19:00,636 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-24 04:19:01,143 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-24 04:19:02,117 WARN L192 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-11-24 04:19:02,708 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-11-24 04:19:03,344 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-11-24 04:19:04,315 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2019-11-24 04:19:05,249 WARN L192 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 111 [2019-11-24 04:19:05,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 04:19:05,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [6, 6, 6] total 39 [2019-11-24 04:19:05,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463356248] [2019-11-24 04:19:05,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-24 04:19:05,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:05,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-24 04:19:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=988, Unknown=0, NotChecked=0, Total=1482 [2019-11-24 04:19:05,422 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 32 states. [2019-11-24 04:19:06,022 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 81 [2019-11-24 04:19:06,504 WARN L192 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 91 [2019-11-24 04:19:07,024 WARN L192 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 98 [2019-11-24 04:19:07,585 WARN L192 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 103 [2019-11-24 04:19:08,165 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-11-24 04:19:08,774 WARN L192 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 109 [2019-11-24 04:19:09,405 WARN L192 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2019-11-24 04:19:09,874 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-11-24 04:19:10,329 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-11-24 04:19:10,750 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-11-24 04:19:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:10,861 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-24 04:19:10,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-24 04:19:10,863 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2019-11-24 04:19:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:10,865 INFO L225 Difference]: With dead ends: 128 [2019-11-24 04:19:10,865 INFO L226 Difference]: Without dead ends: 126 [2019-11-24 04:19:10,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=845, Invalid=1507, Unknown=0, NotChecked=0, Total=2352 [2019-11-24 04:19:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-24 04:19:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2019-11-24 04:19:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 04:19:10,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2019-11-24 04:19:10,877 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 39 [2019-11-24 04:19:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:10,877 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2019-11-24 04:19:10,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-24 04:19:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2019-11-24 04:19:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:19:10,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:10,878 INFO L410 BasicCegarLoop]: trace histogram [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 04:19:11,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:19:11,082 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:11,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1929666322, now seen corresponding path program 1 times [2019-11-24 04:19:11,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:11,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298373304] [2019-11-24 04:19:11,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:19:11,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298373304] [2019-11-24 04:19:11,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295168638] [2019-11-24 04:19:11,143 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 04:19:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:11,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-24 04:19:11,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:19:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:19:11,247 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:19:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:19:11,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748766365] [2019-11-24 04:19:11,280 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2019-11-24 04:19:11,280 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:19:11,280 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:19:11,281 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:19:11,281 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:19:11,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:19:11,350 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-24 04:19:12,264 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 04:19:13,323 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-11-24 04:19:13,547 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2019-11-24 04:19:13,807 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-11-24 04:19:14,898 WARN L192 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 106 [2019-11-24 04:19:15,989 WARN L192 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 103 [2019-11-24 04:19:17,019 WARN L192 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 99 [2019-11-24 04:19:17,534 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 81 [2019-11-24 04:19:18,698 WARN L192 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 106 [2019-11-24 04:19:19,923 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 189 DAG size of output: 112 [2019-11-24 04:19:21,155 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 196 DAG size of output: 118 [2019-11-24 04:19:22,687 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 204 DAG size of output: 124 [2019-11-24 04:19:24,013 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 212 DAG size of output: 130 [2019-11-24 04:19:24,503 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-24 04:19:24,811 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-24 04:19:25,334 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-11-24 04:19:26,388 WARN L192 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 104 [2019-11-24 04:19:26,998 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 109 [2019-11-24 04:19:27,658 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 113 [2019-11-24 04:19:28,632 WARN L192 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 113 [2019-11-24 04:19:29,586 WARN L192 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 111 [2019-11-24 04:19:29,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 04:19:29,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [6, 7, 6] total 43 [2019-11-24 04:19:29,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850710429] [2019-11-24 04:19:29,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-24 04:19:29,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:19:29,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-24 04:19:29,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=1314, Unknown=0, NotChecked=0, Total=1806 [2019-11-24 04:19:29,791 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 35 states. [2019-11-24 04:19:30,183 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 55 [2019-11-24 04:19:30,453 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 57 [2019-11-24 04:19:30,748 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 57 [2019-11-24 04:19:31,193 WARN L192 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 61 [2019-11-24 04:19:31,496 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 61 [2019-11-24 04:19:32,028 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2019-11-24 04:19:32,367 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 65 [2019-11-24 04:19:32,899 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 100 [2019-11-24 04:19:33,401 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-11-24 04:19:33,951 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2019-11-24 04:19:34,317 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-11-24 04:19:34,925 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-11-24 04:19:35,477 WARN L192 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 106 [2019-11-24 04:19:35,853 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 77 [2019-11-24 04:19:36,454 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 112 [2019-11-24 04:19:37,226 WARN L192 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 83 [2019-11-24 04:19:37,821 WARN L192 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 118 [2019-11-24 04:19:38,599 WARN L192 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 91 [2019-11-24 04:19:39,254 WARN L192 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2019-11-24 04:19:40,045 WARN L192 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 97 [2019-11-24 04:19:40,922 WARN L192 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 102 [2019-11-24 04:19:41,901 WARN L192 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 112 [2019-11-24 04:19:42,760 WARN L192 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 102 [2019-11-24 04:19:43,684 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 119 [2019-11-24 04:19:44,547 WARN L192 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 106 [2019-11-24 04:19:45,453 WARN L192 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 110 [2019-11-24 04:19:46,368 WARN L192 SmtUtils]: Spent 761.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 108 [2019-11-24 04:19:47,321 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 124 [2019-11-24 04:19:47,805 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2019-11-24 04:19:48,796 WARN L192 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 130 [2019-11-24 04:19:49,286 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 102 [2019-11-24 04:19:50,306 WARN L192 SmtUtils]: Spent 890.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2019-11-24 04:19:51,361 WARN L192 SmtUtils]: Spent 883.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 128 [2019-11-24 04:19:51,769 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-11-24 04:19:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:19:51,896 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-24 04:19:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-24 04:19:51,896 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 43 [2019-11-24 04:19:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:19:51,898 INFO L225 Difference]: With dead ends: 114 [2019-11-24 04:19:51,898 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 04:19:51,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=1760, Invalid=4092, Unknown=0, NotChecked=0, Total=5852 [2019-11-24 04:19:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 04:19:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 62. [2019-11-24 04:19:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-24 04:19:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-24 04:19:51,906 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2019-11-24 04:19:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:19:51,906 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-24 04:19:51,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-24 04:19:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-24 04:19:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 04:19:51,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:19:51,907 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:19:52,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:19:52,110 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:19:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:19:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -427369127, now seen corresponding path program 1 times [2019-11-24 04:19:52,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:19:52,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740567100] [2019-11-24 04:19:52,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:19:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:52,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740567100] [2019-11-24 04:19:52,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936090452] [2019-11-24 04:19:52,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:19:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:19:52,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-24 04:19:52,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:19:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:52,271 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:19:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:19:52,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1163696725] [2019-11-24 04:19:52,306 INFO L159 IcfgInterpreter]: Started Sifa with 41 locations of interest [2019-11-24 04:19:52,306 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:19:52,306 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:19:52,306 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:19:52,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:19:52,370 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-24 04:19:52,411 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-24 04:19:53,875 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 237 [2019-11-24 04:19:54,602 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2019-11-24 04:19:55,244 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2019-11-24 04:19:55,409 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 248 [2019-11-24 04:19:55,865 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2019-11-24 04:19:56,243 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 251 [2019-11-24 04:19:56,700 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2019-11-24 04:19:56,873 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 253 [2019-11-24 04:19:57,206 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 255 [2019-11-24 04:19:57,963 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 260 [2019-11-24 04:19:58,484 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2019-11-24 04:19:58,692 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2019-11-24 04:19:59,226 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2019-11-24 04:19:59,449 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 268 [2019-11-24 04:20:00,057 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2019-11-24 04:20:00,235 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 272 [2019-11-24 04:20:00,737 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2019-11-24 04:20:00,973 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 274 [2019-11-24 04:20:01,311 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2019-11-24 04:20:01,550 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 276 [2019-11-24 04:20:01,926 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 280