/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/email_spec1_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:53:30,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:53:30,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:53:30,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:53:30,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:53:30,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:53:30,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:53:30,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:53:30,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:53:30,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:53:30,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:53:30,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:53:30,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:53:30,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:53:30,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:53:30,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:53:30,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:53:30,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:53:30,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:53:30,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:53:30,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:53:30,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:53:30,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:53:30,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:53:30,481 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:53:30,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:53:30,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:53:30,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:53:30,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:53:30,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:53:30,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:53:30,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:53:30,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:53:30,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:53:30,495 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:53:30,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:53:30,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:53:30,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:53:30,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:53:30,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:53:30,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:53:30,504 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:53:30,527 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:53:30,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:53:30,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:53:30,528 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:53:30,528 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:53:30,528 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:53:30,529 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:53:30,529 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:53:30,529 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:53:30,529 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:53:30,530 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:53:30,531 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:53:30,531 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:53:30,531 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:53:30,532 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:53:30,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:53:30,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:53:30,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:53:30,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:53:30,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:53:30,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:53:30,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:53:30,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:53:30,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:53:30,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:53:30,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:53:30,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:53:30,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:53:30,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:53:30,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:53:30,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:53:30,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:53:30,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:53:30,538 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:53:30,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:53:30,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:53:30,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:53:30,539 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:53:30,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:53:30,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:53:30,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:53:30,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:53:30,904 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:53:30,905 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product21.cil.c [2019-11-24 04:53:30,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5740f89c1/ec0fc1769a29454caeaf683f3c612259/FLAG555885f32 [2019-11-24 04:53:31,597 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:53:31,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product21.cil.c [2019-11-24 04:53:31,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5740f89c1/ec0fc1769a29454caeaf683f3c612259/FLAG555885f32 [2019-11-24 04:53:31,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5740f89c1/ec0fc1769a29454caeaf683f3c612259 [2019-11-24 04:53:31,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:53:31,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:53:31,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:53:31,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:53:31,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:53:31,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:53:31" (1/1) ... [2019-11-24 04:53:31,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8a69ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:31, skipping insertion in model container [2019-11-24 04:53:31,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:53:31" (1/1) ... [2019-11-24 04:53:31,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:53:31,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:53:32,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:53:32,607 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:53:32,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:53:32,937 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:53:32,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32 WrapperNode [2019-11-24 04:53:32,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:53:32,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:53:32,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:53:32,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:53:32,954 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:53:32" (1/1) ... [2019-11-24 04:53:33,025 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:53:32" (1/1) ... [2019-11-24 04:53:33,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:53:33,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:53:33,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:53:33,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:53:33,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (1/1) ... [2019-11-24 04:53:33,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:53:33,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:53:33,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:53:33,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:53:33,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (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:53:33,421 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-24 04:53:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:53:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:53:33,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:53:33,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:53:46,776 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:53:46,777 INFO L284 CfgBuilder]: Removed 637 assume(true) statements. [2019-11-24 04:53:46,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:53:46 BoogieIcfgContainer [2019-11-24 04:53:46,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:53:46,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:53:46,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:53:46,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:53:46,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:53:31" (1/3) ... [2019-11-24 04:53:46,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6687bd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:53:46, skipping insertion in model container [2019-11-24 04:53:46,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:53:32" (2/3) ... [2019-11-24 04:53:46,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6687bd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:53:46, skipping insertion in model container [2019-11-24 04:53:46,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:53:46" (3/3) ... [2019-11-24 04:53:46,786 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product21.cil.c [2019-11-24 04:53:46,794 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:53:46,803 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 04:53:46,811 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 04:53:46,832 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:53:46,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:53:46,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:53:46,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:53:46,832 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:53:46,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:53:46,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:53:46,832 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:53:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2019-11-24 04:53:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:53:46,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:46,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:53:46,854 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:46,859 INFO L82 PathProgramCache]: Analyzing trace with hash -553532291, now seen corresponding path program 1 times [2019-11-24 04:53:46,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:46,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643461761] [2019-11-24 04:53:46,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:47,215 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:53:47,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643461761] [2019-11-24 04:53:47,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:47,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:53:47,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852454559] [2019-11-24 04:53:47,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 04:53:47,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:47,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 04:53:47,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:53:47,238 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2019-11-24 04:53:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:47,261 INFO L93 Difference]: Finished difference Result 100 states and 153 transitions. [2019-11-24 04:53:47,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 04:53:47,262 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-24 04:53:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:47,275 INFO L225 Difference]: With dead ends: 100 [2019-11-24 04:53:47,275 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 04:53:47,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 04:53:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 04:53:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-24 04:53:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-24 04:53:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2019-11-24 04:53:47,324 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 8 [2019-11-24 04:53:47,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:47,325 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2019-11-24 04:53:47,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 04:53:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2019-11-24 04:53:47,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:53:47,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:47,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:53:47,327 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:47,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:47,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1545557988, now seen corresponding path program 1 times [2019-11-24 04:53:47,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:47,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438127668] [2019-11-24 04:53:47,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:47,445 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:53:47,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438127668] [2019-11-24 04:53:47,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:47,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:47,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024373536] [2019-11-24 04:53:47,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:47,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:47,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:47,449 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 3 states. [2019-11-24 04:53:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:47,468 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2019-11-24 04:53:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:47,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-24 04:53:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:47,470 INFO L225 Difference]: With dead ends: 94 [2019-11-24 04:53:47,470 INFO L226 Difference]: Without dead ends: 61 [2019-11-24 04:53:47,471 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:53:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-24 04:53:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-24 04:53:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-24 04:53:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2019-11-24 04:53:47,488 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 9 [2019-11-24 04:53:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:47,489 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2019-11-24 04:53:47,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2019-11-24 04:53:47,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:53:47,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:47,491 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:53:47,491 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:47,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:47,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1034606269, now seen corresponding path program 1 times [2019-11-24 04:53:47,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:47,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700709146] [2019-11-24 04:53:47,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:53:47,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700709146] [2019-11-24 04:53:47,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:47,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 04:53:47,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39475826] [2019-11-24 04:53:47,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:47,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:47,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:47,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:47,692 INFO L87 Difference]: Start difference. First operand 61 states and 88 transitions. Second operand 3 states. [2019-11-24 04:53:47,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:47,734 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2019-11-24 04:53:47,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:47,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-24 04:53:47,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:47,736 INFO L225 Difference]: With dead ends: 84 [2019-11-24 04:53:47,736 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 04:53:47,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 04:53:47,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-24 04:53:47,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-24 04:53:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2019-11-24 04:53:47,746 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 13 [2019-11-24 04:53:47,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:47,746 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2019-11-24 04:53:47,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:47,747 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2019-11-24 04:53:47,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:53:47,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:47,748 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:53:47,748 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:47,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1815998468, now seen corresponding path program 1 times [2019-11-24 04:53:47,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:47,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227045140] [2019-11-24 04:53:47,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:53:47,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227045140] [2019-11-24 04:53:47,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:47,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:53:47,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053741896] [2019-11-24 04:53:47,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:53:47,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:53:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:53:47,902 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand 5 states. [2019-11-24 04:53:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:48,088 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2019-11-24 04:53:48,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:53:48,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-24 04:53:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:48,090 INFO L225 Difference]: With dead ends: 124 [2019-11-24 04:53:48,090 INFO L226 Difference]: Without dead ends: 101 [2019-11-24 04:53:48,091 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:53:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-24 04:53:48,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2019-11-24 04:53:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-24 04:53:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 129 transitions. [2019-11-24 04:53:48,103 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 129 transitions. Word has length 15 [2019-11-24 04:53:48,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:48,103 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 129 transitions. [2019-11-24 04:53:48,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:53:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 129 transitions. [2019-11-24 04:53:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:53:48,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:48,105 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:53:48,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:48,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:48,106 INFO L82 PathProgramCache]: Analyzing trace with hash 638250520, now seen corresponding path program 1 times [2019-11-24 04:53:48,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:48,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168713945] [2019-11-24 04:53:48,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 04:53:48,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168713945] [2019-11-24 04:53:48,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:48,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:53:48,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281910653] [2019-11-24 04:53:48,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:53:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:48,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:53:48,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:53:48,327 INFO L87 Difference]: Start difference. First operand 81 states and 129 transitions. Second operand 5 states. [2019-11-24 04:53:48,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:48,533 INFO L93 Difference]: Finished difference Result 158 states and 254 transitions. [2019-11-24 04:53:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:53:48,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-24 04:53:48,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:48,535 INFO L225 Difference]: With dead ends: 158 [2019-11-24 04:53:48,536 INFO L226 Difference]: Without dead ends: 137 [2019-11-24 04:53:48,536 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:53:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-24 04:53:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-11-24 04:53:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-24 04:53:48,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 224 transitions. [2019-11-24 04:53:48,553 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 224 transitions. Word has length 18 [2019-11-24 04:53:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:48,554 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 224 transitions. [2019-11-24 04:53:48,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:53:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 224 transitions. [2019-11-24 04:53:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 04:53:48,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:48,556 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] [2019-11-24 04:53:48,556 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1419936525, now seen corresponding path program 1 times [2019-11-24 04:53:48,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:48,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511643637] [2019-11-24 04:53:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:48,624 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:53:48,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511643637] [2019-11-24 04:53:48,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:48,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:48,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187352235] [2019-11-24 04:53:48,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:48,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:48,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:48,626 INFO L87 Difference]: Start difference. First operand 133 states and 224 transitions. Second operand 3 states. [2019-11-24 04:53:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:48,656 INFO L93 Difference]: Finished difference Result 391 states and 660 transitions. [2019-11-24 04:53:48,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:48,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 04:53:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:48,658 INFO L225 Difference]: With dead ends: 391 [2019-11-24 04:53:48,659 INFO L226 Difference]: Without dead ends: 260 [2019-11-24 04:53:48,660 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:53:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-24 04:53:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 225. [2019-11-24 04:53:48,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-24 04:53:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 397 transitions. [2019-11-24 04:53:48,715 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 397 transitions. Word has length 22 [2019-11-24 04:53:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:48,716 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 397 transitions. [2019-11-24 04:53:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 397 transitions. [2019-11-24 04:53:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 04:53:48,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:48,718 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] [2019-11-24 04:53:48,718 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:48,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:48,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1771556004, now seen corresponding path program 1 times [2019-11-24 04:53:48,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:48,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479527857] [2019-11-24 04:53:48,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:48,781 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:53:48,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479527857] [2019-11-24 04:53:48,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:48,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:48,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064813795] [2019-11-24 04:53:48,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:48,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:48,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:48,783 INFO L87 Difference]: Start difference. First operand 225 states and 397 transitions. Second operand 3 states. [2019-11-24 04:53:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:48,818 INFO L93 Difference]: Finished difference Result 663 states and 1171 transitions. [2019-11-24 04:53:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:48,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 04:53:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:48,821 INFO L225 Difference]: With dead ends: 663 [2019-11-24 04:53:48,821 INFO L226 Difference]: Without dead ends: 440 [2019-11-24 04:53:48,822 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:53:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-11-24 04:53:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 405. [2019-11-24 04:53:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-24 04:53:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 731 transitions. [2019-11-24 04:53:48,854 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 731 transitions. Word has length 23 [2019-11-24 04:53:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:48,855 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 731 transitions. [2019-11-24 04:53:48,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 731 transitions. [2019-11-24 04:53:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 04:53:48,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:48,857 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] [2019-11-24 04:53:48,857 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:48,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash 946263227, now seen corresponding path program 1 times [2019-11-24 04:53:48,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:48,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561505469] [2019-11-24 04:53:48,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:48,914 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:53:48,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561505469] [2019-11-24 04:53:48,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:48,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:48,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342972013] [2019-11-24 04:53:48,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:48,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:48,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:48,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:48,916 INFO L87 Difference]: Start difference. First operand 405 states and 731 transitions. Second operand 3 states. [2019-11-24 04:53:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:48,977 INFO L93 Difference]: Finished difference Result 1195 states and 2157 transitions. [2019-11-24 04:53:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:48,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-24 04:53:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:48,982 INFO L225 Difference]: With dead ends: 1195 [2019-11-24 04:53:48,982 INFO L226 Difference]: Without dead ends: 792 [2019-11-24 04:53:48,983 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:53:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-11-24 04:53:49,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 757. [2019-11-24 04:53:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-24 04:53:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1375 transitions. [2019-11-24 04:53:49,037 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1375 transitions. Word has length 24 [2019-11-24 04:53:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:49,038 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1375 transitions. [2019-11-24 04:53:49,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1375 transitions. [2019-11-24 04:53:49,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 04:53:49,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:49,039 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] [2019-11-24 04:53:49,040 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:49,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1967462242, now seen corresponding path program 1 times [2019-11-24 04:53:49,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:49,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487757652] [2019-11-24 04:53:49,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:49,094 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:53:49,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487757652] [2019-11-24 04:53:49,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:49,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:49,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157162481] [2019-11-24 04:53:49,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:49,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:49,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:49,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:49,096 INFO L87 Difference]: Start difference. First operand 757 states and 1375 transitions. Second operand 3 states. [2019-11-24 04:53:49,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:49,214 INFO L93 Difference]: Finished difference Result 2235 states and 4057 transitions. [2019-11-24 04:53:49,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:49,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 04:53:49,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:49,223 INFO L225 Difference]: With dead ends: 2235 [2019-11-24 04:53:49,224 INFO L226 Difference]: Without dead ends: 1480 [2019-11-24 04:53:49,226 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:53:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-11-24 04:53:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1445. [2019-11-24 04:53:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-24 04:53:49,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2615 transitions. [2019-11-24 04:53:49,376 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2615 transitions. Word has length 25 [2019-11-24 04:53:49,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:49,376 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 2615 transitions. [2019-11-24 04:53:49,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:49,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2615 transitions. [2019-11-24 04:53:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-24 04:53:49,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:49,379 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:53:49,379 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:49,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 574524812, now seen corresponding path program 1 times [2019-11-24 04:53:49,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:49,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485954034] [2019-11-24 04:53:49,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:49,444 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:53:49,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485954034] [2019-11-24 04:53:49,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:49,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:49,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532758418] [2019-11-24 04:53:49,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:49,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:49,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:49,446 INFO L87 Difference]: Start difference. First operand 1445 states and 2615 transitions. Second operand 3 states. [2019-11-24 04:53:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:49,728 INFO L93 Difference]: Finished difference Result 4267 states and 7713 transitions. [2019-11-24 04:53:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:49,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-24 04:53:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:49,743 INFO L225 Difference]: With dead ends: 4267 [2019-11-24 04:53:49,744 INFO L226 Difference]: Without dead ends: 2824 [2019-11-24 04:53:49,746 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:53:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2019-11-24 04:53:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2789. [2019-11-24 04:53:49,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2789 states. [2019-11-24 04:53:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2789 states to 2789 states and 4999 transitions. [2019-11-24 04:53:49,960 INFO L78 Accepts]: Start accepts. Automaton has 2789 states and 4999 transitions. Word has length 26 [2019-11-24 04:53:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:49,962 INFO L462 AbstractCegarLoop]: Abstraction has 2789 states and 4999 transitions. [2019-11-24 04:53:49,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2789 states and 4999 transitions. [2019-11-24 04:53:49,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-24 04:53:49,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:49,966 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] [2019-11-24 04:53:49,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:49,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:49,967 INFO L82 PathProgramCache]: Analyzing trace with hash 449031055, now seen corresponding path program 1 times [2019-11-24 04:53:49,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:49,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628403060] [2019-11-24 04:53:49,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:50,098 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:53:50,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628403060] [2019-11-24 04:53:50,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:50,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:50,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920556039] [2019-11-24 04:53:50,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:50,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:50,100 INFO L87 Difference]: Start difference. First operand 2789 states and 4999 transitions. Second operand 3 states. [2019-11-24 04:53:50,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:50,352 INFO L93 Difference]: Finished difference Result 6917 states and 12427 transitions. [2019-11-24 04:53:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:50,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-24 04:53:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:50,375 INFO L225 Difference]: With dead ends: 6917 [2019-11-24 04:53:50,375 INFO L226 Difference]: Without dead ends: 4130 [2019-11-24 04:53:50,380 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:53:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2019-11-24 04:53:50,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4101. [2019-11-24 04:53:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-11-24 04:53:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 7271 transitions. [2019-11-24 04:53:50,639 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 7271 transitions. Word has length 27 [2019-11-24 04:53:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:50,639 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 7271 transitions. [2019-11-24 04:53:50,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 7271 transitions. [2019-11-24 04:53:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:53:50,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:50,641 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] [2019-11-24 04:53:50,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1217150619, now seen corresponding path program 1 times [2019-11-24 04:53:50,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:50,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940512465] [2019-11-24 04:53:50,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:51,454 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:53:51,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940512465] [2019-11-24 04:53:51,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:53:51,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:53:51,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256397240] [2019-11-24 04:53:51,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:53:51,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:53:51,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:53:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:53:51,456 INFO L87 Difference]: Start difference. First operand 4101 states and 7271 transitions. Second operand 3 states. [2019-11-24 04:53:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:53:51,873 INFO L93 Difference]: Finished difference Result 12107 states and 21425 transitions. [2019-11-24 04:53:51,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:53:51,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 04:53:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:53:51,918 INFO L225 Difference]: With dead ends: 12107 [2019-11-24 04:53:51,919 INFO L226 Difference]: Without dead ends: 8008 [2019-11-24 04:53:51,929 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:53:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2019-11-24 04:53:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 7973. [2019-11-24 04:53:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-11-24 04:53:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 13927 transitions. [2019-11-24 04:53:52,473 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 13927 transitions. Word has length 28 [2019-11-24 04:53:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:53:52,474 INFO L462 AbstractCegarLoop]: Abstraction has 7973 states and 13927 transitions. [2019-11-24 04:53:52,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:53:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 13927 transitions. [2019-11-24 04:53:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 04:53:52,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:53:52,477 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] [2019-11-24 04:53:52,477 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:53:52,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:53:52,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1268278232, now seen corresponding path program 1 times [2019-11-24 04:53:52,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:53:52,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3528857] [2019-11-24 04:53:52,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:53:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:52,719 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:53:52,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3528857] [2019-11-24 04:53:52,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356661671] [2019-11-24 04:53:52,720 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:53:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:53:53,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 04:53:53,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:53:53,115 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:53:53,116 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:53:53,146 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:53:53,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [245560394] [2019-11-24 04:53:53,193 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2019-11-24 04:53:53,194 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:53:53,200 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:53:53,208 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:53:53,209 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 04:54:34,604 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 679 [2019-11-24 04:54:38,332 WARN L192 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 299 DAG size of output: 243 [2019-11-24 04:54:38,698 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 720 [2019-11-24 04:54:41,132 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 1117