/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-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 03:59:05,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 03:59:05,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 03:59:05,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 03:59:05,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 03:59:05,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 03:59:05,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 03:59:05,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 03:59:05,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 03:59:05,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 03:59:05,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 03:59:05,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 03:59:05,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 03:59:05,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 03:59:05,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 03:59:05,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 03:59:05,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 03:59:05,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 03:59:05,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 03:59:05,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 03:59:05,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 03:59:05,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 03:59:05,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 03:59:05,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 03:59:05,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 03:59:05,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 03:59:05,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 03:59:05,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 03:59:05,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 03:59:05,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 03:59:05,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 03:59:05,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 03:59:05,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 03:59:05,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 03:59:05,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 03:59:05,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 03:59:05,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 03:59:05,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 03:59:05,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 03:59:05,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 03:59:05,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 03:59:05,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 03:59:05,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 03:59:05,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 03:59:05,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 03:59:05,096 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 03:59:05,097 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 03:59:05,100 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 03:59:05,100 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 03:59:05,100 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 03:59:05,100 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 03:59:05,101 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 03:59:05,101 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 03:59:05,101 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 03:59:05,101 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 03:59:05,101 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 03:59:05,104 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 03:59:05,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 03:59:05,105 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 03:59:05,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 03:59:05,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 03:59:05,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 03:59:05,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 03:59:05,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 03:59:05,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 03:59:05,106 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 03:59:05,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 03:59:05,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 03:59:05,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 03:59:05,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 03:59:05,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 03:59:05,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:59:05,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 03:59:05,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 03:59:05,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 03:59:05,108 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 03:59:05,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 03:59:05,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 03:59:05,109 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 03:59:05,109 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 03:59:05,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 03:59:05,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 03:59:05,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 03:59:05,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 03:59:05,413 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 03:59:05,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2019-11-24 03:59:05,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d3daa0/79a6a8c8de0743c9a44596166dabb00f/FLAG1d6e95d0b [2019-11-24 03:59:06,251 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 03:59:06,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.6/linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2019-11-24 03:59:06,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d3daa0/79a6a8c8de0743c9a44596166dabb00f/FLAG1d6e95d0b [2019-11-24 03:59:06,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/471d3daa0/79a6a8c8de0743c9a44596166dabb00f [2019-11-24 03:59:06,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 03:59:06,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 03:59:06,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 03:59:06,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 03:59:06,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 03:59:06,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:59:06" (1/1) ... [2019-11-24 03:59:06,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e7e49e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:06, skipping insertion in model container [2019-11-24 03:59:06,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 03:59:06" (1/1) ... [2019-11-24 03:59:06,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 03:59:06,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 03:59:07,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:59:07,491 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 03:59:07,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 03:59:07,721 INFO L208 MainTranslator]: Completed translation [2019-11-24 03:59:07,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07 WrapperNode [2019-11-24 03:59:07,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 03:59:07,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 03:59:07,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 03:59:07,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 03:59:07,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:07,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:07,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 03:59:07,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 03:59:07,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 03:59:07,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 03:59:07,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:07,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... [2019-11-24 03:59:08,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 03:59:08,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 03:59:08,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 03:59:08,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 03:59:08,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 03:59:08,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 03:59:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 03:59:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 03:59:08,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 03:59:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 03:59:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 03:59:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 03:59:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 03:59:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 03:59:08,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 03:59:17,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 03:59:17,441 INFO L284 CfgBuilder]: Removed 754 assume(true) statements. [2019-11-24 03:59:17,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:59:17 BoogieIcfgContainer [2019-11-24 03:59:17,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 03:59:17,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 03:59:17,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 03:59:17,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 03:59:17,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 03:59:06" (1/3) ... [2019-11-24 03:59:17,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7d51df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:59:17, skipping insertion in model container [2019-11-24 03:59:17,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 03:59:07" (2/3) ... [2019-11-24 03:59:17,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7d51df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 03:59:17, skipping insertion in model container [2019-11-24 03:59:17,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 03:59:17" (3/3) ... [2019-11-24 03:59:17,449 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-9ec4f65-1-110_1a-drivers--rtc--rtc-tegra.ko-entry_point.cil.out.i [2019-11-24 03:59:17,457 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 03:59:17,463 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2019-11-24 03:59:17,472 INFO L249 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2019-11-24 03:59:17,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 03:59:17,504 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 03:59:17,505 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 03:59:17,505 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 03:59:17,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 03:59:17,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 03:59:17,505 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 03:59:17,505 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 03:59:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states. [2019-11-24 03:59:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 03:59:17,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:17,542 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:17,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:17,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1488491196, now seen corresponding path program 1 times [2019-11-24 03:59:17,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:17,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314971198] [2019-11-24 03:59:17,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:17,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314971198] [2019-11-24 03:59:17,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:17,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:17,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858125396] [2019-11-24 03:59:17,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:59:17,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:17,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:59:17,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:17,934 INFO L87 Difference]: Start difference. First operand 287 states. Second operand 3 states. [2019-11-24 03:59:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:18,106 INFO L93 Difference]: Finished difference Result 439 states and 653 transitions. [2019-11-24 03:59:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:59:18,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-24 03:59:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:18,217 INFO L225 Difference]: With dead ends: 439 [2019-11-24 03:59:18,217 INFO L226 Difference]: Without dead ends: 147 [2019-11-24 03:59:18,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-24 03:59:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-11-24 03:59:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-24 03:59:18,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 205 transitions. [2019-11-24 03:59:18,310 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 205 transitions. Word has length 16 [2019-11-24 03:59:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:18,311 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 205 transitions. [2019-11-24 03:59:18,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:59:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 205 transitions. [2019-11-24 03:59:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 03:59:18,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:18,318 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 03:59:18,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:18,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash -68477447, now seen corresponding path program 1 times [2019-11-24 03:59:18,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:18,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096338996] [2019-11-24 03:59:18,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:18,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096338996] [2019-11-24 03:59:18,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:18,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:18,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051188711] [2019-11-24 03:59:18,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:59:18,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:18,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:59:18,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:59:18,471 INFO L87 Difference]: Start difference. First operand 147 states and 205 transitions. Second operand 4 states. [2019-11-24 03:59:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:18,709 INFO L93 Difference]: Finished difference Result 490 states and 684 transitions. [2019-11-24 03:59:18,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:59:18,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 03:59:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:18,720 INFO L225 Difference]: With dead ends: 490 [2019-11-24 03:59:18,720 INFO L226 Difference]: Without dead ends: 348 [2019-11-24 03:59:18,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:59:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-11-24 03:59:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 202. [2019-11-24 03:59:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-24 03:59:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2019-11-24 03:59:18,761 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 17 [2019-11-24 03:59:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:18,761 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2019-11-24 03:59:18,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:59:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2019-11-24 03:59:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 03:59:18,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:18,763 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 03:59:18,763 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2006415304, now seen corresponding path program 1 times [2019-11-24 03:59:18,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:18,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119977550] [2019-11-24 03:59:18,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:18,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119977550] [2019-11-24 03:59:18,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:18,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:18,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632418897] [2019-11-24 03:59:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:59:18,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:59:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:18,860 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand 3 states. [2019-11-24 03:59:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:18,975 INFO L93 Difference]: Finished difference Result 524 states and 761 transitions. [2019-11-24 03:59:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:59:18,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-24 03:59:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:18,978 INFO L225 Difference]: With dead ends: 524 [2019-11-24 03:59:18,978 INFO L226 Difference]: Without dead ends: 327 [2019-11-24 03:59:18,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-24 03:59:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 311. [2019-11-24 03:59:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-24 03:59:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 464 transitions. [2019-11-24 03:59:19,008 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 464 transitions. Word has length 17 [2019-11-24 03:59:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:19,008 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 464 transitions. [2019-11-24 03:59:19,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:59:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 464 transitions. [2019-11-24 03:59:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 03:59:19,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:19,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:19,010 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:19,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -960982823, now seen corresponding path program 1 times [2019-11-24 03:59:19,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054099351] [2019-11-24 03:59:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:19,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054099351] [2019-11-24 03:59:19,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:19,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:19,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538785701] [2019-11-24 03:59:19,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:59:19,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:19,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:59:19,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:59:19,073 INFO L87 Difference]: Start difference. First operand 311 states and 464 transitions. Second operand 4 states. [2019-11-24 03:59:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:19,227 INFO L93 Difference]: Finished difference Result 605 states and 892 transitions. [2019-11-24 03:59:19,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:59:19,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 03:59:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:19,234 INFO L225 Difference]: With dead ends: 605 [2019-11-24 03:59:19,234 INFO L226 Difference]: Without dead ends: 377 [2019-11-24 03:59:19,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:59:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-24 03:59:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 281. [2019-11-24 03:59:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-11-24 03:59:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 420 transitions. [2019-11-24 03:59:19,263 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 420 transitions. Word has length 18 [2019-11-24 03:59:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:19,263 INFO L462 AbstractCegarLoop]: Abstraction has 281 states and 420 transitions. [2019-11-24 03:59:19,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:59:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 420 transitions. [2019-11-24 03:59:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 03:59:19,266 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:19,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:19,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:19,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:19,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1996791799, now seen corresponding path program 1 times [2019-11-24 03:59:19,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:19,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275743990] [2019-11-24 03:59:19,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:19,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275743990] [2019-11-24 03:59:19,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:19,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:19,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653372951] [2019-11-24 03:59:19,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:59:19,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:59:19,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:59:19,362 INFO L87 Difference]: Start difference. First operand 281 states and 420 transitions. Second operand 4 states. [2019-11-24 03:59:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:19,516 INFO L93 Difference]: Finished difference Result 541 states and 800 transitions. [2019-11-24 03:59:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:59:19,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-24 03:59:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:19,521 INFO L225 Difference]: With dead ends: 541 [2019-11-24 03:59:19,521 INFO L226 Difference]: Without dead ends: 343 [2019-11-24 03:59:19,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:59:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-24 03:59:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 251. [2019-11-24 03:59:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-24 03:59:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 376 transitions. [2019-11-24 03:59:19,536 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 376 transitions. Word has length 19 [2019-11-24 03:59:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:19,536 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 376 transitions. [2019-11-24 03:59:19,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:59:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 376 transitions. [2019-11-24 03:59:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 03:59:19,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:19,537 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:19,538 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:19,538 INFO L82 PathProgramCache]: Analyzing trace with hash -166951641, now seen corresponding path program 1 times [2019-11-24 03:59:19,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:19,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48044343] [2019-11-24 03:59:19,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:19,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48044343] [2019-11-24 03:59:19,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:19,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:19,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049283669] [2019-11-24 03:59:19,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 03:59:19,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:19,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 03:59:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 03:59:19,609 INFO L87 Difference]: Start difference. First operand 251 states and 376 transitions. Second operand 4 states. [2019-11-24 03:59:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:19,760 INFO L93 Difference]: Finished difference Result 477 states and 708 transitions. [2019-11-24 03:59:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 03:59:19,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-24 03:59:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:19,764 INFO L225 Difference]: With dead ends: 477 [2019-11-24 03:59:19,764 INFO L226 Difference]: Without dead ends: 309 [2019-11-24 03:59:19,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:59:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-24 03:59:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 221. [2019-11-24 03:59:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-24 03:59:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 332 transitions. [2019-11-24 03:59:19,778 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 332 transitions. Word has length 20 [2019-11-24 03:59:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:19,781 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 332 transitions. [2019-11-24 03:59:19,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 03:59:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 332 transitions. [2019-11-24 03:59:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-24 03:59:19,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:19,790 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:19,790 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:19,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:19,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1498730084, now seen corresponding path program 1 times [2019-11-24 03:59:19,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:19,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499873146] [2019-11-24 03:59:19,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 03:59:19,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499873146] [2019-11-24 03:59:19,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:19,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 03:59:19,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817127569] [2019-11-24 03:59:19,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 03:59:19,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 03:59:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 03:59:19,910 INFO L87 Difference]: Start difference. First operand 221 states and 332 transitions. Second operand 5 states. [2019-11-24 03:59:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:20,039 INFO L93 Difference]: Finished difference Result 337 states and 491 transitions. [2019-11-24 03:59:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 03:59:20,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-24 03:59:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:20,044 INFO L225 Difference]: With dead ends: 337 [2019-11-24 03:59:20,044 INFO L226 Difference]: Without dead ends: 199 [2019-11-24 03:59:20,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-24 03:59:20,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-24 03:59:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 113. [2019-11-24 03:59:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-24 03:59:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2019-11-24 03:59:20,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 24 [2019-11-24 03:59:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:20,056 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2019-11-24 03:59:20,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 03:59:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2019-11-24 03:59:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 03:59:20,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:20,057 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 03:59:20,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash -32956341, now seen corresponding path program 1 times [2019-11-24 03:59:20,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:20,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988443136] [2019-11-24 03:59:20,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:20,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988443136] [2019-11-24 03:59:20,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:20,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:20,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998103548] [2019-11-24 03:59:20,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:59:20,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:59:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:20,148 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand 3 states. [2019-11-24 03:59:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:20,295 INFO L93 Difference]: Finished difference Result 264 states and 380 transitions. [2019-11-24 03:59:20,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:59:20,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 03:59:20,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:20,297 INFO L225 Difference]: With dead ends: 264 [2019-11-24 03:59:20,298 INFO L226 Difference]: Without dead ends: 156 [2019-11-24 03:59:20,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:20,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-24 03:59:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-24 03:59:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-24 03:59:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2019-11-24 03:59:20,309 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 28 [2019-11-24 03:59:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:20,309 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2019-11-24 03:59:20,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:59:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2019-11-24 03:59:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 03:59:20,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:20,310 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 03:59:20,311 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash -686031041, now seen corresponding path program 1 times [2019-11-24 03:59:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:20,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967693961] [2019-11-24 03:59:20,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:20,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967693961] [2019-11-24 03:59:20,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372501563] [2019-11-24 03:59:20,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:59:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:20,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 03:59:20,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:59:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 03:59:20,898 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:59:20,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 03:59:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-24 03:59:20,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-24 03:59:20,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7, 4] total 9 [2019-11-24 03:59:20,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888245124] [2019-11-24 03:59:20,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:59:20,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:20,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:59:20,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 03:59:20,940 INFO L87 Difference]: Start difference. First operand 156 states and 223 transitions. Second operand 3 states. [2019-11-24 03:59:21,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:21,120 INFO L93 Difference]: Finished difference Result 350 states and 504 transitions. [2019-11-24 03:59:21,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:59:21,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 03:59:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:21,122 INFO L225 Difference]: With dead ends: 350 [2019-11-24 03:59:21,122 INFO L226 Difference]: Without dead ends: 199 [2019-11-24 03:59:21,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-24 03:59:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-24 03:59:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-11-24 03:59:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 03:59:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 288 transitions. [2019-11-24 03:59:21,143 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 288 transitions. Word has length 39 [2019-11-24 03:59:21,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:21,144 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 288 transitions. [2019-11-24 03:59:21,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:59:21,144 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 288 transitions. [2019-11-24 03:59:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-24 03:59:21,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:21,145 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 03:59:21,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 03:59:21,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:21,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1526507761, now seen corresponding path program 1 times [2019-11-24 03:59:21,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:21,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108152806] [2019-11-24 03:59:21,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-24 03:59:21,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108152806] [2019-11-24 03:59:21,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 03:59:21,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 03:59:21,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149693624] [2019-11-24 03:59:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 03:59:21,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 03:59:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 03:59:21,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:21,477 INFO L87 Difference]: Start difference. First operand 199 states and 288 transitions. Second operand 3 states. [2019-11-24 03:59:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 03:59:21,495 INFO L93 Difference]: Finished difference Result 394 states and 570 transitions. [2019-11-24 03:59:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 03:59:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-24 03:59:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 03:59:21,497 INFO L225 Difference]: With dead ends: 394 [2019-11-24 03:59:21,497 INFO L226 Difference]: Without dead ends: 200 [2019-11-24 03:59:21,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 03:59:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-24 03:59:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-24 03:59:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-24 03:59:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2019-11-24 03:59:21,512 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 40 [2019-11-24 03:59:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 03:59:21,512 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2019-11-24 03:59:21,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 03:59:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2019-11-24 03:59:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 03:59:21,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 03:59:21,513 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-24 03:59:21,514 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 03:59:21,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 03:59:21,514 INFO L82 PathProgramCache]: Analyzing trace with hash -389001164, now seen corresponding path program 1 times [2019-11-24 03:59:21,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 03:59:21,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098909111] [2019-11-24 03:59:21,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 03:59:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-24 03:59:21,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098909111] [2019-11-24 03:59:21,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720007698] [2019-11-24 03:59:21,599 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 03:59:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 03:59:21,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 03:59:21,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 03:59:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-24 03:59:22,019 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 03:59:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-24 03:59:22,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164810265] [2019-11-24 03:59:22,099 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-11-24 03:59:22,100 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 03:59:22,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 03:59:22,115 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 03:59:22,116 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 03:59:23,192 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 454 [2019-11-24 03:59:24,004 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 491 [2019-11-24 03:59:24,501 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 489 [2019-11-24 03:59:24,950 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 487 [2019-11-24 03:59:25,312 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 490 [2019-11-24 03:59:25,997 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 630 DAG size of output: 630 [2019-11-24 03:59:26,804 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 645 [2019-11-24 03:59:30,080 WARN L192 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 643 [2019-11-24 03:59:32,533 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 641 [2019-11-24 03:59:33,203 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification that was a NOOP. DAG size: 648 [2019-11-24 03:59:34,035 WARN L192 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 649 DAG size of output: 649 [2019-11-24 03:59:35,229 WARN L192 SmtUtils]: Spent 750.00 ms on a formula simplification that was a NOOP. DAG size: 662 [2019-11-24 03:59:43,145 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification that was a NOOP. DAG size: 660 [2019-11-24 03:59:50,266 WARN L192 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 658 [2019-11-24 03:59:51,148 WARN L192 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 669 DAG size of output: 666 [2019-11-24 03:59:52,356 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 666 DAG size of output: 666 [2019-11-24 03:59:54,133 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 678 [2019-11-24 04:00:09,257 WARN L192 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 676 [2019-11-24 04:00:20,715 WARN L192 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 674 [2019-11-24 04:00:21,992 WARN L192 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 687 DAG size of output: 682 [2019-11-24 04:00:23,417 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 682 DAG size of output: 682 [2019-11-24 04:00:24,098 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-24 04:00:25,605 WARN L192 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 682