/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.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 02:06:32,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 02:06:32,825 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 02:06:32,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 02:06:32,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 02:06:32,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 02:06:32,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 02:06:32,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 02:06:32,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 02:06:32,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 02:06:32,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 02:06:32,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 02:06:32,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 02:06:32,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 02:06:32,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 02:06:32,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 02:06:32,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 02:06:32,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 02:06:32,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 02:06:32,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 02:06:32,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 02:06:32,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 02:06:32,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 02:06:32,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 02:06:32,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 02:06:32,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 02:06:32,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 02:06:32,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 02:06:32,865 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 02:06:32,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 02:06:32,866 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 02:06:32,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 02:06:32,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 02:06:32,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 02:06:32,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 02:06:32,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 02:06:32,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 02:06:32,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 02:06:32,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 02:06:32,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 02:06:32,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 02:06:32,873 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 02:06:32,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 02:06:32,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 02:06:32,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 02:06:32,899 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 02:06:32,899 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 02:06:32,899 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 02:06:32,899 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 02:06:32,900 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 02:06:32,900 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 02:06:32,900 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 02:06:32,901 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 02:06:32,901 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 02:06:32,902 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 02:06:32,902 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 02:06:32,902 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 02:06:32,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 02:06:32,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 02:06:32,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 02:06:32,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 02:06:32,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 02:06:32,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 02:06:32,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 02:06:32,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 02:06:32,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 02:06:32,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 02:06:32,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 02:06:32,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 02:06:32,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 02:06:32,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 02:06:32,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 02:06:32,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 02:06:32,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 02:06:32,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 02:06:32,908 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 02:06:32,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 02:06:32,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 02:06:32,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 02:06:32,909 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 02:06:33,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 02:06:33,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 02:06:33,248 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 02:06:33,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 02:06:33,249 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 02:06:33,250 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-24 02:06:33,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a097c8f4/6897bf6f184e40169f46cf1169abee99/FLAGdc86702f2 [2019-11-24 02:06:33,948 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 02:06:33,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-24 02:06:33,971 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a097c8f4/6897bf6f184e40169f46cf1169abee99/FLAGdc86702f2 [2019-11-24 02:06:34,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a097c8f4/6897bf6f184e40169f46cf1169abee99 [2019-11-24 02:06:34,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 02:06:34,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 02:06:34,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 02:06:34,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 02:06:34,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 02:06:34,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:06:34" (1/1) ... [2019-11-24 02:06:34,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39289d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:34, skipping insertion in model container [2019-11-24 02:06:34,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 02:06:34" (1/1) ... [2019-11-24 02:06:34,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 02:06:34,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 02:06:34,767 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-24 02:06:34,768 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-24 02:06:35,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 02:06:35,282 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 02:06:35,377 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-11-24 02:06:35,377 WARN L1172 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-11-24 02:06:35,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 02:06:35,562 INFO L208 MainTranslator]: Completed translation [2019-11-24 02:06:35,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35 WrapperNode [2019-11-24 02:06:35,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 02:06:35,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 02:06:35,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 02:06:35,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 02:06:35,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 02:06:35,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 02:06:35,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 02:06:35,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 02:06:35,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (1/1) ... [2019-11-24 02:06:35,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 02:06:35,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 02:06:35,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 02:06:35,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 02:06:35,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (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 02:06:35,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 02:06:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 02:06:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 02:06:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 02:06:35,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 02:06:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 02:06:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 02:06:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 02:06:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 02:06:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 02:06:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 02:06:40,250 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 02:06:40,250 INFO L284 CfgBuilder]: Removed 344 assume(true) statements. [2019-11-24 02:06:40,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:06:40 BoogieIcfgContainer [2019-11-24 02:06:40,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 02:06:40,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 02:06:40,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 02:06:40,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 02:06:40,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 02:06:34" (1/3) ... [2019-11-24 02:06:40,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6777dddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:06:40, skipping insertion in model container [2019-11-24 02:06:40,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 02:06:35" (2/3) ... [2019-11-24 02:06:40,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6777dddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 02:06:40, skipping insertion in model container [2019-11-24 02:06:40,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 02:06:40" (3/3) ... [2019-11-24 02:06:40,259 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-11-24 02:06:40,269 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 02:06:40,277 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-24 02:06:40,286 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-24 02:06:40,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 02:06:40,309 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 02:06:40,309 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 02:06:40,309 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 02:06:40,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 02:06:40,310 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 02:06:40,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 02:06:40,310 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 02:06:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-24 02:06:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 02:06:40,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:40,339 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 02:06:40,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1494803802, now seen corresponding path program 1 times [2019-11-24 02:06:40,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:40,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605979777] [2019-11-24 02:06:40,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:40,777 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 02:06:40,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605979777] [2019-11-24 02:06:40,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:40,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:06:40,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3740062] [2019-11-24 02:06:40,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:40,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:40,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:40,802 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-24 02:06:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:41,152 INFO L93 Difference]: Finished difference Result 362 states and 602 transitions. [2019-11-24 02:06:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:41,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 02:06:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:41,180 INFO L225 Difference]: With dead ends: 362 [2019-11-24 02:06:41,180 INFO L226 Difference]: Without dead ends: 203 [2019-11-24 02:06:41,188 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 02:06:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-24 02:06:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-11-24 02:06:41,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-24 02:06:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 329 transitions. [2019-11-24 02:06:41,288 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 329 transitions. Word has length 18 [2019-11-24 02:06:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:41,289 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 329 transitions. [2019-11-24 02:06:41,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 329 transitions. [2019-11-24 02:06:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-24 02:06:41,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:41,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:41,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:41,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:41,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1958476605, now seen corresponding path program 1 times [2019-11-24 02:06:41,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:41,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105501948] [2019-11-24 02:06:41,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:41,533 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 02:06:41,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105501948] [2019-11-24 02:06:41,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:41,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:06:41,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84920635] [2019-11-24 02:06:41,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:41,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:41,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:41,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:41,540 INFO L87 Difference]: Start difference. First operand 203 states and 329 transitions. Second operand 3 states. [2019-11-24 02:06:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:41,663 INFO L93 Difference]: Finished difference Result 396 states and 642 transitions. [2019-11-24 02:06:41,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:41,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-24 02:06:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:41,666 INFO L225 Difference]: With dead ends: 396 [2019-11-24 02:06:41,666 INFO L226 Difference]: Without dead ends: 381 [2019-11-24 02:06:41,670 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 02:06:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-24 02:06:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2019-11-24 02:06:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-24 02:06:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 625 transitions. [2019-11-24 02:06:41,710 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 625 transitions. Word has length 21 [2019-11-24 02:06:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:41,711 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 625 transitions. [2019-11-24 02:06:41,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 625 transitions. [2019-11-24 02:06:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-24 02:06:41,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:41,714 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:41,714 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1074322478, now seen corresponding path program 1 times [2019-11-24 02:06:41,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:41,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079616740] [2019-11-24 02:06:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 02:06:41,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079616740] [2019-11-24 02:06:41,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:41,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:06:41,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172504875] [2019-11-24 02:06:41,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:41,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:41,784 INFO L87 Difference]: Start difference. First operand 381 states and 625 transitions. Second operand 3 states. [2019-11-24 02:06:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:41,895 INFO L93 Difference]: Finished difference Result 931 states and 1523 transitions. [2019-11-24 02:06:41,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:41,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-24 02:06:41,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:41,900 INFO L225 Difference]: With dead ends: 931 [2019-11-24 02:06:41,900 INFO L226 Difference]: Without dead ends: 560 [2019-11-24 02:06:41,902 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 02:06:41,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-11-24 02:06:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 443. [2019-11-24 02:06:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-24 02:06:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 728 transitions. [2019-11-24 02:06:41,928 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 728 transitions. Word has length 25 [2019-11-24 02:06:41,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:41,929 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 728 transitions. [2019-11-24 02:06:41,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 728 transitions. [2019-11-24 02:06:41,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 02:06:41,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:41,932 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 02:06:41,932 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:41,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1532974446, now seen corresponding path program 1 times [2019-11-24 02:06:41,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:41,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220809986] [2019-11-24 02:06:41,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:42,038 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 02:06:42,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220809986] [2019-11-24 02:06:42,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:42,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:06:42,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371280274] [2019-11-24 02:06:42,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:42,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:42,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:42,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:42,041 INFO L87 Difference]: Start difference. First operand 443 states and 728 transitions. Second operand 3 states. [2019-11-24 02:06:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:42,243 INFO L93 Difference]: Finished difference Result 1086 states and 1784 transitions. [2019-11-24 02:06:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:42,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-24 02:06:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:42,250 INFO L225 Difference]: With dead ends: 1086 [2019-11-24 02:06:42,250 INFO L226 Difference]: Without dead ends: 653 [2019-11-24 02:06:42,251 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 02:06:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-11-24 02:06:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 536. [2019-11-24 02:06:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-24 02:06:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 885 transitions. [2019-11-24 02:06:42,277 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 885 transitions. Word has length 28 [2019-11-24 02:06:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:42,277 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 885 transitions. [2019-11-24 02:06:42,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 885 transitions. [2019-11-24 02:06:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 02:06:42,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:42,280 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 02:06:42,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:42,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:42,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1761927837, now seen corresponding path program 1 times [2019-11-24 02:06:42,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:42,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133687670] [2019-11-24 02:06:42,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:42,421 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:42,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133687670] [2019-11-24 02:06:42,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:42,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 02:06:42,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660537465] [2019-11-24 02:06:42,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 02:06:42,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:42,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 02:06:42,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 02:06:42,423 INFO L87 Difference]: Start difference. First operand 536 states and 885 transitions. Second operand 4 states. [2019-11-24 02:06:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:42,635 INFO L93 Difference]: Finished difference Result 1035 states and 1709 transitions. [2019-11-24 02:06:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 02:06:42,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-24 02:06:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:42,639 INFO L225 Difference]: With dead ends: 1035 [2019-11-24 02:06:42,640 INFO L226 Difference]: Without dead ends: 534 [2019-11-24 02:06:42,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 02:06:42,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-24 02:06:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-11-24 02:06:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-11-24 02:06:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 877 transitions. [2019-11-24 02:06:42,665 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 877 transitions. Word has length 32 [2019-11-24 02:06:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:42,665 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 877 transitions. [2019-11-24 02:06:42,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 02:06:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 877 transitions. [2019-11-24 02:06:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 02:06:42,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:42,667 INFO L410 BasicCegarLoop]: trace histogram [3, 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 02:06:42,668 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:42,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:42,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1613916496, now seen corresponding path program 1 times [2019-11-24 02:06:42,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:42,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181469818] [2019-11-24 02:06:42,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 02:06:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181469818] [2019-11-24 02:06:42,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054976157] [2019-11-24 02:06:42,846 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 02:06:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:43,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-24 02:06:43,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 02:06:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:43,256 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 02:06:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:43,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 02:06:43,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 11 [2019-11-24 02:06:43,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852370787] [2019-11-24 02:06:43,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-24 02:06:43,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:43,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-24 02:06:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-24 02:06:43,301 INFO L87 Difference]: Start difference. First operand 534 states and 877 transitions. Second operand 8 states. [2019-11-24 02:06:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:43,580 INFO L93 Difference]: Finished difference Result 1055 states and 1727 transitions. [2019-11-24 02:06:43,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:06:43,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-11-24 02:06:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:43,584 INFO L225 Difference]: With dead ends: 1055 [2019-11-24 02:06:43,585 INFO L226 Difference]: Without dead ends: 542 [2019-11-24 02:06:43,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-24 02:06:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-24 02:06:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 540. [2019-11-24 02:06:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-24 02:06:43,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 883 transitions. [2019-11-24 02:06:43,689 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 883 transitions. Word has length 42 [2019-11-24 02:06:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:43,692 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 883 transitions. [2019-11-24 02:06:43,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-24 02:06:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 883 transitions. [2019-11-24 02:06:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 02:06:43,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:43,694 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:43,899 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 02:06:43,899 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:43,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:43,900 INFO L82 PathProgramCache]: Analyzing trace with hash 681862346, now seen corresponding path program 1 times [2019-11-24 02:06:43,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:43,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044624322] [2019-11-24 02:06:43,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:44,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044624322] [2019-11-24 02:06:44,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:44,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:06:44,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541852376] [2019-11-24 02:06:44,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:44,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:44,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:44,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:44,024 INFO L87 Difference]: Start difference. First operand 540 states and 883 transitions. Second operand 3 states. [2019-11-24 02:06:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:44,049 INFO L93 Difference]: Finished difference Result 1037 states and 1697 transitions. [2019-11-24 02:06:44,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:44,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 02:06:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:44,053 INFO L225 Difference]: With dead ends: 1037 [2019-11-24 02:06:44,053 INFO L226 Difference]: Without dead ends: 538 [2019-11-24 02:06:44,054 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 02:06:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-24 02:06:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-24 02:06:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-24 02:06:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 877 transitions. [2019-11-24 02:06:44,077 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 877 transitions. Word has length 45 [2019-11-24 02:06:44,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:44,078 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 877 transitions. [2019-11-24 02:06:44,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 877 transitions. [2019-11-24 02:06:44,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-24 02:06:44,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:44,079 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:44,080 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash 444319538, now seen corresponding path program 1 times [2019-11-24 02:06:44,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:44,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238048337] [2019-11-24 02:06:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 02:06:44,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238048337] [2019-11-24 02:06:44,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233990267] [2019-11-24 02:06:44,202 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 02:06:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:44,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 02:06:44,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 02:06:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:44,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 02:06:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:44,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 02:06:44,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [4] total 8 [2019-11-24 02:06:44,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682150638] [2019-11-24 02:06:44,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 02:06:44,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 02:06:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-24 02:06:44,544 INFO L87 Difference]: Start difference. First operand 538 states and 877 transitions. Second operand 5 states. [2019-11-24 02:06:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:44,814 INFO L93 Difference]: Finished difference Result 1039 states and 1693 transitions. [2019-11-24 02:06:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 02:06:44,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-24 02:06:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:44,818 INFO L225 Difference]: With dead ends: 1039 [2019-11-24 02:06:44,818 INFO L226 Difference]: Without dead ends: 522 [2019-11-24 02:06:44,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-24 02:06:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-24 02:06:44,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 516. [2019-11-24 02:06:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-24 02:06:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 839 transitions. [2019-11-24 02:06:44,842 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 839 transitions. Word has length 46 [2019-11-24 02:06:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:44,842 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 839 transitions. [2019-11-24 02:06:44,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 02:06:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 839 transitions. [2019-11-24 02:06:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 02:06:44,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:44,844 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:45,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 02:06:45,054 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:45,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1631448609, now seen corresponding path program 1 times [2019-11-24 02:06:45,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:45,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305224596] [2019-11-24 02:06:45,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:45,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305224596] [2019-11-24 02:06:45,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:45,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:06:45,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634308314] [2019-11-24 02:06:45,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:45,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:45,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:45,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:45,132 INFO L87 Difference]: Start difference. First operand 516 states and 839 transitions. Second operand 3 states. [2019-11-24 02:06:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:45,156 INFO L93 Difference]: Finished difference Result 991 states and 1613 transitions. [2019-11-24 02:06:45,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:45,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-24 02:06:45,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:45,166 INFO L225 Difference]: With dead ends: 991 [2019-11-24 02:06:45,166 INFO L226 Difference]: Without dead ends: 516 [2019-11-24 02:06:45,167 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 02:06:45,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-24 02:06:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2019-11-24 02:06:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-24 02:06:45,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 837 transitions. [2019-11-24 02:06:45,201 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 837 transitions. Word has length 51 [2019-11-24 02:06:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:45,202 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 837 transitions. [2019-11-24 02:06:45,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 837 transitions. [2019-11-24 02:06:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 02:06:45,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:45,204 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:45,206 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:45,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1238642676, now seen corresponding path program 1 times [2019-11-24 02:06:45,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:45,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752303220] [2019-11-24 02:06:45,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:45,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752303220] [2019-11-24 02:06:45,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:45,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:06:45,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447641711] [2019-11-24 02:06:45,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:45,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:45,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:45,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:45,384 INFO L87 Difference]: Start difference. First operand 516 states and 837 transitions. Second operand 3 states. [2019-11-24 02:06:45,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:45,416 INFO L93 Difference]: Finished difference Result 991 states and 1609 transitions. [2019-11-24 02:06:45,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:45,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-24 02:06:45,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:45,420 INFO L225 Difference]: With dead ends: 991 [2019-11-24 02:06:45,420 INFO L226 Difference]: Without dead ends: 516 [2019-11-24 02:06:45,422 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 02:06:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-24 02:06:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2019-11-24 02:06:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-24 02:06:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 835 transitions. [2019-11-24 02:06:45,455 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 835 transitions. Word has length 52 [2019-11-24 02:06:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:45,456 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 835 transitions. [2019-11-24 02:06:45,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 835 transitions. [2019-11-24 02:06:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-24 02:06:45,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:45,458 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:45,458 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:45,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash -549204900, now seen corresponding path program 1 times [2019-11-24 02:06:45,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:45,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431900586] [2019-11-24 02:06:45,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:45,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431900586] [2019-11-24 02:06:45,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:45,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 02:06:45,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966161321] [2019-11-24 02:06:45,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:45,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:45,593 INFO L87 Difference]: Start difference. First operand 516 states and 835 transitions. Second operand 3 states. [2019-11-24 02:06:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:45,625 INFO L93 Difference]: Finished difference Result 991 states and 1605 transitions. [2019-11-24 02:06:45,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:45,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-24 02:06:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:45,629 INFO L225 Difference]: With dead ends: 991 [2019-11-24 02:06:45,629 INFO L226 Difference]: Without dead ends: 516 [2019-11-24 02:06:45,630 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 02:06:45,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-11-24 02:06:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2019-11-24 02:06:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-24 02:06:45,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 833 transitions. [2019-11-24 02:06:45,657 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 833 transitions. Word has length 53 [2019-11-24 02:06:45,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:45,657 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 833 transitions. [2019-11-24 02:06:45,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 833 transitions. [2019-11-24 02:06:45,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 02:06:45,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:45,659 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:45,659 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1269001503, now seen corresponding path program 1 times [2019-11-24 02:06:45,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:45,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443305194] [2019-11-24 02:06:45,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 02:06:45,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443305194] [2019-11-24 02:06:45,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 02:06:45,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 02:06:45,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880074973] [2019-11-24 02:06:45,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 02:06:45,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 02:06:45,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 02:06:45,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 02:06:45,761 INFO L87 Difference]: Start difference. First operand 516 states and 833 transitions. Second operand 3 states. [2019-11-24 02:06:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 02:06:46,018 INFO L93 Difference]: Finished difference Result 1038 states and 1663 transitions. [2019-11-24 02:06:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 02:06:46,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-24 02:06:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 02:06:46,023 INFO L225 Difference]: With dead ends: 1038 [2019-11-24 02:06:46,023 INFO L226 Difference]: Without dead ends: 563 [2019-11-24 02:06:46,024 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 02:06:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-11-24 02:06:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 540. [2019-11-24 02:06:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-24 02:06:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 867 transitions. [2019-11-24 02:06:46,067 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 867 transitions. Word has length 54 [2019-11-24 02:06:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 02:06:46,068 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 867 transitions. [2019-11-24 02:06:46,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 02:06:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 867 transitions. [2019-11-24 02:06:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-24 02:06:46,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 02:06:46,070 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 02:06:46,070 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 02:06:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 02:06:46,071 INFO L82 PathProgramCache]: Analyzing trace with hash -696916368, now seen corresponding path program 1 times [2019-11-24 02:06:46,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 02:06:46,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42502133] [2019-11-24 02:06:46,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 02:06:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 02:06:46,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42502133] [2019-11-24 02:06:46,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131314410] [2019-11-24 02:06:46,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 02:06:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 02:06:46,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-24 02:06:46,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 02:06:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 02:06:46,652 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 02:06:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 02:06:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-24 02:06:46,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357176887] [2019-11-24 02:06:46,763 INFO L159 IcfgInterpreter]: Started Sifa with 49 locations of interest [2019-11-24 02:06:46,763 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 02:06:46,769 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 02:06:46,781 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 02:06:46,782 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs