/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/product-lines/elevator_spec1_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:36:51,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:36:51,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:36:51,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:36:51,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:36:51,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:36:51,336 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:36:51,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:36:51,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:36:51,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:36:51,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:36:51,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:36:51,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:36:51,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:36:51,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:36:51,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:36:51,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:36:51,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:36:51,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:36:51,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:36:51,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:36:51,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:36:51,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:36:51,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:36:51,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:36:51,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:36:51,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:36:51,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:36:51,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:36:51,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:36:51,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:36:51,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:36:51,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:36:51,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:36:51,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:36:51,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:36:51,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:36:51,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:36:51,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:36:51,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:36:51,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:36:51,367 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:36:51,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:36:51,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:36:51,383 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:36:51,383 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:36:51,383 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:36:51,383 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:36:51,384 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:36:51,384 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:36:51,384 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:36:51,384 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:36:51,384 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:36:51,385 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:36:51,385 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:36:51,385 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:36:51,385 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:36:51,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:36:51,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:36:51,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:36:51,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:36:51,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:36:51,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:36:51,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:36:51,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:36:51,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:36:51,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:36:51,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:36:51,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:36:51,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:36:51,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:36:51,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:36:51,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:36:51,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:36:51,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:36:51,390 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:36:51,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:36:51,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:36:51,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:36:51,390 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:36:51,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:36:51,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:36:51,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:36:51,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:36:51,703 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:36:51,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product01.cil.c [2019-11-24 04:36:51,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a223b4f/288b8495c2a348029626de6d060090e4/FLAGa83abb4d8 [2019-11-24 04:36:52,487 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:36:52,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product01.cil.c [2019-11-24 04:36:52,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a223b4f/288b8495c2a348029626de6d060090e4/FLAGa83abb4d8 [2019-11-24 04:36:52,716 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a223b4f/288b8495c2a348029626de6d060090e4 [2019-11-24 04:36:52,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:36:52,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:36:52,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:52,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:36:52,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:36:52,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:52" (1/1) ... [2019-11-24 04:36:52,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b3f62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:52, skipping insertion in model container [2019-11-24 04:36:52,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:36:52" (1/1) ... [2019-11-24 04:36:52,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:36:52,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:36:53,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:53,515 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:36:53,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:36:53,762 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:36:53,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53 WrapperNode [2019-11-24 04:36:53,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:36:53,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:53,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:36:53,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:36:53,773 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:36:53" (1/1) ... [2019-11-24 04:36:53,806 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:36:53" (1/1) ... [2019-11-24 04:36:53,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:36:53,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:36:53,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:36:53,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:36:53,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:53,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... [2019-11-24 04:36:54,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:36:54,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:36:54,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:36:54,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:36:54,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:36:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:36:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:36:54,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:36:54,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:37:18,788 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:37:18,788 INFO L284 CfgBuilder]: Removed 445 assume(true) statements. [2019-11-24 04:37:18,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:18 BoogieIcfgContainer [2019-11-24 04:37:18,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:37:18,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:37:18,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:37:18,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:37:18,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:36:52" (1/3) ... [2019-11-24 04:37:18,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686a0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:18, skipping insertion in model container [2019-11-24 04:37:18,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:36:53" (2/3) ... [2019-11-24 04:37:18,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686a0937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:37:18, skipping insertion in model container [2019-11-24 04:37:18,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:37:18" (3/3) ... [2019-11-24 04:37:18,798 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product01.cil.c [2019-11-24 04:37:18,805 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:37:18,812 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 04:37:18,824 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 04:37:18,856 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:37:18,857 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:37:18,857 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:37:18,857 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:37:18,857 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:37:18,857 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:37:18,857 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:37:18,858 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:37:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states. [2019-11-24 04:37:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:37:18,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:18,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:18,900 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:18,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1765992535, now seen corresponding path program 1 times [2019-11-24 04:37:18,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:18,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051567192] [2019-11-24 04:37:18,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:19,393 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:37:19,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051567192] [2019-11-24 04:37:19,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:19,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:19,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564700420] [2019-11-24 04:37:19,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:19,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:19,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:19,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:19,417 INFO L87 Difference]: Start difference. First operand 741 states. Second operand 4 states. [2019-11-24 04:37:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:19,684 INFO L93 Difference]: Finished difference Result 1843 states and 3518 transitions. [2019-11-24 04:37:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:19,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:37:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:19,720 INFO L225 Difference]: With dead ends: 1843 [2019-11-24 04:37:19,720 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 04:37:19,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:37:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 04:37:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 968. [2019-11-24 04:37:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-11-24 04:37:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1855 transitions. [2019-11-24 04:37:19,851 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1855 transitions. Word has length 15 [2019-11-24 04:37:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:19,851 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1855 transitions. [2019-11-24 04:37:19,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1855 transitions. [2019-11-24 04:37:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:37:19,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:19,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:19,854 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:19,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash 71353142, now seen corresponding path program 1 times [2019-11-24 04:37:19,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:19,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90000603] [2019-11-24 04:37:19,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:20,083 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:37:20,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90000603] [2019-11-24 04:37:20,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:20,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:20,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243817150] [2019-11-24 04:37:20,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:37:20,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:37:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:37:20,092 INFO L87 Difference]: Start difference. First operand 968 states and 1855 transitions. Second operand 4 states. [2019-11-24 04:37:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:20,343 INFO L93 Difference]: Finished difference Result 1722 states and 3240 transitions. [2019-11-24 04:37:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:20,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:37:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:20,352 INFO L225 Difference]: With dead ends: 1722 [2019-11-24 04:37:20,352 INFO L226 Difference]: Without dead ends: 1329 [2019-11-24 04:37:20,354 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:37:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2019-11-24 04:37:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 972. [2019-11-24 04:37:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2019-11-24 04:37:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1859 transitions. [2019-11-24 04:37:20,385 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1859 transitions. Word has length 16 [2019-11-24 04:37:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:20,385 INFO L462 AbstractCegarLoop]: Abstraction has 972 states and 1859 transitions. [2019-11-24 04:37:20,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:37:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1859 transitions. [2019-11-24 04:37:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 04:37:20,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:20,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] [2019-11-24 04:37:20,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:20,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1559860904, now seen corresponding path program 1 times [2019-11-24 04:37:20,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:20,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749145229] [2019-11-24 04:37:20,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:20,541 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:37:20,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749145229] [2019-11-24 04:37:20,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:20,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:20,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83634825] [2019-11-24 04:37:20,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:20,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:20,544 INFO L87 Difference]: Start difference. First operand 972 states and 1859 transitions. Second operand 5 states. [2019-11-24 04:37:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:20,917 INFO L93 Difference]: Finished difference Result 2059 states and 3891 transitions. [2019-11-24 04:37:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:20,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-24 04:37:20,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:20,929 INFO L225 Difference]: With dead ends: 2059 [2019-11-24 04:37:20,937 INFO L226 Difference]: Without dead ends: 1678 [2019-11-24 04:37:20,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-11-24 04:37:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 976. [2019-11-24 04:37:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-11-24 04:37:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1864 transitions. [2019-11-24 04:37:20,978 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1864 transitions. Word has length 19 [2019-11-24 04:37:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:20,979 INFO L462 AbstractCegarLoop]: Abstraction has 976 states and 1864 transitions. [2019-11-24 04:37:20,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1864 transitions. [2019-11-24 04:37:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 04:37:20,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:20,981 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] [2019-11-24 04:37:20,982 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:20,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2127342504, now seen corresponding path program 1 times [2019-11-24 04:37:20,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:20,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996656851] [2019-11-24 04:37:20,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:21,095 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:37:21,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996656851] [2019-11-24 04:37:21,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:21,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:21,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809041696] [2019-11-24 04:37:21,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:21,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:21,098 INFO L87 Difference]: Start difference. First operand 976 states and 1864 transitions. Second operand 5 states. [2019-11-24 04:37:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:21,440 INFO L93 Difference]: Finished difference Result 2048 states and 3865 transitions. [2019-11-24 04:37:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:21,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-24 04:37:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:21,451 INFO L225 Difference]: With dead ends: 2048 [2019-11-24 04:37:21,451 INFO L226 Difference]: Without dead ends: 1663 [2019-11-24 04:37:21,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-11-24 04:37:21,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 979. [2019-11-24 04:37:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-24 04:37:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1868 transitions. [2019-11-24 04:37:21,504 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1868 transitions. Word has length 20 [2019-11-24 04:37:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:21,505 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1868 transitions. [2019-11-24 04:37:21,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1868 transitions. [2019-11-24 04:37:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:37:21,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:21,508 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:37:21,508 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1661265736, now seen corresponding path program 1 times [2019-11-24 04:37:21,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:21,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908825520] [2019-11-24 04:37:21,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:21,608 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:37:21,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908825520] [2019-11-24 04:37:21,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:21,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:21,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169449509] [2019-11-24 04:37:21,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:21,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:21,611 INFO L87 Difference]: Start difference. First operand 979 states and 1868 transitions. Second operand 5 states. [2019-11-24 04:37:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:21,972 INFO L93 Difference]: Finished difference Result 2036 states and 3838 transitions. [2019-11-24 04:37:21,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:37:21,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:37:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:21,983 INFO L225 Difference]: With dead ends: 2036 [2019-11-24 04:37:21,984 INFO L226 Difference]: Without dead ends: 1648 [2019-11-24 04:37:21,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 04:37:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-11-24 04:37:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 982. [2019-11-24 04:37:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-11-24 04:37:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1872 transitions. [2019-11-24 04:37:22,040 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1872 transitions. Word has length 21 [2019-11-24 04:37:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:22,041 INFO L462 AbstractCegarLoop]: Abstraction has 982 states and 1872 transitions. [2019-11-24 04:37:22,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1872 transitions. [2019-11-24 04:37:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 04:37:22,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:22,043 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:37:22,043 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:22,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:22,044 INFO L82 PathProgramCache]: Analyzing trace with hash 758001673, now seen corresponding path program 1 times [2019-11-24 04:37:22,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:22,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745818856] [2019-11-24 04:37:22,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,193 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:37:22,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745818856] [2019-11-24 04:37:22,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:22,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307647789] [2019-11-24 04:37:22,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:22,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:22,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:22,196 INFO L87 Difference]: Start difference. First operand 982 states and 1872 transitions. Second operand 5 states. [2019-11-24 04:37:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:22,368 INFO L93 Difference]: Finished difference Result 1630 states and 3091 transitions. [2019-11-24 04:37:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:37:22,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-24 04:37:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:22,377 INFO L225 Difference]: With dead ends: 1630 [2019-11-24 04:37:22,378 INFO L226 Difference]: Without dead ends: 1615 [2019-11-24 04:37:22,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2019-11-24 04:37:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 986. [2019-11-24 04:37:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-24 04:37:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1876 transitions. [2019-11-24 04:37:22,423 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1876 transitions. Word has length 21 [2019-11-24 04:37:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:22,423 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1876 transitions. [2019-11-24 04:37:22,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1876 transitions. [2019-11-24 04:37:22,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:37:22,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:22,425 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:37:22,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:22,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2121573511, now seen corresponding path program 1 times [2019-11-24 04:37:22,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:22,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875061571] [2019-11-24 04:37:22,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,515 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:37:22,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875061571] [2019-11-24 04:37:22,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:22,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800464062] [2019-11-24 04:37:22,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:22,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:22,518 INFO L87 Difference]: Start difference. First operand 986 states and 1876 transitions. Second operand 3 states. [2019-11-24 04:37:22,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:22,572 INFO L93 Difference]: Finished difference Result 1001 states and 1890 transitions. [2019-11-24 04:37:22,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:22,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:37:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:22,578 INFO L225 Difference]: With dead ends: 1001 [2019-11-24 04:37:22,578 INFO L226 Difference]: Without dead ends: 986 [2019-11-24 04:37:22,579 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:37:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2019-11-24 04:37:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2019-11-24 04:37:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-11-24 04:37:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1874 transitions. [2019-11-24 04:37:22,618 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1874 transitions. Word has length 22 [2019-11-24 04:37:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:22,618 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1874 transitions. [2019-11-24 04:37:22,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1874 transitions. [2019-11-24 04:37:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:37:22,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:22,620 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] [2019-11-24 04:37:22,620 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:22,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1146057336, now seen corresponding path program 1 times [2019-11-24 04:37:22,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:22,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162336760] [2019-11-24 04:37:22,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:22,738 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:37:22,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162336760] [2019-11-24 04:37:22,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:22,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:37:22,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137322660] [2019-11-24 04:37:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:37:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:37:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:37:22,740 INFO L87 Difference]: Start difference. First operand 986 states and 1874 transitions. Second operand 5 states. [2019-11-24 04:37:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:23,150 INFO L93 Difference]: Finished difference Result 1766 states and 3341 transitions. [2019-11-24 04:37:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:37:23,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-24 04:37:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:23,156 INFO L225 Difference]: With dead ends: 1766 [2019-11-24 04:37:23,157 INFO L226 Difference]: Without dead ends: 1013 [2019-11-24 04:37:23,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:23,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-24 04:37:23,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 996. [2019-11-24 04:37:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-11-24 04:37:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1852 transitions. [2019-11-24 04:37:23,203 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1852 transitions. Word has length 23 [2019-11-24 04:37:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:23,205 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1852 transitions. [2019-11-24 04:37:23,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:37:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1852 transitions. [2019-11-24 04:37:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:37:23,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:23,207 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:37:23,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1168022374, now seen corresponding path program 1 times [2019-11-24 04:37:23,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:23,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436308422] [2019-11-24 04:37:23,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:23,425 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:37:23,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436308422] [2019-11-24 04:37:23,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:23,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:37:23,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718178585] [2019-11-24 04:37:23,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:37:23,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:23,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:37:23,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:37:23,428 INFO L87 Difference]: Start difference. First operand 996 states and 1852 transitions. Second operand 6 states. [2019-11-24 04:37:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:24,146 INFO L93 Difference]: Finished difference Result 1873 states and 3431 transitions. [2019-11-24 04:37:24,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 04:37:24,147 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-24 04:37:24,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:24,154 INFO L225 Difference]: With dead ends: 1873 [2019-11-24 04:37:24,154 INFO L226 Difference]: Without dead ends: 1460 [2019-11-24 04:37:24,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-24 04:37:24,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-24 04:37:24,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1332. [2019-11-24 04:37:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-11-24 04:37:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2459 transitions. [2019-11-24 04:37:24,241 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2459 transitions. Word has length 24 [2019-11-24 04:37:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:24,241 INFO L462 AbstractCegarLoop]: Abstraction has 1332 states and 2459 transitions. [2019-11-24 04:37:24,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:37:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2459 transitions. [2019-11-24 04:37:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 04:37:24,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:24,244 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:37:24,244 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:24,244 INFO L82 PathProgramCache]: Analyzing trace with hash 320919257, now seen corresponding path program 1 times [2019-11-24 04:37:24,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:24,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783803461] [2019-11-24 04:37:24,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:24,386 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:37:24,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783803461] [2019-11-24 04:37:24,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:24,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:24,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293629436] [2019-11-24 04:37:24,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:24,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:24,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:24,388 INFO L87 Difference]: Start difference. First operand 1332 states and 2459 transitions. Second operand 3 states. [2019-11-24 04:37:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:25,371 INFO L93 Difference]: Finished difference Result 2743 states and 5032 transitions. [2019-11-24 04:37:25,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:25,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 04:37:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:25,380 INFO L225 Difference]: With dead ends: 2743 [2019-11-24 04:37:25,381 INFO L226 Difference]: Without dead ends: 1708 [2019-11-24 04:37:25,383 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:37:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2019-11-24 04:37:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1272. [2019-11-24 04:37:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-11-24 04:37:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2309 transitions. [2019-11-24 04:37:25,461 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2309 transitions. Word has length 34 [2019-11-24 04:37:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:25,461 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 2309 transitions. [2019-11-24 04:37:25,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2309 transitions. [2019-11-24 04:37:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 04:37:25,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:25,463 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] [2019-11-24 04:37:25,463 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:25,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:25,464 INFO L82 PathProgramCache]: Analyzing trace with hash 213932501, now seen corresponding path program 1 times [2019-11-24 04:37:25,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:25,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724299365] [2019-11-24 04:37:25,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:25,616 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:37:25,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724299365] [2019-11-24 04:37:25,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:25,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:25,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412262079] [2019-11-24 04:37:25,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:25,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:25,619 INFO L87 Difference]: Start difference. First operand 1272 states and 2309 transitions. Second operand 3 states. [2019-11-24 04:37:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:26,525 INFO L93 Difference]: Finished difference Result 2613 states and 4727 transitions. [2019-11-24 04:37:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:26,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 04:37:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:26,535 INFO L225 Difference]: With dead ends: 2613 [2019-11-24 04:37:26,535 INFO L226 Difference]: Without dead ends: 1660 [2019-11-24 04:37:26,537 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:37:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-11-24 04:37:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1227. [2019-11-24 04:37:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1227 states. [2019-11-24 04:37:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 2174 transitions. [2019-11-24 04:37:26,618 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 2174 transitions. Word has length 35 [2019-11-24 04:37:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:26,618 INFO L462 AbstractCegarLoop]: Abstraction has 1227 states and 2174 transitions. [2019-11-24 04:37:26,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 2174 transitions. [2019-11-24 04:37:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 04:37:26,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:26,621 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:37:26,621 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1152014320, now seen corresponding path program 1 times [2019-11-24 04:37:26,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:26,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258259442] [2019-11-24 04:37:26,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:26,855 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:37:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258259442] [2019-11-24 04:37:26,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:26,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:26,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918519966] [2019-11-24 04:37:26,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:26,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:26,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:26,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:26,857 INFO L87 Difference]: Start difference. First operand 1227 states and 2174 transitions. Second operand 3 states. [2019-11-24 04:37:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:27,608 INFO L93 Difference]: Finished difference Result 2508 states and 4447 transitions. [2019-11-24 04:37:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:27,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 04:37:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:27,617 INFO L225 Difference]: With dead ends: 2508 [2019-11-24 04:37:27,617 INFO L226 Difference]: Without dead ends: 1627 [2019-11-24 04:37:27,619 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:37:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-11-24 04:37:27,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1197. [2019-11-24 04:37:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2019-11-24 04:37:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2054 transitions. [2019-11-24 04:37:27,703 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2054 transitions. Word has length 37 [2019-11-24 04:37:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:27,705 INFO L462 AbstractCegarLoop]: Abstraction has 1197 states and 2054 transitions. [2019-11-24 04:37:27,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2054 transitions. [2019-11-24 04:37:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 04:37:27,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:27,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:27,708 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2026456623, now seen corresponding path program 1 times [2019-11-24 04:37:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:27,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075031474] [2019-11-24 04:37:27,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:27,899 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:37:27,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075031474] [2019-11-24 04:37:27,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:27,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:37:27,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484824695] [2019-11-24 04:37:27,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:37:27,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:37:27,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:37:27,905 INFO L87 Difference]: Start difference. First operand 1197 states and 2054 transitions. Second operand 3 states. [2019-11-24 04:37:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:28,550 INFO L93 Difference]: Finished difference Result 2428 states and 4192 transitions. [2019-11-24 04:37:28,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:37:28,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 04:37:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:28,558 INFO L225 Difference]: With dead ends: 2428 [2019-11-24 04:37:28,559 INFO L226 Difference]: Without dead ends: 1609 [2019-11-24 04:37:28,561 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:37:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2019-11-24 04:37:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1182. [2019-11-24 04:37:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-11-24 04:37:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1949 transitions. [2019-11-24 04:37:28,639 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1949 transitions. Word has length 40 [2019-11-24 04:37:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:28,640 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 1949 transitions. [2019-11-24 04:37:28,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:37:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1949 transitions. [2019-11-24 04:37:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:37:28,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:28,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:28,642 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1340407826, now seen corresponding path program 1 times [2019-11-24 04:37:28,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:28,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199974962] [2019-11-24 04:37:28,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:28,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199974962] [2019-11-24 04:37:28,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:37:28,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-24 04:37:28,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042102289] [2019-11-24 04:37:28,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 04:37:28,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:37:28,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 04:37:28,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-24 04:37:28,830 INFO L87 Difference]: Start difference. First operand 1182 states and 1949 transitions. Second operand 8 states. [2019-11-24 04:37:30,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:37:30,684 INFO L93 Difference]: Finished difference Result 4992 states and 8280 transitions. [2019-11-24 04:37:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-24 04:37:30,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-24 04:37:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:37:30,709 INFO L225 Difference]: With dead ends: 4992 [2019-11-24 04:37:30,710 INFO L226 Difference]: Without dead ends: 4057 [2019-11-24 04:37:30,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-11-24 04:37:30,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2019-11-24 04:37:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 1928. [2019-11-24 04:37:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-11-24 04:37:30,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3040 transitions. [2019-11-24 04:37:30,869 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3040 transitions. Word has length 41 [2019-11-24 04:37:30,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:37:30,869 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3040 transitions. [2019-11-24 04:37:30,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 04:37:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3040 transitions. [2019-11-24 04:37:30,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 04:37:30,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:37:30,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:37:30,872 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:37:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:37:30,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1515713507, now seen corresponding path program 1 times [2019-11-24 04:37:30,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:37:30,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728240724] [2019-11-24 04:37:30,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:37:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:31,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728240724] [2019-11-24 04:37:31,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185347973] [2019-11-24 04:37:31,012 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:37:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:37:31,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-24 04:37:31,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:37:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:31,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:37:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:37:31,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [825194725] [2019-11-24 04:37:31,531 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2019-11-24 04:37:31,532 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:37:31,538 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:37:31,548 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:37:31,549 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:38:16,034 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification that was a NOOP. DAG size: 770