/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/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:33:01,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:33:01,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:33:01,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:33:01,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:33:01,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:33:01,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:33:01,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:33:01,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:33:01,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:33:01,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:33:01,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:33:01,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:33:01,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:33:01,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:33:01,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:33:01,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:33:01,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:33:01,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:33:01,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:33:01,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:33:01,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:33:01,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:33:01,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:33:01,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:33:01,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:33:01,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:33:01,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:33:01,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:33:01,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:33:01,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:33:01,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:33:01,911 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:33:01,912 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:33:01,913 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:33:01,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:33:01,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:33:01,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:33:01,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:33:01,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:33:01,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:33:01,917 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 03:33:01,931 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:33:01,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:33:01,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:33:01,932 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:33:01,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:33:01,933 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:33:01,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:33:01,933 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:33:01,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:33:01,933 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:33:01,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:33:01,934 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:33:01,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:33:01,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:33:01,934 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:33:01,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:33:01,935 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:33:01,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:33:01,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:33:01,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:33:01,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:33:01,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:33:01,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:33:01,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:33:01,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:33:01,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:33:01,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:33:01,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:33:01,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:33:01,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:33:01,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:33:01,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:33:01,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:33:01,939 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:33:01,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:33:01,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:33:01,939 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:33:01,940 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:33:02,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:33:02,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:33:02,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:33:02,238 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:33:02,239 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:33:02,239 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2019-11-24 03:33:02,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b18b5920/bc4622c04a0e405fa6b1d390ba612213/FLAGd1c9294b2 [2019-11-24 03:33:03,080 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:33:03,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2019-11-24 03:33:03,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b18b5920/bc4622c04a0e405fa6b1d390ba612213/FLAGd1c9294b2 [2019-11-24 03:33:03,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b18b5920/bc4622c04a0e405fa6b1d390ba612213 [2019-11-24 03:33:03,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:33:03,174 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:33:03,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:33:03,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:33:03,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:33:03,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:33:03" (1/1) ... [2019-11-24 03:33:03,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487ce357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:03, skipping insertion in model container [2019-11-24 03:33:03,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:33:03" (1/1) ... [2019-11-24 03:33:03,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:33:03,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:33:04,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:33:04,927 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:33:05,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:33:05,563 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:33:05,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05 WrapperNode [2019-11-24 03:33:05,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:33:05,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:33:05,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:33:05,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:33:05,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:05,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:05,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:33:05,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:33:05,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:33:05,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:33:05,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:05,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,015 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (1/1) ... [2019-11-24 03:33:06,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:33:06,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:33:06,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:33:06,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:33:06,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (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 03:33:06,546 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-24 03:33:06,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:33:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:33:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:33:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:33:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:33:06,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:33:06,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:33:06,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:33:32,209 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:33:32,209 INFO L284 CfgBuilder]: Removed 1133 assume(true) statements. [2019-11-24 03:33:32,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:33:32 BoogieIcfgContainer [2019-11-24 03:33:32,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:33:32,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:33:32,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:33:32,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:33:32,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:33:03" (1/3) ... [2019-11-24 03:33:32,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:33:32, skipping insertion in model container [2019-11-24 03:33:32,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:33:05" (2/3) ... [2019-11-24 03:33:32,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b46733b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:33:32, skipping insertion in model container [2019-11-24 03:33:32,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:33:32" (3/3) ... [2019-11-24 03:33:32,237 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--char--lp.ko-entry_point.cil.out.i [2019-11-24 03:33:32,256 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:33:32,273 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-24 03:33:32,292 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-24 03:33:32,351 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:33:32,351 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:33:32,351 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:33:32,351 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:33:32,352 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:33:32,352 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:33:32,352 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:33:32,352 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:33:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2019-11-24 03:33:32,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 03:33:32,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:32,420 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:32,420 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1528318886, now seen corresponding path program 1 times [2019-11-24 03:33:32,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:32,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382659998] [2019-11-24 03:33:32,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:33,437 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 03:33:33,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382659998] [2019-11-24 03:33:33,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:33,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:33,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454759469] [2019-11-24 03:33:33,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:33,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:33,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:33,465 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 3 states. [2019-11-24 03:33:33,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:33,786 INFO L93 Difference]: Finished difference Result 668 states and 1090 transitions. [2019-11-24 03:33:33,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:33,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 03:33:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:33,819 INFO L225 Difference]: With dead ends: 668 [2019-11-24 03:33:33,819 INFO L226 Difference]: Without dead ends: 368 [2019-11-24 03:33:33,827 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 03:33:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-24 03:33:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 352. [2019-11-24 03:33:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-11-24 03:33:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 560 transitions. [2019-11-24 03:33:33,945 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 560 transitions. Word has length 25 [2019-11-24 03:33:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:33,946 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 560 transitions. [2019-11-24 03:33:33,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 560 transitions. [2019-11-24 03:33:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 03:33:33,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:33,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:33,949 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:33,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1263594515, now seen corresponding path program 1 times [2019-11-24 03:33:33,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:33,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50735743] [2019-11-24 03:33:33,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:34,172 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 03:33:34,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50735743] [2019-11-24 03:33:34,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:34,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:34,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968791847] [2019-11-24 03:33:34,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:34,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:34,176 INFO L87 Difference]: Start difference. First operand 352 states and 560 transitions. Second operand 3 states. [2019-11-24 03:33:34,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:34,473 INFO L93 Difference]: Finished difference Result 975 states and 1547 transitions. [2019-11-24 03:33:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:34,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 03:33:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:34,478 INFO L225 Difference]: With dead ends: 975 [2019-11-24 03:33:34,478 INFO L226 Difference]: Without dead ends: 639 [2019-11-24 03:33:34,480 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 03:33:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-11-24 03:33:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 607. [2019-11-24 03:33:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-11-24 03:33:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 996 transitions. [2019-11-24 03:33:34,520 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 996 transitions. Word has length 25 [2019-11-24 03:33:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:34,527 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 996 transitions. [2019-11-24 03:33:34,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 996 transitions. [2019-11-24 03:33:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 03:33:34,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:34,529 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] [2019-11-24 03:33:34,529 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash 890370353, now seen corresponding path program 1 times [2019-11-24 03:33:34,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:34,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805406222] [2019-11-24 03:33:34,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:34,830 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 03:33:34,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805406222] [2019-11-24 03:33:34,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:34,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:34,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34846630] [2019-11-24 03:33:34,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:33:34,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:34,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:33:34,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:33:34,833 INFO L87 Difference]: Start difference. First operand 607 states and 996 transitions. Second operand 4 states. [2019-11-24 03:33:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:36,144 INFO L93 Difference]: Finished difference Result 1650 states and 2710 transitions. [2019-11-24 03:33:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:33:36,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-24 03:33:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:36,152 INFO L225 Difference]: With dead ends: 1650 [2019-11-24 03:33:36,152 INFO L226 Difference]: Without dead ends: 1059 [2019-11-24 03:33:36,154 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 03:33:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2019-11-24 03:33:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1007. [2019-11-24 03:33:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-11-24 03:33:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1695 transitions. [2019-11-24 03:33:36,196 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1695 transitions. Word has length 32 [2019-11-24 03:33:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:36,196 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1695 transitions. [2019-11-24 03:33:36,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:33:36,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1695 transitions. [2019-11-24 03:33:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 03:33:36,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:36,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:36,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:36,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1330464065, now seen corresponding path program 1 times [2019-11-24 03:33:36,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:36,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944101691] [2019-11-24 03:33:36,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:33:36,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944101691] [2019-11-24 03:33:36,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:36,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 03:33:36,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492183732] [2019-11-24 03:33:36,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:33:36,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:33:36,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:33:36,393 INFO L87 Difference]: Start difference. First operand 1007 states and 1695 transitions. Second operand 5 states. [2019-11-24 03:33:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:36,655 INFO L93 Difference]: Finished difference Result 3460 states and 5759 transitions. [2019-11-24 03:33:36,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 03:33:36,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-24 03:33:36,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:36,670 INFO L225 Difference]: With dead ends: 3460 [2019-11-24 03:33:36,671 INFO L226 Difference]: Without dead ends: 2484 [2019-11-24 03:33:36,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 03:33:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-11-24 03:33:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1016. [2019-11-24 03:33:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1016 states. [2019-11-24 03:33:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1700 transitions. [2019-11-24 03:33:36,741 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1700 transitions. Word has length 33 [2019-11-24 03:33:36,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:36,742 INFO L462 AbstractCegarLoop]: Abstraction has 1016 states and 1700 transitions. [2019-11-24 03:33:36,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:33:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1700 transitions. [2019-11-24 03:33:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-24 03:33:36,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:36,744 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 03:33:36,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:36,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:36,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1743916847, now seen corresponding path program 1 times [2019-11-24 03:33:36,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:36,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966331139] [2019-11-24 03:33:36,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:37,124 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 03:33:37,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966331139] [2019-11-24 03:33:37,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:37,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:33:37,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339426534] [2019-11-24 03:33:37,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:37,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:37,127 INFO L87 Difference]: Start difference. First operand 1016 states and 1700 transitions. Second operand 3 states. [2019-11-24 03:33:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:37,163 INFO L93 Difference]: Finished difference Result 1016 states and 1700 transitions. [2019-11-24 03:33:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:37,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-24 03:33:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:37,170 INFO L225 Difference]: With dead ends: 1016 [2019-11-24 03:33:37,170 INFO L226 Difference]: Without dead ends: 1014 [2019-11-24 03:33:37,171 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 03:33:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-24 03:33:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1014. [2019-11-24 03:33:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-11-24 03:33:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1698 transitions. [2019-11-24 03:33:37,218 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1698 transitions. Word has length 34 [2019-11-24 03:33:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:37,220 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 1698 transitions. [2019-11-24 03:33:37,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1698 transitions. [2019-11-24 03:33:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-24 03:33:37,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:37,222 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 03:33:37,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:37,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1773162569, now seen corresponding path program 1 times [2019-11-24 03:33:37,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:37,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50715126] [2019-11-24 03:33:37,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:37,431 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 03:33:37,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50715126] [2019-11-24 03:33:37,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:37,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:33:37,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759404921] [2019-11-24 03:33:37,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:37,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:37,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:37,433 INFO L87 Difference]: Start difference. First operand 1014 states and 1698 transitions. Second operand 3 states. [2019-11-24 03:33:37,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:37,475 INFO L93 Difference]: Finished difference Result 1014 states and 1698 transitions. [2019-11-24 03:33:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:37,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-24 03:33:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:37,482 INFO L225 Difference]: With dead ends: 1014 [2019-11-24 03:33:37,482 INFO L226 Difference]: Without dead ends: 1012 [2019-11-24 03:33:37,483 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 03:33:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-11-24 03:33:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2019-11-24 03:33:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-11-24 03:33:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1696 transitions. [2019-11-24 03:33:37,547 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1696 transitions. Word has length 35 [2019-11-24 03:33:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:37,558 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1696 transitions. [2019-11-24 03:33:37,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1696 transitions. [2019-11-24 03:33:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-24 03:33:37,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:37,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:37,563 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash -866525221, now seen corresponding path program 1 times [2019-11-24 03:33:37,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:37,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042369010] [2019-11-24 03:33:37,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:37,833 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 03:33:37,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042369010] [2019-11-24 03:33:37,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:37,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:33:37,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016508746] [2019-11-24 03:33:37,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:37,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:37,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:37,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:37,836 INFO L87 Difference]: Start difference. First operand 1012 states and 1696 transitions. Second operand 3 states. [2019-11-24 03:33:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:37,910 INFO L93 Difference]: Finished difference Result 1012 states and 1696 transitions. [2019-11-24 03:33:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:37,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-24 03:33:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:37,917 INFO L225 Difference]: With dead ends: 1012 [2019-11-24 03:33:37,917 INFO L226 Difference]: Without dead ends: 1004 [2019-11-24 03:33:37,918 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 03:33:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-11-24 03:33:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1004. [2019-11-24 03:33:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-11-24 03:33:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1679 transitions. [2019-11-24 03:33:37,972 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1679 transitions. Word has length 36 [2019-11-24 03:33:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:37,973 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1679 transitions. [2019-11-24 03:33:37,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1679 transitions. [2019-11-24 03:33:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 03:33:37,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:37,974 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 03:33:37,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:37,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:37,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1092468077, now seen corresponding path program 1 times [2019-11-24 03:33:37,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:37,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429988268] [2019-11-24 03:33:37,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:38,158 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 03:33:38,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429988268] [2019-11-24 03:33:38,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:38,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:33:38,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744224989] [2019-11-24 03:33:38,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:38,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:38,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:38,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:38,161 INFO L87 Difference]: Start difference. First operand 1004 states and 1679 transitions. Second operand 3 states. [2019-11-24 03:33:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:38,202 INFO L93 Difference]: Finished difference Result 1004 states and 1679 transitions. [2019-11-24 03:33:38,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:38,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 03:33:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:38,207 INFO L225 Difference]: With dead ends: 1004 [2019-11-24 03:33:38,208 INFO L226 Difference]: Without dead ends: 1002 [2019-11-24 03:33:38,208 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 03:33:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-11-24 03:33:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2019-11-24 03:33:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-11-24 03:33:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1677 transitions. [2019-11-24 03:33:38,260 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1677 transitions. Word has length 37 [2019-11-24 03:33:38,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:38,261 INFO L462 AbstractCegarLoop]: Abstraction has 1002 states and 1677 transitions. [2019-11-24 03:33:38,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1677 transitions. [2019-11-24 03:33:38,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-24 03:33:38,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:38,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:38,262 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:38,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 493237989, now seen corresponding path program 1 times [2019-11-24 03:33:38,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:38,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561931070] [2019-11-24 03:33:38,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:38,422 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 03:33:38,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561931070] [2019-11-24 03:33:38,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:38,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 03:33:38,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220330484] [2019-11-24 03:33:38,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:38,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:38,424 INFO L87 Difference]: Start difference. First operand 1002 states and 1677 transitions. Second operand 3 states. [2019-11-24 03:33:38,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:38,555 INFO L93 Difference]: Finished difference Result 1763 states and 2966 transitions. [2019-11-24 03:33:38,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:38,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-24 03:33:38,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:38,564 INFO L225 Difference]: With dead ends: 1763 [2019-11-24 03:33:38,564 INFO L226 Difference]: Without dead ends: 1745 [2019-11-24 03:33:38,565 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 03:33:38,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-11-24 03:33:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1739. [2019-11-24 03:33:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2019-11-24 03:33:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2924 transitions. [2019-11-24 03:33:38,688 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2924 transitions. Word has length 38 [2019-11-24 03:33:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:38,689 INFO L462 AbstractCegarLoop]: Abstraction has 1739 states and 2924 transitions. [2019-11-24 03:33:38,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2924 transitions. [2019-11-24 03:33:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 03:33:38,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:38,691 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:38,692 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash -438440289, now seen corresponding path program 1 times [2019-11-24 03:33:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:38,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365829704] [2019-11-24 03:33:38,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:33:38,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365829704] [2019-11-24 03:33:38,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:38,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:38,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605821886] [2019-11-24 03:33:38,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:38,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:38,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:38,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:38,858 INFO L87 Difference]: Start difference. First operand 1739 states and 2924 transitions. Second operand 3 states. [2019-11-24 03:33:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:39,156 INFO L93 Difference]: Finished difference Result 2803 states and 4689 transitions. [2019-11-24 03:33:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:39,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-24 03:33:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:39,162 INFO L225 Difference]: With dead ends: 2803 [2019-11-24 03:33:39,163 INFO L226 Difference]: Without dead ends: 1095 [2019-11-24 03:33:39,168 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 03:33:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2019-11-24 03:33:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1094. [2019-11-24 03:33:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2019-11-24 03:33:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1822 transitions. [2019-11-24 03:33:39,315 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1822 transitions. Word has length 48 [2019-11-24 03:33:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:39,316 INFO L462 AbstractCegarLoop]: Abstraction has 1094 states and 1822 transitions. [2019-11-24 03:33:39,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1822 transitions. [2019-11-24 03:33:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 03:33:39,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:39,318 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:39,318 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:39,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash -715989500, now seen corresponding path program 1 times [2019-11-24 03:33:39,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:39,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233212397] [2019-11-24 03:33:39,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-24 03:33:39,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233212397] [2019-11-24 03:33:39,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:39,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:39,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935456760] [2019-11-24 03:33:39,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:39,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:39,499 INFO L87 Difference]: Start difference. First operand 1094 states and 1822 transitions. Second operand 3 states. [2019-11-24 03:33:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:39,881 INFO L93 Difference]: Finished difference Result 1784 states and 2944 transitions. [2019-11-24 03:33:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:39,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-24 03:33:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:39,885 INFO L225 Difference]: With dead ends: 1784 [2019-11-24 03:33:39,886 INFO L226 Difference]: Without dead ends: 718 [2019-11-24 03:33:39,888 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 03:33:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-11-24 03:33:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 704. [2019-11-24 03:33:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-11-24 03:33:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1162 transitions. [2019-11-24 03:33:39,924 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1162 transitions. Word has length 49 [2019-11-24 03:33:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:39,924 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1162 transitions. [2019-11-24 03:33:39,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1162 transitions. [2019-11-24 03:33:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 03:33:39,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:39,926 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:39,926 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash -647000946, now seen corresponding path program 1 times [2019-11-24 03:33:39,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:39,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823153205] [2019-11-24 03:33:39,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 03:33:40,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823153205] [2019-11-24 03:33:40,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:40,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:40,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29046683] [2019-11-24 03:33:40,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:40,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:40,121 INFO L87 Difference]: Start difference. First operand 704 states and 1162 transitions. Second operand 3 states. [2019-11-24 03:33:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:40,688 INFO L93 Difference]: Finished difference Result 1393 states and 2291 transitions. [2019-11-24 03:33:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:40,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-24 03:33:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:40,693 INFO L225 Difference]: With dead ends: 1393 [2019-11-24 03:33:40,693 INFO L226 Difference]: Without dead ends: 858 [2019-11-24 03:33:40,695 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 03:33:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-11-24 03:33:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 846. [2019-11-24 03:33:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-24 03:33:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1396 transitions. [2019-11-24 03:33:40,751 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1396 transitions. Word has length 50 [2019-11-24 03:33:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:40,751 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1396 transitions. [2019-11-24 03:33:40,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1396 transitions. [2019-11-24 03:33:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 03:33:40,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:40,754 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:40,754 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:40,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:40,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1380159612, now seen corresponding path program 1 times [2019-11-24 03:33:40,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:40,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348344149] [2019-11-24 03:33:40,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 03:33:41,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348344149] [2019-11-24 03:33:41,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:41,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:33:41,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536104004] [2019-11-24 03:33:41,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:33:41,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:41,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:33:41,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:33:41,006 INFO L87 Difference]: Start difference. First operand 846 states and 1396 transitions. Second operand 4 states. [2019-11-24 03:33:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:41,492 INFO L93 Difference]: Finished difference Result 1170 states and 1920 transitions. [2019-11-24 03:33:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:33:41,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 03:33:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:41,498 INFO L225 Difference]: With dead ends: 1170 [2019-11-24 03:33:41,499 INFO L226 Difference]: Without dead ends: 1166 [2019-11-24 03:33:41,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:33:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-11-24 03:33:41,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 842. [2019-11-24 03:33:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-11-24 03:33:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1392 transitions. [2019-11-24 03:33:41,545 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1392 transitions. Word has length 50 [2019-11-24 03:33:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:41,546 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1392 transitions. [2019-11-24 03:33:41,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:33:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1392 transitions. [2019-11-24 03:33:41,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 03:33:41,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:41,547 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:41,548 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:41,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:41,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1536251967, now seen corresponding path program 1 times [2019-11-24 03:33:41,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:41,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737933900] [2019-11-24 03:33:41,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 03:33:41,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737933900] [2019-11-24 03:33:41,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:41,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:33:41,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284623100] [2019-11-24 03:33:41,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:33:41,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:33:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:33:41,733 INFO L87 Difference]: Start difference. First operand 842 states and 1392 transitions. Second operand 3 states. [2019-11-24 03:33:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:42,522 INFO L93 Difference]: Finished difference Result 842 states and 1392 transitions. [2019-11-24 03:33:42,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:33:42,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 03:33:42,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:42,527 INFO L225 Difference]: With dead ends: 842 [2019-11-24 03:33:42,527 INFO L226 Difference]: Without dead ends: 836 [2019-11-24 03:33:42,528 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 03:33:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-11-24 03:33:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-11-24 03:33:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-11-24 03:33:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1383 transitions. [2019-11-24 03:33:42,574 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1383 transitions. Word has length 54 [2019-11-24 03:33:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:42,575 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1383 transitions. [2019-11-24 03:33:42,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:33:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1383 transitions. [2019-11-24 03:33:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 03:33:42,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:42,576 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:42,577 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1705542909, now seen corresponding path program 1 times [2019-11-24 03:33:42,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:42,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36793777] [2019-11-24 03:33:42,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 03:33:42,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36793777] [2019-11-24 03:33:42,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:33:42,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 03:33:42,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459024826] [2019-11-24 03:33:42,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:33:42,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:33:42,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:33:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:33:42,880 INFO L87 Difference]: Start difference. First operand 836 states and 1383 transitions. Second operand 5 states. [2019-11-24 03:33:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:33:43,342 INFO L93 Difference]: Finished difference Result 1542 states and 2516 transitions. [2019-11-24 03:33:43,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 03:33:43,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-24 03:33:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:33:43,347 INFO L225 Difference]: With dead ends: 1542 [2019-11-24 03:33:43,347 INFO L226 Difference]: Without dead ends: 810 [2019-11-24 03:33:43,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 03:33:43,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2019-11-24 03:33:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 786. [2019-11-24 03:33:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-11-24 03:33:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1293 transitions. [2019-11-24 03:33:43,406 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1293 transitions. Word has length 57 [2019-11-24 03:33:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:33:43,407 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 1293 transitions. [2019-11-24 03:33:43,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:33:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1293 transitions. [2019-11-24 03:33:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-24 03:33:43,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:33:43,409 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:33:43,410 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:33:43,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:33:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 655976334, now seen corresponding path program 1 times [2019-11-24 03:33:43,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:33:43,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829040423] [2019-11-24 03:33:43,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:33:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 03:33:44,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829040423] [2019-11-24 03:33:44,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657713505] [2019-11-24 03:33:44,030 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 03:33:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:33:45,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 3458 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 03:33:45,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:33:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 03:33:45,265 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:33:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-24 03:33:45,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091354305] [2019-11-24 03:33:45,344 INFO L159 IcfgInterpreter]: Started Sifa with 48 locations of interest [2019-11-24 03:33:45,344 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:33:45,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:33:45,363 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:33:45,363 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 03:33:46,935 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 03:33:50,373 WARN L192 SmtUtils]: Spent 3.43 s on a formula simplification that was a NOOP. DAG size: 3578