/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-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:15:18,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:15:18,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:15:18,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:15:18,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:15:18,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:15:18,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:15:18,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:15:18,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:15:18,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:15:18,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:15:18,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:15:18,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:15:18,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:15:18,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:15:18,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:15:18,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:15:18,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:15:18,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:15:18,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:15:18,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:15:18,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:15:18,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:15:18,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:15:18,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:15:18,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:15:18,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:15:18,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:15:18,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:15:18,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:15:18,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:15:18,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:15:18,106 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:15:18,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:15:18,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:15:18,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:15:18,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:15:18,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:15:18,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:15:18,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:15:18,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:15:18,112 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 01:15:18,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:15:18,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:15:18,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:15:18,129 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:15:18,129 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:15:18,130 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:15:18,130 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:15:18,130 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:15:18,130 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:15:18,130 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:15:18,131 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:15:18,131 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:15:18,131 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:15:18,131 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:15:18,131 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:15:18,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:15:18,132 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:15:18,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:15:18,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:15:18,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:15:18,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:15:18,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:15:18,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:15:18,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:15:18,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:15:18,134 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:15:18,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:15:18,135 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:15:18,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:15:18,135 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:15:18,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:15:18,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:15:18,136 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:15:18,136 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:15:18,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:15:18,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:15:18,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:15:18,137 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:15:18,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:15:18,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:15:18,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:15:18,462 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:15:18,462 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:15:18,463 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-24 01:15:18,541 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1140fec87/38cccd52669348439314857913690fa7/FLAG98d5c514a [2019-11-24 01:15:19,286 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:15:19,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-24 01:15:19,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1140fec87/38cccd52669348439314857913690fa7/FLAG98d5c514a [2019-11-24 01:15:19,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1140fec87/38cccd52669348439314857913690fa7 [2019-11-24 01:15:19,350 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:15:19,351 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:15:19,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:15:19,353 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:15:19,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:15:19,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:15:19" (1/1) ... [2019-11-24 01:15:19,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e76b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:19, skipping insertion in model container [2019-11-24 01:15:19,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:15:19" (1/1) ... [2019-11-24 01:15:19,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:15:19,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:15:20,558 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-24 01:15:20,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:15:20,614 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:15:20,805 WARN L612 FunctionHandler]: implicit declaration of function ldv_malloc [2019-11-24 01:15:20,808 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:15:20,903 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:15:20,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20 WrapperNode [2019-11-24 01:15:20,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:15:20,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:15:20,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:15:20,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:15:20,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:20,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:15:21,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:15:21,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:15:21,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:15:21,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (1/1) ... [2019-11-24 01:15:21,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:15:21,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:15:21,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:15:21,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:15:21,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (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 01:15:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:15:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:15:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:15:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:15:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-24 01:15:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:15:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:15:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:15:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:15:21,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:15:21,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:15:22,057 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-24 01:15:23,360 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2019-11-24 01:15:23,361 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2019-11-24 01:15:42,453 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:15:42,454 INFO L284 CfgBuilder]: Removed 125 assume(true) statements. [2019-11-24 01:15:42,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:15:42 BoogieIcfgContainer [2019-11-24 01:15:42,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:15:42,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:15:42,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:15:42,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:15:42,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:15:19" (1/3) ... [2019-11-24 01:15:42,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1587bdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:15:42, skipping insertion in model container [2019-11-24 01:15:42,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:15:20" (2/3) ... [2019-11-24 01:15:42,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1587bdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:15:42, skipping insertion in model container [2019-11-24 01:15:42,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:15:42" (3/3) ... [2019-11-24 01:15:42,463 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-11-24 01:15:42,471 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:15:42,478 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-24 01:15:42,489 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-24 01:15:42,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:15:42,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:15:42,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:15:42,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:15:42,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:15:42,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:15:42,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:15:42,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:15:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-11-24 01:15:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-24 01:15:42,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:42,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-24 01:15:42,539 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:42,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:42,545 INFO L82 PathProgramCache]: Analyzing trace with hash 15553357, now seen corresponding path program 1 times [2019-11-24 01:15:42,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:42,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284246293] [2019-11-24 01:15:42,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:43,058 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 01:15:43,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284246293] [2019-11-24 01:15:43,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:43,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:15:43,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482625806] [2019-11-24 01:15:43,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:15:43,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:15:43,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:15:43,088 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2019-11-24 01:15:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:43,164 INFO L93 Difference]: Finished difference Result 159 states and 240 transitions. [2019-11-24 01:15:43,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:15:43,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-24 01:15:43,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:43,179 INFO L225 Difference]: With dead ends: 159 [2019-11-24 01:15:43,179 INFO L226 Difference]: Without dead ends: 89 [2019-11-24 01:15:43,183 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 01:15:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-24 01:15:43,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-11-24 01:15:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-24 01:15:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2019-11-24 01:15:43,225 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 4 [2019-11-24 01:15:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:43,226 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2019-11-24 01:15:43,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:15:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2019-11-24 01:15:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-24 01:15:43,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:43,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-24 01:15:43,227 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash 482152812, now seen corresponding path program 1 times [2019-11-24 01:15:43,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:43,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665744971] [2019-11-24 01:15:43,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:43,329 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 01:15:43,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665744971] [2019-11-24 01:15:43,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:43,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 01:15:43,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476713379] [2019-11-24 01:15:43,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:15:43,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:43,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:15:43,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:15:43,333 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand 3 states. [2019-11-24 01:15:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:43,395 INFO L93 Difference]: Finished difference Result 198 states and 265 transitions. [2019-11-24 01:15:43,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:15:43,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-24 01:15:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:43,398 INFO L225 Difference]: With dead ends: 198 [2019-11-24 01:15:43,399 INFO L226 Difference]: Without dead ends: 112 [2019-11-24 01:15:43,403 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 01:15:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-24 01:15:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-11-24 01:15:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-24 01:15:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 144 transitions. [2019-11-24 01:15:43,423 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 144 transitions. Word has length 5 [2019-11-24 01:15:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:43,423 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 144 transitions. [2019-11-24 01:15:43,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:15:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2019-11-24 01:15:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 01:15:43,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:43,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:43,425 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:43,427 INFO L82 PathProgramCache]: Analyzing trace with hash 625856019, now seen corresponding path program 1 times [2019-11-24 01:15:43,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:43,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813090465] [2019-11-24 01:15:43,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:43,586 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 01:15:43,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813090465] [2019-11-24 01:15:43,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:43,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 01:15:43,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615945666] [2019-11-24 01:15:43,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:43,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:43,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:43,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:43,589 INFO L87 Difference]: Start difference. First operand 107 states and 144 transitions. Second operand 5 states. [2019-11-24 01:15:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:43,949 INFO L93 Difference]: Finished difference Result 293 states and 410 transitions. [2019-11-24 01:15:43,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 01:15:43,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-24 01:15:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:43,952 INFO L225 Difference]: With dead ends: 293 [2019-11-24 01:15:43,952 INFO L226 Difference]: Without dead ends: 186 [2019-11-24 01:15:43,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-24 01:15:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-24 01:15:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 154. [2019-11-24 01:15:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-24 01:15:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-24 01:15:43,972 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 13 [2019-11-24 01:15:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:43,973 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-24 01:15:43,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-24 01:15:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:15:43,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:43,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:43,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:43,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:43,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1026634581, now seen corresponding path program 1 times [2019-11-24 01:15:43,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:43,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443204444] [2019-11-24 01:15:43,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:44,137 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 01:15:44,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443204444] [2019-11-24 01:15:44,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:44,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:15:44,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819155208] [2019-11-24 01:15:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:15:44,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:44,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:15:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:15:44,140 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 4 states. [2019-11-24 01:15:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:44,210 INFO L93 Difference]: Finished difference Result 273 states and 374 transitions. [2019-11-24 01:15:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:15:44,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 01:15:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:44,213 INFO L225 Difference]: With dead ends: 273 [2019-11-24 01:15:44,213 INFO L226 Difference]: Without dead ends: 154 [2019-11-24 01:15:44,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:15:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-24 01:15:44,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2019-11-24 01:15:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-24 01:15:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 152 transitions. [2019-11-24 01:15:44,226 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 152 transitions. Word has length 17 [2019-11-24 01:15:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:44,226 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 152 transitions. [2019-11-24 01:15:44,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:15:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 152 transitions. [2019-11-24 01:15:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:15:44,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:44,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:44,228 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:44,228 INFO L82 PathProgramCache]: Analyzing trace with hash -748222420, now seen corresponding path program 1 times [2019-11-24 01:15:44,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:44,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666029712] [2019-11-24 01:15:44,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:44,340 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 01:15:44,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666029712] [2019-11-24 01:15:44,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:44,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:15:44,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833719407] [2019-11-24 01:15:44,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:15:44,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:15:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:15:44,343 INFO L87 Difference]: Start difference. First operand 113 states and 152 transitions. Second operand 4 states. [2019-11-24 01:15:44,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:44,401 INFO L93 Difference]: Finished difference Result 176 states and 229 transitions. [2019-11-24 01:15:44,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:15:44,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 01:15:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:44,403 INFO L225 Difference]: With dead ends: 176 [2019-11-24 01:15:44,403 INFO L226 Difference]: Without dead ends: 169 [2019-11-24 01:15:44,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:15:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-24 01:15:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 115. [2019-11-24 01:15:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-24 01:15:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 154 transitions. [2019-11-24 01:15:44,416 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 154 transitions. Word has length 17 [2019-11-24 01:15:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:44,416 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 154 transitions. [2019-11-24 01:15:44,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:15:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 154 transitions. [2019-11-24 01:15:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:15:44,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:44,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:44,418 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash -737739057, now seen corresponding path program 1 times [2019-11-24 01:15:44,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:44,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307278523] [2019-11-24 01:15:44,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:44,698 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 01:15:44,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307278523] [2019-11-24 01:15:44,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:44,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:15:44,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287362585] [2019-11-24 01:15:44,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:44,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:44,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:44,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:44,701 INFO L87 Difference]: Start difference. First operand 115 states and 154 transitions. Second operand 5 states. [2019-11-24 01:15:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:46,854 INFO L93 Difference]: Finished difference Result 192 states and 253 transitions. [2019-11-24 01:15:46,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:15:46,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-24 01:15:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:46,856 INFO L225 Difference]: With dead ends: 192 [2019-11-24 01:15:46,856 INFO L226 Difference]: Without dead ends: 185 [2019-11-24 01:15:46,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-24 01:15:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 175. [2019-11-24 01:15:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-24 01:15:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 241 transitions. [2019-11-24 01:15:46,868 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 241 transitions. Word has length 17 [2019-11-24 01:15:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:46,868 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 241 transitions. [2019-11-24 01:15:46,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 241 transitions. [2019-11-24 01:15:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 01:15:46,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:46,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:46,870 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:46,870 INFO L82 PathProgramCache]: Analyzing trace with hash -225171483, now seen corresponding path program 1 times [2019-11-24 01:15:46,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:46,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828045916] [2019-11-24 01:15:46,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:47,064 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 01:15:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828045916] [2019-11-24 01:15:47,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:47,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 01:15:47,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430652210] [2019-11-24 01:15:47,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 01:15:47,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 01:15:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 01:15:47,066 INFO L87 Difference]: Start difference. First operand 175 states and 241 transitions. Second operand 6 states. [2019-11-24 01:15:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:49,512 INFO L93 Difference]: Finished difference Result 505 states and 695 transitions. [2019-11-24 01:15:49,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 01:15:49,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-24 01:15:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:49,516 INFO L225 Difference]: With dead ends: 505 [2019-11-24 01:15:49,516 INFO L226 Difference]: Without dead ends: 501 [2019-11-24 01:15:49,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-24 01:15:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-24 01:15:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 260. [2019-11-24 01:15:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-11-24 01:15:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 366 transitions. [2019-11-24 01:15:49,537 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 366 transitions. Word has length 17 [2019-11-24 01:15:49,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:49,538 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 366 transitions. [2019-11-24 01:15:49,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 01:15:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 366 transitions. [2019-11-24 01:15:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 01:15:49,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:49,539 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:49,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:49,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:49,540 INFO L82 PathProgramCache]: Analyzing trace with hash -653232597, now seen corresponding path program 1 times [2019-11-24 01:15:49,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:49,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731409222] [2019-11-24 01:15:49,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:15:49,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731409222] [2019-11-24 01:15:49,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123023056] [2019-11-24 01:15:49,690 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 01:15:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:50,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-24 01:15:50,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:15:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:15:50,090 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:15:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:15:50,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 01:15:50,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-11-24 01:15:50,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591109177] [2019-11-24 01:15:50,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:15:50,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:50,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:15:50,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:50,119 INFO L87 Difference]: Start difference. First operand 260 states and 366 transitions. Second operand 4 states. [2019-11-24 01:15:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:50,232 INFO L93 Difference]: Finished difference Result 518 states and 730 transitions. [2019-11-24 01:15:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:15:50,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 01:15:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:50,234 INFO L225 Difference]: With dead ends: 518 [2019-11-24 01:15:50,234 INFO L226 Difference]: Without dead ends: 220 [2019-11-24 01:15:50,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-24 01:15:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-24 01:15:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-24 01:15:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 290 transitions. [2019-11-24 01:15:50,255 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 290 transitions. Word has length 20 [2019-11-24 01:15:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:50,256 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 290 transitions. [2019-11-24 01:15:50,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:15:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 290 transitions. [2019-11-24 01:15:50,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:15:50,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:50,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:50,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:15:50,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -523319936, now seen corresponding path program 1 times [2019-11-24 01:15:50,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:50,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188464282] [2019-11-24 01:15:50,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:50,621 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 01:15:50,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188464282] [2019-11-24 01:15:50,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:50,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:15:50,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041633578] [2019-11-24 01:15:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:15:50,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:50,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:15:50,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:15:50,624 INFO L87 Difference]: Start difference. First operand 220 states and 290 transitions. Second operand 3 states. [2019-11-24 01:15:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:50,665 INFO L93 Difference]: Finished difference Result 421 states and 549 transitions. [2019-11-24 01:15:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:15:50,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-24 01:15:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:50,667 INFO L225 Difference]: With dead ends: 421 [2019-11-24 01:15:50,667 INFO L226 Difference]: Without dead ends: 203 [2019-11-24 01:15:50,668 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 01:15:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-24 01:15:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 152. [2019-11-24 01:15:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-24 01:15:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2019-11-24 01:15:50,682 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 22 [2019-11-24 01:15:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:50,684 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2019-11-24 01:15:50,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:15:50,685 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2019-11-24 01:15:50,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:15:50,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:50,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:50,689 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:50,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:50,689 INFO L82 PathProgramCache]: Analyzing trace with hash 803316640, now seen corresponding path program 1 times [2019-11-24 01:15:50,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:50,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243701597] [2019-11-24 01:15:50,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:50,802 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 01:15:50,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243701597] [2019-11-24 01:15:50,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:50,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:15:50,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545151181] [2019-11-24 01:15:50,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:15:50,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:50,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:15:50,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:15:50,805 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand 4 states. [2019-11-24 01:15:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:52,920 INFO L93 Difference]: Finished difference Result 260 states and 324 transitions. [2019-11-24 01:15:52,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:15:52,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-24 01:15:52,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:52,921 INFO L225 Difference]: With dead ends: 260 [2019-11-24 01:15:52,921 INFO L226 Difference]: Without dead ends: 155 [2019-11-24 01:15:52,923 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 01:15:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-24 01:15:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 125. [2019-11-24 01:15:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-24 01:15:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2019-11-24 01:15:52,933 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 22 [2019-11-24 01:15:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:52,933 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2019-11-24 01:15:52,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:15:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2019-11-24 01:15:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-24 01:15:52,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:52,934 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:52,934 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1345436625, now seen corresponding path program 1 times [2019-11-24 01:15:52,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:52,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419418746] [2019-11-24 01:15:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:15:53,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419418746] [2019-11-24 01:15:53,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:53,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 01:15:53,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188194551] [2019-11-24 01:15:53,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:53,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:53,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:53,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:53,008 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 5 states. [2019-11-24 01:15:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:55,153 INFO L93 Difference]: Finished difference Result 217 states and 258 transitions. [2019-11-24 01:15:55,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 01:15:55,156 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-24 01:15:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:55,158 INFO L225 Difference]: With dead ends: 217 [2019-11-24 01:15:55,158 INFO L226 Difference]: Without dead ends: 136 [2019-11-24 01:15:55,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 01:15:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-24 01:15:55,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2019-11-24 01:15:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-24 01:15:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 143 transitions. [2019-11-24 01:15:55,170 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 143 transitions. Word has length 22 [2019-11-24 01:15:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:55,171 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 143 transitions. [2019-11-24 01:15:55,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 143 transitions. [2019-11-24 01:15:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-24 01:15:55,172 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:55,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:55,172 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:55,172 INFO L82 PathProgramCache]: Analyzing trace with hash -866989191, now seen corresponding path program 1 times [2019-11-24 01:15:55,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:55,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073003405] [2019-11-24 01:15:55,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:55,311 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 01:15:55,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073003405] [2019-11-24 01:15:55,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:55,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:15:55,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284420515] [2019-11-24 01:15:55,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:15:55,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:15:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:15:55,314 INFO L87 Difference]: Start difference. First operand 120 states and 143 transitions. Second operand 3 states. [2019-11-24 01:15:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:55,346 INFO L93 Difference]: Finished difference Result 207 states and 245 transitions. [2019-11-24 01:15:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:15:55,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-24 01:15:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:55,348 INFO L225 Difference]: With dead ends: 207 [2019-11-24 01:15:55,348 INFO L226 Difference]: Without dead ends: 125 [2019-11-24 01:15:55,349 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 01:15:55,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-24 01:15:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2019-11-24 01:15:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-24 01:15:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-11-24 01:15:55,361 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 23 [2019-11-24 01:15:55,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:55,361 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-11-24 01:15:55,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:15:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-11-24 01:15:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 01:15:55,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:55,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:55,369 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash -879440635, now seen corresponding path program 1 times [2019-11-24 01:15:55,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887699857] [2019-11-24 01:15:55,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:55,502 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 01:15:55,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887699857] [2019-11-24 01:15:55,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:55,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:15:55,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873727015] [2019-11-24 01:15:55,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:55,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:55,505 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 5 states. [2019-11-24 01:15:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:55,639 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2019-11-24 01:15:55,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:15:55,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 01:15:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:55,641 INFO L225 Difference]: With dead ends: 137 [2019-11-24 01:15:55,641 INFO L226 Difference]: Without dead ends: 133 [2019-11-24 01:15:55,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-24 01:15:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-24 01:15:55,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-24 01:15:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2019-11-24 01:15:55,658 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 24 [2019-11-24 01:15:55,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:55,658 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2019-11-24 01:15:55,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2019-11-24 01:15:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 01:15:55,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:55,659 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 01:15:55,659 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:55,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:55,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1621126092, now seen corresponding path program 1 times [2019-11-24 01:15:55,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:55,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348043368] [2019-11-24 01:15:55,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:55,816 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 01:15:55,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348043368] [2019-11-24 01:15:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:15:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852445418] [2019-11-24 01:15:55,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:55,818 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand 5 states. [2019-11-24 01:15:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:55,943 INFO L93 Difference]: Finished difference Result 239 states and 273 transitions. [2019-11-24 01:15:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:15:55,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-24 01:15:55,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:55,944 INFO L225 Difference]: With dead ends: 239 [2019-11-24 01:15:55,944 INFO L226 Difference]: Without dead ends: 150 [2019-11-24 01:15:55,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-24 01:15:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2019-11-24 01:15:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-24 01:15:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 166 transitions. [2019-11-24 01:15:55,955 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 166 transitions. Word has length 25 [2019-11-24 01:15:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:55,955 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 166 transitions. [2019-11-24 01:15:55,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2019-11-24 01:15:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 01:15:55,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:55,956 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] [2019-11-24 01:15:55,957 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -954421659, now seen corresponding path program 1 times [2019-11-24 01:15:55,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:55,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886972777] [2019-11-24 01:15:55,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:56,523 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 01:15:56,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886972777] [2019-11-24 01:15:56,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:56,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:15:56,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49537496] [2019-11-24 01:15:56,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:56,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:56,525 INFO L87 Difference]: Start difference. First operand 144 states and 166 transitions. Second operand 5 states. [2019-11-24 01:15:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:56,636 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2019-11-24 01:15:56,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:15:56,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-24 01:15:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:56,638 INFO L225 Difference]: With dead ends: 155 [2019-11-24 01:15:56,638 INFO L226 Difference]: Without dead ends: 139 [2019-11-24 01:15:56,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-24 01:15:56,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2019-11-24 01:15:56,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-24 01:15:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2019-11-24 01:15:56,651 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 31 [2019-11-24 01:15:56,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:56,651 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2019-11-24 01:15:56,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:56,652 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2019-11-24 01:15:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 01:15:56,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:56,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:15:56,653 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:56,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:56,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1110944814, now seen corresponding path program 1 times [2019-11-24 01:15:56,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:56,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109374937] [2019-11-24 01:15:56,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:15:57,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109374937] [2019-11-24 01:15:57,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:15:57,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 01:15:57,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234700981] [2019-11-24 01:15:57,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 01:15:57,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:15:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 01:15:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:15:57,043 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand 5 states. [2019-11-24 01:15:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:15:59,219 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2019-11-24 01:15:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:15:59,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-24 01:15:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:15:59,220 INFO L225 Difference]: With dead ends: 139 [2019-11-24 01:15:59,220 INFO L226 Difference]: Without dead ends: 109 [2019-11-24 01:15:59,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 01:15:59,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-24 01:15:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-24 01:15:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-24 01:15:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-11-24 01:15:59,261 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 39 [2019-11-24 01:15:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:15:59,262 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-11-24 01:15:59,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 01:15:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-11-24 01:15:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 01:15:59,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:15:59,263 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 01:15:59,263 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:15:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:15:59,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1597979231, now seen corresponding path program 1 times [2019-11-24 01:15:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:15:59,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982362202] [2019-11-24 01:15:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:15:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:15:59,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 01:15:59,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982362202] [2019-11-24 01:15:59,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093052094] [2019-11-24 01:15:59,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 01:16:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:16:00,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-24 01:16:00,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 01:16:00,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:16:00,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:16:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:16:00,178 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 01:16:00,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 01:16:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:16:00,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127240540] [2019-11-24 01:16:00,258 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2019-11-24 01:16:00,258 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 01:16:00,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 01:16:00,280 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 01:16:00,281 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 01:16:04,002 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 856 [2019-11-24 01:16:04,520 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 902 [2019-11-24 01:16:04,913 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 912 [2019-11-24 01:16:05,475 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 963 [2019-11-24 01:16:05,913 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 992 [2019-11-24 01:16:06,314 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 1030 [2019-11-24 01:16:07,087 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 1021 [2019-11-24 01:16:07,590 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:07,787 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:07,963 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:13,120 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2019-11-24 01:16:13,320 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:13,480 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:13,634 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:13,778 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:13,905 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:17,854 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2019-11-24 01:16:18,030 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:18,190 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 01:16:19,619 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 1378 [2019-11-24 01:16:23,884 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2019-11-24 01:16:25,697 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2019-11-24 01:16:27,123 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 1446 [2019-11-24 01:16:37,010 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 1439