./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5b36d44f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 11:23:09,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 11:23:09,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 11:23:09,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 11:23:09,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 11:23:09,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 11:23:09,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 11:23:09,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 11:23:09,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 11:23:09,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 11:23:09,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 11:23:09,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 11:23:09,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 11:23:09,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 11:23:09,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 11:23:09,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 11:23:09,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 11:23:09,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 11:23:09,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 11:23:09,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 11:23:09,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 11:23:09,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 11:23:09,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 11:23:09,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 11:23:09,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 11:23:09,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 11:23:09,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 11:23:09,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 11:23:09,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 11:23:09,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 11:23:09,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 11:23:09,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 11:23:09,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 11:23:09,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 11:23:09,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 11:23:09,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 11:23:09,723 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 11:23:09,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 11:23:09,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 11:23:09,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 11:23:09,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 11:23:09,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 11:23:09,753 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 11:23:09,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 11:23:09,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 11:23:09,754 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 11:23:09,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 11:23:09,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 11:23:09,756 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 11:23:09,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 11:23:09,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 11:23:09,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 11:23:09,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 11:23:09,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 11:23:09,757 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 11:23:09,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 11:23:09,758 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 11:23:09,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 11:23:09,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 11:23:09,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 11:23:09,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 11:23:09,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 11:23:09,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 11:23:09,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 11:23:09,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 11:23:09,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 11:23:09,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 11:23:09,760 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 11:23:09,760 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 11:23:09,761 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 11:23:09,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 11:23:09,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-07 11:23:09,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 11:23:09,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 11:23:10,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 11:23:10,003 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 11:23:10,004 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 11:23:10,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:23:10,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f683e6d/6c042ee6d41f4649a77eda0525912b7a/FLAGb1b5cb3bc [2021-11-07 11:23:10,696 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 11:23:10,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:23:10,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f683e6d/6c042ee6d41f4649a77eda0525912b7a/FLAGb1b5cb3bc [2021-11-07 11:23:11,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1f683e6d/6c042ee6d41f4649a77eda0525912b7a [2021-11-07 11:23:11,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 11:23:11,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 11:23:11,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 11:23:11,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 11:23:11,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 11:23:11,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:23:11" (1/1) ... [2021-11-07 11:23:11,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bff073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:11, skipping insertion in model container [2021-11-07 11:23:11,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:23:11" (1/1) ... [2021-11-07 11:23:11,111 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 11:23:11,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 11:23:12,216 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-07 11:23:12,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 11:23:12,254 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 11:23:12,512 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-07 11:23:12,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 11:23:12,593 INFO L208 MainTranslator]: Completed translation [2021-11-07 11:23:12,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12 WrapperNode [2021-11-07 11:23:12,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 11:23:12,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 11:23:12,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 11:23:12,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 11:23:12,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:12,673 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:12,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 11:23:12,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 11:23:12,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 11:23:12,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 11:23:12,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:12,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:12,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:12,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:13,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:13,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:13,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:13,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 11:23:13,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 11:23:13,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 11:23:13,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 11:23:13,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (1/1) ... [2021-11-07 11:23:13,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 11:23:13,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 11:23:13,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 11:23:13,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 11:23:13,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 11:23:13,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 11:23:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 11:23:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-07 11:23:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 11:23:13,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 11:23:16,437 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 11:23:16,437 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-07 11:23:16,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:16 BoogieIcfgContainer [2021-11-07 11:23:16,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 11:23:16,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 11:23:16,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 11:23:16,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 11:23:16,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:23:11" (1/3) ... [2021-11-07 11:23:16,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b2c36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:23:16, skipping insertion in model container [2021-11-07 11:23:16,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:23:12" (2/3) ... [2021-11-07 11:23:16,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28b2c36c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:23:16, skipping insertion in model container [2021-11-07 11:23:16,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:16" (3/3) ... [2021-11-07 11:23:16,447 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:23:16,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 11:23:16,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 11:23:16,494 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 11:23:16,499 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 11:23:16,500 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 11:23:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 11:23:16,539 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:16,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:16,540 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-07 11:23:16,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:16,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651718952] [2021-11-07 11:23:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:16,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:16,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:16,877 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651718952] [2021-11-07 11:23:16,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651718952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:16,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:16,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 11:23:16,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525053687] [2021-11-07 11:23:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:16,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:23:16,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:16,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:23:16,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:16,915 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:17,170 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-07 11:23:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:23:17,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 11:23:17,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:17,198 INFO L225 Difference]: With dead ends: 2079 [2021-11-07 11:23:17,199 INFO L226 Difference]: Without dead ends: 1011 [2021-11-07 11:23:17,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:17,207 INFO L933 BasicCegarLoop]: 1528 mSDtfsCounter, 1534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.56ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.96ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.71ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:17,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 1528 Invalid, 12 Unknown, 0 Unchecked, 18.96ms Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 14.71ms Time] [2021-11-07 11:23:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-07 11:23:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-07 11:23:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-07 11:23:17,316 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-07 11:23:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:17,317 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-07 11:23:17,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-07 11:23:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 11:23:17,329 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:17,329 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:17,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 11:23:17,331 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:17,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:17,332 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-07 11:23:17,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:17,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936928063] [2021-11-07 11:23:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:17,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:17,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:17,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936928063] [2021-11-07 11:23:17,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936928063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:17,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:17,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 11:23:17,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162502839] [2021-11-07 11:23:17,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:17,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:23:17,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:17,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:23:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:17,457 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:17,514 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-07 11:23:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 11:23:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 11:23:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:17,521 INFO L225 Difference]: With dead ends: 1999 [2021-11-07 11:23:17,521 INFO L226 Difference]: Without dead ends: 1011 [2021-11-07 11:23:17,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.95ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:23:17,527 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 1 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.16ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:17,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 4468 Invalid, 7 Unknown, 0 Unchecked, 8.23ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 7.16ms Time] [2021-11-07 11:23:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-07 11:23:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-07 11:23:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-07 11:23:17,564 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-07 11:23:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:17,566 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-07 11:23:17,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-07 11:23:17,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 11:23:17,575 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:17,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:17,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 11:23:17,576 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-07 11:23:17,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:17,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219034378] [2021-11-07 11:23:17,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:17,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:17,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:17,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219034378] [2021-11-07 11:23:17,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219034378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:17,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:17,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 11:23:17,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325720831] [2021-11-07 11:23:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:17,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:23:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:23:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:17,737 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:17,849 INFO L93 Difference]: Finished difference Result 1999 states and 2956 transitions. [2021-11-07 11:23:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 11:23:17,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-07 11:23:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:17,858 INFO L225 Difference]: With dead ends: 1999 [2021-11-07 11:23:17,858 INFO L226 Difference]: Without dead ends: 1997 [2021-11-07 11:23:17,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.82ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:23:17,860 INFO L933 BasicCegarLoop]: 2945 mSDtfsCounter, 2664 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 6170 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.80ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.30ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:17,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2664 Valid, 6170 Invalid, 16 Unknown, 0 Unchecked, 12.80ms Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 25.30ms Time] [2021-11-07 11:23:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-11-07 11:23:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1013. [2021-11-07 11:23:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.475296442687747) internal successors, (1493), 1012 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1493 transitions. [2021-11-07 11:23:17,907 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1493 transitions. Word has length 39 [2021-11-07 11:23:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:17,908 INFO L470 AbstractCegarLoop]: Abstraction has 1013 states and 1493 transitions. [2021-11-07 11:23:17,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1493 transitions. [2021-11-07 11:23:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 11:23:17,909 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:17,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:17,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 11:23:17,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash -660420083, now seen corresponding path program 1 times [2021-11-07 11:23:17,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:17,911 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372955001] [2021-11-07 11:23:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:17,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:17,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:17,998 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372955001] [2021-11-07 11:23:17,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372955001] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:17,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:17,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 11:23:17,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930580465] [2021-11-07 11:23:17,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:17,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:23:17,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:18,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:23:18,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:18,001 INFO L87 Difference]: Start difference. First operand 1013 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:18,238 INFO L93 Difference]: Finished difference Result 2989 states and 4423 transitions. [2021-11-07 11:23:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 11:23:18,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-07 11:23:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:18,247 INFO L225 Difference]: With dead ends: 2989 [2021-11-07 11:23:18,247 INFO L226 Difference]: Without dead ends: 2001 [2021-11-07 11:23:18,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.25ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:18,250 INFO L933 BasicCegarLoop]: 2692 mSDtfsCounter, 2914 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 113.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2914 SdHoareTripleChecker+Valid, 4171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.94ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 124.97ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:18,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2914 Valid, 4171 Invalid, 22 Unknown, 0 Unchecked, 9.94ms Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 124.97ms Time] [2021-11-07 11:23:18,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2021-11-07 11:23:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1014. [2021-11-07 11:23:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1013 states have (on average 1.474827245804541) internal successors, (1494), 1013 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1494 transitions. [2021-11-07 11:23:18,296 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1494 transitions. Word has length 46 [2021-11-07 11:23:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:18,296 INFO L470 AbstractCegarLoop]: Abstraction has 1014 states and 1494 transitions. [2021-11-07 11:23:18,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1494 transitions. [2021-11-07 11:23:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 11:23:18,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:18,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:18,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 11:23:18,299 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:18,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 32416044, now seen corresponding path program 1 times [2021-11-07 11:23:18,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:18,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689729038] [2021-11-07 11:23:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:18,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:18,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:18,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689729038] [2021-11-07 11:23:18,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689729038] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:18,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:18,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 11:23:18,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299442121] [2021-11-07 11:23:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:18,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 11:23:18,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 11:23:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:23:18,422 INFO L87 Difference]: Start difference. First operand 1014 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:18,709 INFO L93 Difference]: Finished difference Result 3636 states and 5391 transitions. [2021-11-07 11:23:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 11:23:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-07 11:23:18,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:18,723 INFO L225 Difference]: With dead ends: 3636 [2021-11-07 11:23:18,723 INFO L226 Difference]: Without dead ends: 3634 [2021-11-07 11:23:18,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 29.12ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 11:23:18,726 INFO L933 BasicCegarLoop]: 4152 mSDtfsCounter, 5250 mSDsluCounter, 8237 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5250 SdHoareTripleChecker+Valid, 12389 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.98ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.53ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:18,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5250 Valid, 12389 Invalid, 51 Unknown, 0 Unchecked, 22.98ms Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 46.53ms Time] [2021-11-07 11:23:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3634 states. [2021-11-07 11:23:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3634 to 1015. [2021-11-07 11:23:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4743589743589745) internal successors, (1495), 1014 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1495 transitions. [2021-11-07 11:23:18,798 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1495 transitions. Word has length 48 [2021-11-07 11:23:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:18,798 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1495 transitions. [2021-11-07 11:23:18,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1495 transitions. [2021-11-07 11:23:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-07 11:23:18,801 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:18,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:18,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 11:23:18,803 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1646884847, now seen corresponding path program 1 times [2021-11-07 11:23:18,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:18,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323094228] [2021-11-07 11:23:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:18,805 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:18,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:18,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323094228] [2021-11-07 11:23:18,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323094228] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:18,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:18,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 11:23:18,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335201699] [2021-11-07 11:23:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:18,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:23:18,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:23:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:18,899 INFO L87 Difference]: Start difference. First operand 1015 states and 1495 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:19,067 INFO L93 Difference]: Finished difference Result 2005 states and 2962 transitions. [2021-11-07 11:23:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:23:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-07 11:23:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:19,072 INFO L225 Difference]: With dead ends: 2005 [2021-11-07 11:23:19,072 INFO L226 Difference]: Without dead ends: 1015 [2021-11-07 11:23:19,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.52ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:19,074 INFO L933 BasicCegarLoop]: 1475 mSDtfsCounter, 1437 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 75.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.98ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.47ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:19,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1494 Invalid, 17 Unknown, 0 Unchecked, 2.98ms Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 89.47ms Time] [2021-11-07 11:23:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2021-11-07 11:23:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2021-11-07 11:23:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 1014 states have (on average 1.4733727810650887) internal successors, (1494), 1014 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1494 transitions. [2021-11-07 11:23:19,141 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1494 transitions. Word has length 62 [2021-11-07 11:23:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:19,142 INFO L470 AbstractCegarLoop]: Abstraction has 1015 states and 1494 transitions. [2021-11-07 11:23:19,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1494 transitions. [2021-11-07 11:23:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 11:23:19,143 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:19,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:19,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 11:23:19,144 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1521423125, now seen corresponding path program 1 times [2021-11-07 11:23:19,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:19,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588018600] [2021-11-07 11:23:19,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:19,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:19,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:19,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:19,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588018600] [2021-11-07 11:23:19,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588018600] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:19,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:19,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 11:23:19,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015196742] [2021-11-07 11:23:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:19,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:23:19,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:19,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:23:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:19,224 INFO L87 Difference]: Start difference. First operand 1015 states and 1494 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:19,478 INFO L93 Difference]: Finished difference Result 2994 states and 4425 transitions. [2021-11-07 11:23:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 11:23:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-07 11:23:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:19,486 INFO L225 Difference]: With dead ends: 2994 [2021-11-07 11:23:19,486 INFO L226 Difference]: Without dead ends: 2004 [2021-11-07 11:23:19,488 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.25ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:19,489 INFO L933 BasicCegarLoop]: 2905 mSDtfsCounter, 2930 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 79.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.15ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.15ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:19,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2930 Valid, 4379 Invalid, 33 Unknown, 0 Unchecked, 7.15ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 93.15ms Time] [2021-11-07 11:23:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2021-11-07 11:23:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1019. [2021-11-07 11:23:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4724950884086443) internal successors, (1499), 1018 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1499 transitions. [2021-11-07 11:23:19,555 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1499 transitions. Word has length 64 [2021-11-07 11:23:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:19,555 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1499 transitions. [2021-11-07 11:23:19,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1499 transitions. [2021-11-07 11:23:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 11:23:19,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:19,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:19,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 11:23:19,558 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash -897723055, now seen corresponding path program 1 times [2021-11-07 11:23:19,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:19,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074045904] [2021-11-07 11:23:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:19,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:19,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-07 11:23:19,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:19,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074045904] [2021-11-07 11:23:19,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074045904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:19,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:19,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 11:23:19,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616837578] [2021-11-07 11:23:19,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:19,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:23:19,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:19,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:23:19,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:19,617 INFO L87 Difference]: Start difference. First operand 1019 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:19,759 INFO L93 Difference]: Finished difference Result 2022 states and 2979 transitions. [2021-11-07 11:23:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:23:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-07 11:23:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:19,764 INFO L225 Difference]: With dead ends: 2022 [2021-11-07 11:23:19,764 INFO L226 Difference]: Without dead ends: 1028 [2021-11-07 11:23:19,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.40ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:19,766 INFO L933 BasicCegarLoop]: 1444 mSDtfsCounter, 0 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.39ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.84ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:19,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2826 Invalid, 141 Unknown, 0 Unchecked, 3.39ms Time], IncrementalHoareTripleChecker [61 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 76.84ms Time] [2021-11-07 11:23:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-07 11:23:19,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1019. [2021-11-07 11:23:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1018 states have (on average 1.4459724950884087) internal successors, (1472), 1018 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1472 transitions. [2021-11-07 11:23:19,822 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1472 transitions. Word has length 67 [2021-11-07 11:23:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:19,822 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1472 transitions. [2021-11-07 11:23:19,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:19,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1472 transitions. [2021-11-07 11:23:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-07 11:23:19,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:19,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:19,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 11:23:19,825 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:19,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:19,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1614523249, now seen corresponding path program 1 times [2021-11-07 11:23:19,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:19,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680791607] [2021-11-07 11:23:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:19,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:19,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:19,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:19,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680791607] [2021-11-07 11:23:19,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680791607] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 11:23:19,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545250383] [2021-11-07 11:23:19,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:19,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 11:23:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 11:23:19,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 11:23:19,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 11:23:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:20,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 11:23:20,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:23:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:20,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:23:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:20,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545250383] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 11:23:20,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 11:23:20,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-07 11:23:20,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409923317] [2021-11-07 11:23:20,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 11:23:20,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 11:23:20,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 11:23:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-07 11:23:20,735 INFO L87 Difference]: Start difference. First operand 1019 states and 1472 transitions. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:21,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:21,479 INFO L93 Difference]: Finished difference Result 5944 states and 8634 transitions. [2021-11-07 11:23:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 11:23:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-07 11:23:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:21,497 INFO L225 Difference]: With dead ends: 5944 [2021-11-07 11:23:21,497 INFO L226 Difference]: Without dead ends: 4950 [2021-11-07 11:23:21,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 46.05ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-07 11:23:21,501 INFO L933 BasicCegarLoop]: 2656 mSDtfsCounter, 13798 mSDsluCounter, 8538 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 202.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13798 SdHoareTripleChecker+Valid, 11194 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.79ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 245.98ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:21,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13798 Valid, 11194 Invalid, 88 Unknown, 0 Unchecked, 23.79ms Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 245.98ms Time] [2021-11-07 11:23:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2021-11-07 11:23:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 1026. [2021-11-07 11:23:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4448780487804878) internal successors, (1481), 1025 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1481 transitions. [2021-11-07 11:23:21,610 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1481 transitions. Word has length 70 [2021-11-07 11:23:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:21,611 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1481 transitions. [2021-11-07 11:23:21,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 9 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1481 transitions. [2021-11-07 11:23:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 11:23:21,613 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:21,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:21,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-07 11:23:21,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 11:23:21,828 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:21,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 469377729, now seen corresponding path program 1 times [2021-11-07 11:23:21,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:21,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134644465] [2021-11-07 11:23:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:21,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:22,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:22,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134644465] [2021-11-07 11:23:22,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134644465] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:22,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:22,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-07 11:23:22,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686426791] [2021-11-07 11:23:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:22,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 11:23:22,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 11:23:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:23:22,035 INFO L87 Difference]: Start difference. First operand 1026 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:22,713 INFO L93 Difference]: Finished difference Result 4813 states and 6993 transitions. [2021-11-07 11:23:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 11:23:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-07 11:23:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:22,726 INFO L225 Difference]: With dead ends: 4813 [2021-11-07 11:23:22,726 INFO L226 Difference]: Without dead ends: 3802 [2021-11-07 11:23:22,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 101.05ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-11-07 11:23:22,729 INFO L933 BasicCegarLoop]: 2730 mSDtfsCounter, 7884 mSDsluCounter, 13286 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7884 SdHoareTripleChecker+Valid, 16016 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.51ms SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 211.27ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:22,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7884 Valid, 16016 Invalid, 257 Unknown, 0 Unchecked, 22.51ms Time], IncrementalHoareTripleChecker [29 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 211.27ms Time] [2021-11-07 11:23:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2021-11-07 11:23:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 1026. [2021-11-07 11:23:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.4439024390243902) internal successors, (1480), 1025 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1480 transitions. [2021-11-07 11:23:22,821 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1480 transitions. Word has length 75 [2021-11-07 11:23:22,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:22,822 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1480 transitions. [2021-11-07 11:23:22,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1480 transitions. [2021-11-07 11:23:22,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-07 11:23:22,824 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:22,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:22,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 11:23:22,825 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:22,825 INFO L85 PathProgramCache]: Analyzing trace with hash 554117517, now seen corresponding path program 1 times [2021-11-07 11:23:22,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:22,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571715744] [2021-11-07 11:23:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:22,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:22,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:22,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571715744] [2021-11-07 11:23:22,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571715744] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:22,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:22,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 11:23:22,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493590710] [2021-11-07 11:23:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:22,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:23:22,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:23:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:23:22,928 INFO L87 Difference]: Start difference. First operand 1026 states and 1480 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:23,201 INFO L93 Difference]: Finished difference Result 3665 states and 5327 transitions. [2021-11-07 11:23:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 11:23:23,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-11-07 11:23:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:23,211 INFO L225 Difference]: With dead ends: 3665 [2021-11-07 11:23:23,211 INFO L226 Difference]: Without dead ends: 2664 [2021-11-07 11:23:23,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.75ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:23:23,214 INFO L933 BasicCegarLoop]: 2668 mSDtfsCounter, 3573 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 6774 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.84ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.30ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:23,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3573 Valid, 6774 Invalid, 28 Unknown, 0 Unchecked, 8.84ms Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 40.30ms Time] [2021-11-07 11:23:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2021-11-07 11:23:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 1028. [2021-11-07 11:23:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1027 states have (on average 1.4430379746835442) internal successors, (1482), 1027 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1482 transitions. [2021-11-07 11:23:23,333 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1482 transitions. Word has length 78 [2021-11-07 11:23:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:23,333 INFO L470 AbstractCegarLoop]: Abstraction has 1028 states and 1482 transitions. [2021-11-07 11:23:23,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1482 transitions. [2021-11-07 11:23:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-07 11:23:23,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:23,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:23,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 11:23:23,336 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1246418957, now seen corresponding path program 1 times [2021-11-07 11:23:23,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:23,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406807552] [2021-11-07 11:23:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:23,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:23,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:23,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406807552] [2021-11-07 11:23:23,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406807552] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:23,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:23,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 11:23:23,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561193089] [2021-11-07 11:23:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:23,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:23:23,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:23:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:23,399 INFO L87 Difference]: Start difference. First operand 1028 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:23,594 INFO L93 Difference]: Finished difference Result 2862 states and 4152 transitions. [2021-11-07 11:23:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:23:23,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-07 11:23:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:23,599 INFO L225 Difference]: With dead ends: 2862 [2021-11-07 11:23:23,599 INFO L226 Difference]: Without dead ends: 1859 [2021-11-07 11:23:23,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.47ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:23:23,602 INFO L933 BasicCegarLoop]: 2668 mSDtfsCounter, 1218 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.31ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.33ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:23,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1218 Valid, 4107 Invalid, 18 Unknown, 0 Unchecked, 4.31ms Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 30.33ms Time] [2021-11-07 11:23:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2021-11-07 11:23:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1030. [2021-11-07 11:23:23,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4421768707482994) internal successors, (1484), 1029 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1484 transitions. [2021-11-07 11:23:23,701 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1484 transitions. Word has length 80 [2021-11-07 11:23:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:23,701 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1484 transitions. [2021-11-07 11:23:23,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:23,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1484 transitions. [2021-11-07 11:23:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-07 11:23:23,703 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:23,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:23,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 11:23:23,704 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash -641251963, now seen corresponding path program 1 times [2021-11-07 11:23:23,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:23,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499036521] [2021-11-07 11:23:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:23,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:23,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:23,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499036521] [2021-11-07 11:23:23,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499036521] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:23,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:23,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 11:23:23,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042375915] [2021-11-07 11:23:23,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:23,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 11:23:23,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:23,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 11:23:23,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:23:23,817 INFO L87 Difference]: Start difference. First operand 1030 states and 1484 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:23:24,638 INFO L93 Difference]: Finished difference Result 6613 states and 9612 transitions. [2021-11-07 11:23:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 11:23:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-07 11:23:24,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:23:24,650 INFO L225 Difference]: With dead ends: 6613 [2021-11-07 11:23:24,651 INFO L226 Difference]: Without dead ends: 5608 [2021-11-07 11:23:24,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 38.82ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-07 11:23:24,654 INFO L933 BasicCegarLoop]: 3994 mSDtfsCounter, 8994 mSDsluCounter, 9350 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 156.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8994 SdHoareTripleChecker+Valid, 13344 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.96ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 187.90ms IncrementalHoareTripleChecker+Time [2021-11-07 11:23:24,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8994 Valid, 13344 Invalid, 190 Unknown, 0 Unchecked, 19.96ms Time], IncrementalHoareTripleChecker [12 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 187.90ms Time] [2021-11-07 11:23:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2021-11-07 11:23:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 1033. [2021-11-07 11:23:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1032 states have (on average 1.440891472868217) internal successors, (1487), 1032 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1487 transitions. [2021-11-07 11:23:24,844 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1487 transitions. Word has length 84 [2021-11-07 11:23:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:23:24,844 INFO L470 AbstractCegarLoop]: Abstraction has 1033 states and 1487 transitions. [2021-11-07 11:23:24,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1487 transitions. [2021-11-07 11:23:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-07 11:23:24,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:23:24,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:23:24,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 11:23:24,847 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:23:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:23:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-07 11:23:24,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:23:24,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363801003] [2021-11-07 11:23:24,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:23:24,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:23:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:23:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:23:26,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:23:26,573 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363801003] [2021-11-07 11:23:26,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363801003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:23:26,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:23:26,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2021-11-07 11:23:26,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318070526] [2021-11-07 11:23:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:23:26,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-11-07 11:23:26,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:23:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-11-07 11:23:26,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2021-11-07 11:23:26,575 INFO L87 Difference]: Start difference. First operand 1033 states and 1487 transitions. Second operand has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:23:30,171 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:31,335 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:36,863 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:46,704 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:53,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:55,395 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:57,419 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:23:59,440 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:01,468 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:03,508 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:05,961 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:07,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:10,016 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:12,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:19,479 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:21,508 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:23,524 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:25,549 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:27,577 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:28,618 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:30,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:32,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:41,284 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:43,310 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:47,394 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:49,414 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:51,439 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:53,464 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:55,488 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:24:58,157 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:00,184 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:02,206 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:04,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:06,267 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:10,160 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:14,459 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:22,282 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:23,907 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:25,091 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:26,976 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:25:29,056 INFO L93 Difference]: Finished difference Result 23275 states and 34628 transitions. [2021-11-07 11:25:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-07 11:25:29,056 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-07 11:25:29,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:25:29,112 INFO L225 Difference]: With dead ends: 23275 [2021-11-07 11:25:29,112 INFO L226 Difference]: Without dead ends: 23273 [2021-11-07 11:25:29,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9452 ImplicationChecksByTransitivity, 9219.80ms TimeCoverageRelationStatistics Valid=3581, Invalid=23809, Unknown=0, NotChecked=0, Total=27390 [2021-11-07 11:25:29,127 INFO L933 BasicCegarLoop]: 8333 mSDtfsCounter, 58943 mSDsluCounter, 142095 mSDsCounter, 0 mSdLazyCounter, 19706 mSolverCounterSat, 606 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 105402.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 58943 SdHoareTripleChecker+Valid, 150428 SdHoareTripleChecker+Invalid, 20342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 299.07ms SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 19706 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109384.78ms IncrementalHoareTripleChecker+Time [2021-11-07 11:25:29,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58943 Valid, 150428 Invalid, 20342 Unknown, 0 Unchecked, 299.07ms Time], IncrementalHoareTripleChecker [606 Valid, 19706 Invalid, 30 Unknown, 0 Unchecked, 109384.78ms Time] [2021-11-07 11:25:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23273 states. [2021-11-07 11:25:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23273 to 1702. [2021-11-07 11:25:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.442092886537331) internal successors, (2453), 1701 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:25:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2453 transitions. [2021-11-07 11:25:29,577 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2453 transitions. Word has length 87 [2021-11-07 11:25:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:25:29,577 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 2453 transitions. [2021-11-07 11:25:29,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 27 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:25:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2453 transitions. [2021-11-07 11:25:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-07 11:25:29,581 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:25:29,581 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:25:29,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 11:25:29,581 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:25:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:25:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1109733853, now seen corresponding path program 1 times [2021-11-07 11:25:29,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:25:29,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084348352] [2021-11-07 11:25:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:25:29,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:25:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:25:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:25:31,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:25:31,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084348352] [2021-11-07 11:25:31,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084348352] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:25:31,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:25:31,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-11-07 11:25:31,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068805106] [2021-11-07 11:25:31,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:25:31,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-11-07 11:25:31,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:25:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-11-07 11:25:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2021-11-07 11:25:31,213 INFO L87 Difference]: Start difference. First operand 1702 states and 2453 transitions. Second operand has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:25:36,097 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:39,595 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:41,185 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:50,164 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:52,202 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:25:57,683 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:00,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:01,893 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:03,913 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:07,158 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:09,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:11,204 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:21,149 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:23,190 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:25,217 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:27,237 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:29,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:31,078 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:33,104 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:35,092 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:40,972 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:42,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:48,483 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:53,754 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:55,783 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:26:57,308 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:00,027 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:02,054 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:04,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:06,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:08,145 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:12,163 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:14,534 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:16,563 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:29,161 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:30,408 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:27:32,598 INFO L93 Difference]: Finished difference Result 23282 states and 34637 transitions. [2021-11-07 11:27:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2021-11-07 11:27:32,599 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-07 11:27:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:27:32,647 INFO L225 Difference]: With dead ends: 23282 [2021-11-07 11:27:32,648 INFO L226 Difference]: Without dead ends: 23280 [2021-11-07 11:27:32,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9464 ImplicationChecksByTransitivity, 9478.90ms TimeCoverageRelationStatistics Valid=3626, Invalid=24096, Unknown=0, NotChecked=0, Total=27722 [2021-11-07 11:27:32,664 INFO L933 BasicCegarLoop]: 8333 mSDtfsCounter, 57685 mSDsluCounter, 148559 mSDsCounter, 0 mSdLazyCounter, 19501 mSolverCounterSat, 621 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102219.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57685 SdHoareTripleChecker+Valid, 156892 SdHoareTripleChecker+Invalid, 20147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 313.72ms SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 19501 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106198.91ms IncrementalHoareTripleChecker+Time [2021-11-07 11:27:32,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57685 Valid, 156892 Invalid, 20147 Unknown, 0 Unchecked, 313.72ms Time], IncrementalHoareTripleChecker [621 Valid, 19501 Invalid, 25 Unknown, 0 Unchecked, 106198.91ms Time] [2021-11-07 11:27:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23280 states. [2021-11-07 11:27:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23280 to 1702. [2021-11-07 11:27:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.442092886537331) internal successors, (2453), 1701 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2453 transitions. [2021-11-07 11:27:33,102 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2453 transitions. Word has length 87 [2021-11-07 11:27:33,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:27:33,102 INFO L470 AbstractCegarLoop]: Abstraction has 1702 states and 2453 transitions. [2021-11-07 11:27:33,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.107142857142857) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:33,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2453 transitions. [2021-11-07 11:27:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-07 11:27:33,106 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:27:33,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:27:33,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 11:27:33,106 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:27:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:27:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash 216216861, now seen corresponding path program 1 times [2021-11-07 11:27:33,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:27:33,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918100801] [2021-11-07 11:27:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:27:33,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:27:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:27:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:27:33,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:27:33,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918100801] [2021-11-07 11:27:33,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918100801] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:27:33,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:27:33,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 11:27:33,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847610058] [2021-11-07 11:27:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:27:33,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 11:27:33,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:27:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 11:27:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 11:27:33,341 INFO L87 Difference]: Start difference. First operand 1702 states and 2453 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:33,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:27:33,711 INFO L93 Difference]: Finished difference Result 2710 states and 3913 transitions. [2021-11-07 11:27:33,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 11:27:33,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-11-07 11:27:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:27:33,714 INFO L225 Difference]: With dead ends: 2710 [2021-11-07 11:27:33,715 INFO L226 Difference]: Without dead ends: 1699 [2021-11-07 11:27:33,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.00ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:27:33,717 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 3 mSDsluCounter, 4375 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5837 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.82ms IncrementalHoareTripleChecker+Time [2021-11-07 11:27:33,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 5837 Invalid, 13 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 9.82ms Time] [2021-11-07 11:27:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2021-11-07 11:27:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2021-11-07 11:27:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.4422850412249706) internal successors, (2449), 1698 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2449 transitions. [2021-11-07 11:27:34,097 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2449 transitions. Word has length 87 [2021-11-07 11:27:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:27:34,098 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2449 transitions. [2021-11-07 11:27:34,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2449 transitions. [2021-11-07 11:27:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 11:27:34,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:27:34,102 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:27:34,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 11:27:34,102 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:27:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:27:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2062058996, now seen corresponding path program 1 times [2021-11-07 11:27:34,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:27:34,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263164813] [2021-11-07 11:27:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:27:34,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:27:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:27:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:27:34,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:27:34,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263164813] [2021-11-07 11:27:34,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263164813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 11:27:34,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:27:34,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-07 11:27:34,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677188043] [2021-11-07 11:27:34,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 11:27:34,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 11:27:34,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:27:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 11:27:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-07 11:27:34,587 INFO L87 Difference]: Start difference. First operand 1699 states and 2449 transitions. Second operand has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:39,334 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:41,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:45,414 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:48,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:27:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:27:58,546 INFO L93 Difference]: Finished difference Result 21135 states and 31292 transitions. [2021-11-07 11:27:58,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-11-07 11:27:58,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-07 11:27:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:27:58,584 INFO L225 Difference]: With dead ends: 21135 [2021-11-07 11:27:58,584 INFO L226 Difference]: Without dead ends: 19461 [2021-11-07 11:27:58,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4953 ImplicationChecksByTransitivity, 1865.55ms TimeCoverageRelationStatistics Valid=2558, Invalid=10782, Unknown=0, NotChecked=0, Total=13340 [2021-11-07 11:27:58,595 INFO L933 BasicCegarLoop]: 4977 mSDtfsCounter, 35057 mSDsluCounter, 24534 mSDsCounter, 0 mSdLazyCounter, 3880 mSolverCounterSat, 404 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16714.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35057 SdHoareTripleChecker+Valid, 29511 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 65.23ms SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 3880 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17613.22ms IncrementalHoareTripleChecker+Time [2021-11-07 11:27:58,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35057 Valid, 29511 Invalid, 4286 Unknown, 0 Unchecked, 65.23ms Time], IncrementalHoareTripleChecker [404 Valid, 3880 Invalid, 2 Unknown, 0 Unchecked, 17613.22ms Time] [2021-11-07 11:27:58,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19461 states. [2021-11-07 11:27:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19461 to 2553. [2021-11-07 11:27:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2552 states have (on average 1.4627742946708464) internal successors, (3733), 2552 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3733 transitions. [2021-11-07 11:27:59,263 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3733 transitions. Word has length 90 [2021-11-07 11:27:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:27:59,263 INFO L470 AbstractCegarLoop]: Abstraction has 2553 states and 3733 transitions. [2021-11-07 11:27:59,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.923076923076923) internal successors, (90), 13 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:27:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3733 transitions. [2021-11-07 11:27:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-11-07 11:27:59,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:27:59,269 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:27:59,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 11:27:59,269 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:27:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:27:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1009416979, now seen corresponding path program 1 times [2021-11-07 11:27:59,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:27:59,271 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760472187] [2021-11-07 11:27:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:27:59,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:27:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:27:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 11:27:59,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 11:27:59,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760472187] [2021-11-07 11:27:59,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760472187] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 11:27:59,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524883381] [2021-11-07 11:27:59,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:27:59,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 11:27:59,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 11:27:59,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 11:27:59,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 11:27:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:27:59,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 11:27:59,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:27:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 11:27:59,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 11:28:00,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524883381] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 11:28:00,156 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 11:28:00,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2021-11-07 11:28:00,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124956220] [2021-11-07 11:28:00,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 11:28:00,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 11:28:00,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 11:28:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 11:28:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2021-11-07 11:28:00,157 INFO L87 Difference]: Start difference. First operand 2553 states and 3733 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:02,180 INFO L93 Difference]: Finished difference Result 11688 states and 17013 transitions. [2021-11-07 11:28:02,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 11:28:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2021-11-07 11:28:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:02,191 INFO L225 Difference]: With dead ends: 11688 [2021-11-07 11:28:02,191 INFO L226 Difference]: Without dead ends: 9160 [2021-11-07 11:28:02,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 42.00ms TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-11-07 11:28:02,195 INFO L933 BasicCegarLoop]: 2640 mSDtfsCounter, 10951 mSDsluCounter, 9561 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 160.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10951 SdHoareTripleChecker+Valid, 12201 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.17ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 190.06ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:02,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10951 Valid, 12201 Invalid, 64 Unknown, 0 Unchecked, 15.17ms Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 190.06ms Time] [2021-11-07 11:28:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9160 states. [2021-11-07 11:28:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9160 to 2603. [2021-11-07 11:28:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 2602 states have (on average 1.462336664104535) internal successors, (3805), 2602 states have internal predecessors, (3805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 3805 transitions. [2021-11-07 11:28:02,730 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 3805 transitions. Word has length 95 [2021-11-07 11:28:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:02,732 INFO L470 AbstractCegarLoop]: Abstraction has 2603 states and 3805 transitions. [2021-11-07 11:28:02,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 9 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 3805 transitions. [2021-11-07 11:28:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-11-07 11:28:02,737 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:02,738 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:02,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:02,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-07 11:28:02,964 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:02,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -855956460, now seen corresponding path program 1 times [2021-11-07 11:28:02,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 11:28:02,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112049153] [2021-11-07 11:28:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:02,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 11:28:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 11:28:03,350 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 11:28:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 11:28:03,745 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 11:28:03,745 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-07 11:28:03,747 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-07 11:28:03,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 11:28:03,752 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:03,754 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 11:28:03,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 11:28:03 BoogieIcfgContainer [2021-11-07 11:28:03,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 11:28:03,960 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 11:28:03,960 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 11:28:03,960 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 11:28:03,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:23:16" (3/4) ... [2021-11-07 11:28:03,963 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 11:28:03,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 11:28:03,963 INFO L158 Benchmark]: Toolchain (without parser) took 292863.22ms. Allocated memory was 88.1MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 50.3MB in the beginning and 732.2MB in the end (delta: -682.0MB). Peak memory consumption was 567.0MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,964 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 11:28:03,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1492.28ms. Allocated memory was 88.1MB in the beginning and 155.2MB in the end (delta: 67.1MB). Free memory was 50.0MB in the beginning and 77.6MB in the end (delta: -27.6MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 239.70ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 84.2MB in the end (delta: -6.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,965 INFO L158 Benchmark]: Boogie Preprocessor took 259.17ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 847.8kB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,971 INFO L158 Benchmark]: RCFGBuilder took 3343.85ms. Allocated memory was 155.2MB in the beginning and 304.1MB in the end (delta: 148.9MB). Free memory was 83.3MB in the beginning and 208.0MB in the end (delta: -124.7MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,972 INFO L158 Benchmark]: TraceAbstraction took 287517.21ms. Allocated memory was 304.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 207.0MB in the beginning and 732.2MB in the end (delta: -525.2MB). Peak memory consumption was 507.6MB. Max. memory is 16.1GB. [2021-11-07 11:28:03,972 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 1.3GB. Free memory is still 732.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 11:28:03,974 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1492.28ms. Allocated memory was 88.1MB in the beginning and 155.2MB in the end (delta: 67.1MB). Free memory was 50.0MB in the beginning and 77.6MB in the end (delta: -27.6MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 239.70ms. Allocated memory is still 155.2MB. Free memory was 77.6MB in the beginning and 84.2MB in the end (delta: -6.5MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 259.17ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 847.8kB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3343.85ms. Allocated memory was 155.2MB in the beginning and 304.1MB in the end (delta: 148.9MB). Free memory was 83.3MB in the beginning and 208.0MB in the end (delta: -124.7MB). Peak memory consumption was 128.7MB. Max. memory is 16.1GB. * TraceAbstraction took 287517.21ms. Allocated memory was 304.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 207.0MB in the beginning and 732.2MB in the end (delta: -525.2MB). Peak memory consumption was 507.6MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 1.3GB. Free memory is still 732.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7129]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 4873, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=0, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4871] void *tmp ; [L4862] void *tmp___2 ; [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] return ldv_malloc(size); [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L7287] return __VERIFIER_nondet_int(); [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6753] return (status); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7022] COND TRUE ldv_s_sl_ldisc_tty_ldisc_ops == 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7117] ldv_func_ret_type___1 ldv_func_res ; [L7118] int tmp ; [L6037] struct slip *sl ; [L6038] int err ; [L6039] int tmp ; [L6040] dev_t tmp___0 ; [L6041] struct task_struct *tmp___1 ; [L6042] int tmp___2 ; [L7172] return __VERIFIER_nondet_int(); [L6044] tmp = capable(12) [L6045] COND FALSE !(tmp == 0) [L6049] EXPR tty->ops [L6049] EXPR (tty->ops)->write VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6049-L6051] COND FALSE !((unsigned long )(tty->ops)->write == (unsigned long )((int (* )(struct tty_struct * , unsigned char const * , int ))0)) [L5925] int i ; [L5926] struct net_device *dev ; [L5927] struct slip *sl ; [L5928] void *tmp ; [L5930] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5938] tmp = netdev_priv((struct net_device const *)dev) [L5939] sl = (struct slip *)tmp [L5940] EXPR sl->tty [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5940] EXPR sl->leased [L5940] (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5940] COND TRUE (unsigned long )sl->tty != (unsigned long )((struct tty_struct *)0) || (unsigned int )sl->leased != 0U [L5949] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5951] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5933] EXPR slip_devs + (unsigned long )i [L5933] dev = *(slip_devs + (unsigned long )i) [L5934] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6057] EXPR tty->disc_data [L6057] sl = (struct slip *)tty->disc_data [L6058] err = -17 [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 [L6059] EXPR sl->magic [L6059] (unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6059] COND FALSE !((unsigned long )sl != (unsigned long )((struct slip *)0) && sl->magic == 21250) [L6063] err = -23 [L7276] return __VERIFIER_nondet_uint(); [L6064] tmp___0 = tty_devnum(tty) [L5961] int i ; [L5962] struct net_device *dev ; [L5963] struct slip *sl ; [L5964] void *tmp ; [L5965] int tmp___0 ; [L5966] char name[16U] ; [L5967] void *tmp___1 ; [L5968] struct lock_class_key __key ; [L5969] struct lock_class_key __key___0 ; [L5970] struct lock_class_key __key___1 ; [L5972] dev = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5973] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L5977] i = 0 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L5985] i = i + 1 VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5987] COND TRUE i < slip_maxdev VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5980] EXPR slip_devs + (unsigned long )i [L5980] dev = *(slip_devs + (unsigned long )i) [L5981] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5992] COND FALSE !(i >= slip_maxdev) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L5996] COND FALSE !((unsigned long )dev != (unsigned long )((struct net_device *)0)) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6008] COND TRUE (unsigned long )dev == (unsigned long )((struct net_device *)0) [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4838] COND FALSE !(!cond) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4850] return res; VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7168] return ldv_malloc(sizeof(struct net_device)); [L6010] dev = alloc_netdev_mqs(472, (char const *)(& name), & sl_setup, 1U, 1U) [L6011] COND FALSE !((unsigned long )dev == (unsigned long )((struct net_device *)0)) [L6015] dev->base_addr = (unsigned long )i VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4903] return ((void *)dev + 2496U); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6018] tmp___1 = netdev_priv((struct net_device const *)dev) [L6019] sl = (struct slip *)tmp___1 [L6020] sl->magic = 21250 [L6021] sl->dev = dev [L4778] return (& lock->ldv_5934.rlock); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6024] sl->mode = 8U [L6026] sl->keepalive_timer.data = (unsigned long )sl [L6027] sl->keepalive_timer.function = & sl_keepalive [L6029] sl->outfill_timer.data = (unsigned long )sl [L6030] sl->outfill_timer.function = & sl_outfill [L6031] *(slip_devs + (unsigned long )i) = dev [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); [L6032] return (sl); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6065] sl = sl_alloc(tmp___0) [L6066] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0)) [L6070] sl->tty = tty [L6071] tty->disc_data = (void *)sl [L7276] return __VERIFIER_nondet_uint(); [L6072] sl->line = tty_devnum(tty) [L4746] struct task_struct *pfo_ret__ ; [L4749] case 1UL: [L4752] case 2UL: [L4755] case 4UL: [L4758] case 8UL: VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L4765] return (pfo_ret__); VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6073] tmp___1 = get_current() [L6074] EXPR tmp___1->pid [L6074] sl->pid = tmp___1->pid [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L6075] tmp___2 = constant_test_bit(0U, (unsigned long const volatile *)(& sl->flags)) [L6076] COND FALSE !(tmp___2 == 0) VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] EXPR sl->keepalive VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6090] COND FALSE !((unsigned int )sl->keepalive != 0U) [L6095] EXPR sl->outfill VAL [__this_module={65541:65544}, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L6095] COND TRUE (unsigned int )sl->outfill != 0U [L6096] EXPR sl->outfill [L6096] sl->outfill_timer.expires = (unsigned long )((int )sl->outfill * 250) + (unsigned long )jiffies [L6101] tty->receive_room = 65536U [L6102] EXPR sl->dev [L6102] EXPR (sl->dev)->base_addr [L6102] return ((int )(sl->dev)->base_addr); [L7120] tmp = slip_open(tty) [L7121] ldv_func_res = tmp [L7135] COND FALSE !(ret_val <= 0) VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] [L7129] reach_error() VAL [__this_module={65541:65544}, jiffies=0, LDV_IN_INTERRUPT=1, sl_ldisc={53:0}, sl_netdev_ops={67:0}, slip_devs={-36893488147419103231:0}, slip_maxdev=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1042 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 287260.37ms, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 70.42ms, AutomataDifference: 274900.00ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 25.57ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 57 mSolverCounterUnknown, 214836 SdHoareTripleChecker+Valid, 234590.68ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214836 mSDsluCounter, 443729 SdHoareTripleChecker+Invalid, 225500.69ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384636 mSDsCounter, 1773 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43902 IncrementalHoareTripleChecker+Invalid, 45732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1773 mSolverCounterUnsat, 59093 mSDtfsCounter, 43902 mSolverCounterSat, 862.07ms SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 877 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23946 ImplicationChecksByTransitivity, 20909.91ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2603occurred in iteration=18, InterpolantAutomatonStates: 473, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 3548.16ms AutomataMinimizationTime, 18 MinimizatonAttempts, 85938 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 209.07ms SsaConstructionTime, 2589.03ms SatisfiabilityAnalysisTime, 4262.29ms InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1539 ConstructedInterpolants, 0 QuantifiedInterpolants, 6792 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1895 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 22 InterpolantComputations, 16 PerfectInterpolantSequences, 13/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-07 11:28:04,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5b36d44 [2021-11-07 11:28:05,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 11:28:05,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 11:28:05,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 11:28:05,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 11:28:05,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 11:28:05,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 11:28:05,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 11:28:05,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 11:28:05,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 11:28:05,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 11:28:05,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 11:28:05,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 11:28:05,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 11:28:05,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 11:28:06,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 11:28:06,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 11:28:06,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 11:28:06,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 11:28:06,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 11:28:06,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 11:28:06,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 11:28:06,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 11:28:06,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 11:28:06,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 11:28:06,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 11:28:06,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 11:28:06,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 11:28:06,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 11:28:06,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 11:28:06,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 11:28:06,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 11:28:06,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 11:28:06,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 11:28:06,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 11:28:06,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 11:28:06,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 11:28:06,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 11:28:06,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 11:28:06,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 11:28:06,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 11:28:06,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-07 11:28:06,065 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 11:28:06,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 11:28:06,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 11:28:06,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 11:28:06,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 11:28:06,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 11:28:06,068 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 11:28:06,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 11:28:06,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 11:28:06,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 11:28:06,070 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 11:28:06,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 11:28:06,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 11:28:06,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 11:28:06,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 11:28:06,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 11:28:06,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 11:28:06,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 11:28:06,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 11:28:06,072 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 11:28:06,072 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 11:28:06,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 11:28:06,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 11:28:06,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 11:28:06,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 11:28:06,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 11:28:06,073 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 03b59b42cc833f5b28fc5dc7cc6711355c533ad94229ba44874c6d4d186d9dcb [2021-11-07 11:28:06,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 11:28:06,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 11:28:06,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 11:28:06,413 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 11:28:06,414 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 11:28:06,415 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:28:06,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0591e633e/a21f972bee2540feb734b8b082a63cca/FLAG7affbe32d [2021-11-07 11:28:07,198 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 11:28:07,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:28:07,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0591e633e/a21f972bee2540feb734b8b082a63cca/FLAG7affbe32d [2021-11-07 11:28:07,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0591e633e/a21f972bee2540feb734b8b082a63cca [2021-11-07 11:28:07,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 11:28:07,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 11:28:07,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 11:28:07,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 11:28:07,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 11:28:07,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:28:07" (1/1) ... [2021-11-07 11:28:07,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3969ab89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:07, skipping insertion in model container [2021-11-07 11:28:07,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:28:07" (1/1) ... [2021-11-07 11:28:07,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 11:28:07,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 11:28:08,435 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-07 11:28:08,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 11:28:08,474 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 11:28:08,833 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2021-11-07 11:28:08,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 11:28:08,924 INFO L208 MainTranslator]: Completed translation [2021-11-07 11:28:08,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08 WrapperNode [2021-11-07 11:28:08,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 11:28:08,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 11:28:08,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 11:28:08,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 11:28:08,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:08,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 11:28:09,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 11:28:09,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 11:28:09,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 11:28:09,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 11:28:09,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 11:28:09,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 11:28:09,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 11:28:09,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (1/1) ... [2021-11-07 11:28:09,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 11:28:09,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 11:28:09,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 11:28:09,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 11:28:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-07 11:28:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-07 11:28:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-07 11:28:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-07 11:28:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-07 11:28:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 11:28:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 11:28:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 11:28:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-07 11:28:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-07 11:28:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-07 11:28:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-07 11:28:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 11:28:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-07 11:28:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-07 11:28:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-07 11:28:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 11:28:09,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 11:28:21,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 11:28:21,064 INFO L299 CfgBuilder]: Removed 972 assume(true) statements. [2021-11-07 11:28:21,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:28:21 BoogieIcfgContainer [2021-11-07 11:28:21,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 11:28:21,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 11:28:21,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 11:28:21,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 11:28:21,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:28:07" (1/3) ... [2021-11-07 11:28:21,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621c5b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:28:21, skipping insertion in model container [2021-11-07 11:28:21,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:28:08" (2/3) ... [2021-11-07 11:28:21,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621c5b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:28:21, skipping insertion in model container [2021-11-07 11:28:21,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:28:21" (3/3) ... [2021-11-07 11:28:21,073 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2021-11-07 11:28:21,077 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 11:28:21,077 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 11:28:21,117 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 11:28:21,123 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 11:28:21,123 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 11:28:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 11:28:21,161 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:21,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:21,162 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash -864679343, now seen corresponding path program 1 times [2021-11-07 11:28:21,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:21,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005706092] [2021-11-07 11:28:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:21,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:21,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 11:28:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:21,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 11:28:21,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:21,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:21,952 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:21,952 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005706092] [2021-11-07 11:28:21,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005706092] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:21,952 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:21,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-07 11:28:21,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050068181] [2021-11-07 11:28:21,954 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:21,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 11:28:21,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 11:28:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:28:21,992 INFO L87 Difference]: Start difference. First operand has 1042 states, 1040 states have (on average 1.4942307692307693) internal successors, (1554), 1041 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:22,181 INFO L93 Difference]: Finished difference Result 2079 states and 3101 transitions. [2021-11-07 11:28:22,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:28:22,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 11:28:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:22,200 INFO L225 Difference]: With dead ends: 2079 [2021-11-07 11:28:22,200 INFO L226 Difference]: Without dead ends: 1011 [2021-11-07 11:28:22,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 38.99ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 11:28:22,212 INFO L933 BasicCegarLoop]: 1528 mSDtfsCounter, 1534 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.10ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.88ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.33ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:22,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 1528 Invalid, 12 Unknown, 0 Unchecked, 13.88ms Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 32.33ms Time] [2021-11-07 11:28:22,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-07 11:28:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-07 11:28:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4772277227722772) internal successors, (1492), 1010 states have internal predecessors, (1492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1492 transitions. [2021-11-07 11:28:22,302 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1492 transitions. Word has length 36 [2021-11-07 11:28:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:22,302 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1492 transitions. [2021-11-07 11:28:22,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:22,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1492 transitions. [2021-11-07 11:28:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 11:28:22,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:22,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:22,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 11:28:22,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:22,524 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:22,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -842047089, now seen corresponding path program 1 times [2021-11-07 11:28:22,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:22,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997604752] [2021-11-07 11:28:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:22,527 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:22,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:22,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:22,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 11:28:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:22,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 11:28:22,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:23,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:23,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:23,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:23,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997604752] [2021-11-07 11:28:23,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997604752] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:23,168 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:23,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 11:28:23,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614166126] [2021-11-07 11:28:23,169 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:23,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 11:28:23,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:23,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 11:28:23,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 11:28:23,170 INFO L87 Difference]: Start difference. First operand 1011 states and 1492 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:23,243 INFO L93 Difference]: Finished difference Result 1999 states and 2957 transitions. [2021-11-07 11:28:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 11:28:23,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 11:28:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:23,249 INFO L225 Difference]: With dead ends: 1999 [2021-11-07 11:28:23,249 INFO L226 Difference]: Without dead ends: 1011 [2021-11-07 11:28:23,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 32.92ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:28:23,253 INFO L933 BasicCegarLoop]: 1491 mSDtfsCounter, 2 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4468 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.46ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:23,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4468 Invalid, 7 Unknown, 0 Unchecked, 6.46ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 16.46ms Time] [2021-11-07 11:28:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-11-07 11:28:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-11-07 11:28:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1010 states have (on average 1.4762376237623762) internal successors, (1491), 1010 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1491 transitions. [2021-11-07 11:28:23,295 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1491 transitions. Word has length 36 [2021-11-07 11:28:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:23,296 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1491 transitions. [2021-11-07 11:28:23,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1491 transitions. [2021-11-07 11:28:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-07 11:28:23,300 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:23,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:23,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:23,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:23,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash 44746728, now seen corresponding path program 1 times [2021-11-07 11:28:23,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:23,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302041834] [2021-11-07 11:28:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:23,521 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:23,522 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:23,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 11:28:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:23,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-07 11:28:23,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:24,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:24,379 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:24,380 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302041834] [2021-11-07 11:28:24,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302041834] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:24,380 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:24,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-07 11:28:24,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013400580] [2021-11-07 11:28:24,381 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:24,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-07 11:28:24,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:24,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-07 11:28:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-07 11:28:24,382 INFO L87 Difference]: Start difference. First operand 1011 states and 1491 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:28,771 INFO L93 Difference]: Finished difference Result 8366 states and 12465 transitions. [2021-11-07 11:28:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-07 11:28:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-07 11:28:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:28,807 INFO L225 Difference]: With dead ends: 8366 [2021-11-07 11:28:28,808 INFO L226 Difference]: Without dead ends: 7370 [2021-11-07 11:28:28,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 604.15ms TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2021-11-07 11:28:28,816 INFO L933 BasicCegarLoop]: 5268 mSDtfsCounter, 19603 mSDsluCounter, 37681 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2982.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19603 SdHoareTripleChecker+Valid, 42949 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 63.03ms SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3340.26ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:28,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19603 Valid, 42949 Invalid, 711 Unknown, 0 Unchecked, 63.03ms Time], IncrementalHoareTripleChecker [72 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 3340.26ms Time] [2021-11-07 11:28:28,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7370 states. [2021-11-07 11:28:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7370 to 1972. [2021-11-07 11:28:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4814814814814814) internal successors, (2920), 1971 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2920 transitions. [2021-11-07 11:28:28,974 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2920 transitions. Word has length 39 [2021-11-07 11:28:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:28,974 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2920 transitions. [2021-11-07 11:28:28,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2920 transitions. [2021-11-07 11:28:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 11:28:28,977 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:28,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:28,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:29,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:29,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:29,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 713639092, now seen corresponding path program 1 times [2021-11-07 11:28:29,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:29,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426622994] [2021-11-07 11:28:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:29,197 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:29,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:29,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:29,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 11:28:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:29,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 11:28:29,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:29,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:29,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:29,729 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:29,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426622994] [2021-11-07 11:28:29,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426622994] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:29,729 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:29,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 11:28:29,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256600697] [2021-11-07 11:28:29,730 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:29,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 11:28:29,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 11:28:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 11:28:29,731 INFO L87 Difference]: Start difference. First operand 1972 states and 2920 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:30,198 INFO L93 Difference]: Finished difference Result 6659 states and 9888 transitions. [2021-11-07 11:28:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 11:28:30,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-07 11:28:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:30,229 INFO L225 Difference]: With dead ends: 6659 [2021-11-07 11:28:30,230 INFO L226 Difference]: Without dead ends: 6657 [2021-11-07 11:28:30,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.60ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-11-07 11:28:30,240 INFO L933 BasicCegarLoop]: 2944 mSDtfsCounter, 6531 mSDsluCounter, 10296 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6531 SdHoareTripleChecker+Valid, 13240 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.41ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.25ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:30,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6531 Valid, 13240 Invalid, 31 Unknown, 0 Unchecked, 11.41ms Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 87.25ms Time] [2021-11-07 11:28:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6657 states. [2021-11-07 11:28:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6657 to 1976. [2021-11-07 11:28:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 1.480506329113924) internal successors, (2924), 1975 states have internal predecessors, (2924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 2924 transitions. [2021-11-07 11:28:30,414 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 2924 transitions. Word has length 42 [2021-11-07 11:28:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:30,415 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 2924 transitions. [2021-11-07 11:28:30,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 2924 transitions. [2021-11-07 11:28:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-07 11:28:30,417 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:30,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:30,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:30,640 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:30,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1808756799, now seen corresponding path program 1 times [2021-11-07 11:28:30,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:30,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933661889] [2021-11-07 11:28:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:30,641 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:30,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:30,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:30,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 11:28:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:30,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 11:28:30,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:31,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:31,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:31,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933661889] [2021-11-07 11:28:31,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933661889] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:31,273 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:31,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-07 11:28:31,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483967939] [2021-11-07 11:28:31,274 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:31,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 11:28:31,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 11:28:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 11:28:31,275 INFO L87 Difference]: Start difference. First operand 1976 states and 2924 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:33,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:35,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:35,822 INFO L93 Difference]: Finished difference Result 7813 states and 11591 transitions. [2021-11-07 11:28:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 11:28:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-07 11:28:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:35,848 INFO L225 Difference]: With dead ends: 7813 [2021-11-07 11:28:35,848 INFO L226 Difference]: Without dead ends: 5862 [2021-11-07 11:28:35,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 31.93ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:28:35,853 INFO L933 BasicCegarLoop]: 2691 mSDtfsCounter, 6296 mSDsluCounter, 4156 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4108.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6296 SdHoareTripleChecker+Valid, 6847 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.34ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4147.14ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:35,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6296 Valid, 6847 Invalid, 36 Unknown, 0 Unchecked, 9.34ms Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 4147.14ms Time] [2021-11-07 11:28:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2021-11-07 11:28:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 1996. [2021-11-07 11:28:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.4796992481203008) internal successors, (2952), 1995 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2952 transitions. [2021-11-07 11:28:36,015 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2952 transitions. Word has length 49 [2021-11-07 11:28:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:36,015 INFO L470 AbstractCegarLoop]: Abstraction has 1996 states and 2952 transitions. [2021-11-07 11:28:36,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2952 transitions. [2021-11-07 11:28:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 11:28:36,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:36,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:36,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:36,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:36,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:36,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 287427040, now seen corresponding path program 1 times [2021-11-07 11:28:36,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:36,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443258586] [2021-11-07 11:28:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:36,237 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:36,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-07 11:28:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:36,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 11:28:36,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:36,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:36,853 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:36,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443258586] [2021-11-07 11:28:36,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443258586] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:36,853 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:36,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-07 11:28:36,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504446872] [2021-11-07 11:28:36,853 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:36,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 11:28:36,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 11:28:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 11:28:36,855 INFO L87 Difference]: Start difference. First operand 1996 states and 2952 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:37,696 INFO L93 Difference]: Finished difference Result 9962 states and 14800 transitions. [2021-11-07 11:28:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-07 11:28:37,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-07 11:28:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:37,749 INFO L225 Difference]: With dead ends: 9962 [2021-11-07 11:28:37,749 INFO L226 Difference]: Without dead ends: 9960 [2021-11-07 11:28:37,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 175.25ms TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2021-11-07 11:28:37,752 INFO L933 BasicCegarLoop]: 4400 mSDtfsCounter, 11526 mSDsluCounter, 18231 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 155.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11526 SdHoareTripleChecker+Valid, 22631 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.81ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 177.43ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:37,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11526 Valid, 22631 Invalid, 120 Unknown, 0 Unchecked, 16.81ms Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 177.43ms Time] [2021-11-07 11:28:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2021-11-07 11:28:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 1998. [2021-11-07 11:28:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1998 states, 1997 states have (on average 1.4792188282423635) internal successors, (2954), 1997 states have internal predecessors, (2954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2954 transitions. [2021-11-07 11:28:37,942 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 2954 transitions. Word has length 51 [2021-11-07 11:28:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:37,942 INFO L470 AbstractCegarLoop]: Abstraction has 1998 states and 2954 transitions. [2021-11-07 11:28:37,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 2954 transitions. [2021-11-07 11:28:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-07 11:28:37,944 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:37,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:37,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:38,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:38,158 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:38,158 INFO L85 PathProgramCache]: Analyzing trace with hash -755149405, now seen corresponding path program 1 times [2021-11-07 11:28:38,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:38,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250775126] [2021-11-07 11:28:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:38,159 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:38,160 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:38,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-07 11:28:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:38,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 11:28:38,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:38,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:39,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:39,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250775126] [2021-11-07 11:28:39,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250775126] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:39,049 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:39,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 11:28:39,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753388526] [2021-11-07 11:28:39,049 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:39,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:28:39,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:28:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:28:39,050 INFO L87 Difference]: Start difference. First operand 1998 states and 2954 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:41,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:41,279 INFO L93 Difference]: Finished difference Result 2000 states and 2955 transitions. [2021-11-07 11:28:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:28:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-07 11:28:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:41,290 INFO L225 Difference]: With dead ends: 2000 [2021-11-07 11:28:41,291 INFO L226 Difference]: Without dead ends: 1024 [2021-11-07 11:28:41,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.37ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:28:41,293 INFO L933 BasicCegarLoop]: 1474 mSDtfsCounter, 1437 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2128.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.64ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2159.71ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:41,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1492 Invalid, 17 Unknown, 0 Unchecked, 1.64ms Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2159.71ms Time] [2021-11-07 11:28:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-11-07 11:28:41,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2021-11-07 11:28:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 1023 states have (on average 1.4721407624633431) internal successors, (1506), 1023 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1506 transitions. [2021-11-07 11:28:41,390 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1506 transitions. Word has length 65 [2021-11-07 11:28:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:41,390 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1506 transitions. [2021-11-07 11:28:41,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1506 transitions. [2021-11-07 11:28:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 11:28:41,393 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:41,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:41,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:41,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:41,612 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash -436055095, now seen corresponding path program 1 times [2021-11-07 11:28:41,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:41,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798413052] [2021-11-07 11:28:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:41,613 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:41,614 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:41,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-07 11:28:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:41,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 11:28:41,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:42,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:42,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:42,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798413052] [2021-11-07 11:28:42,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798413052] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:42,359 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:42,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-07 11:28:42,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087088814] [2021-11-07 11:28:42,359 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:42,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 11:28:42,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 11:28:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 11:28:42,360 INFO L87 Difference]: Start difference. First operand 1024 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:44,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:44,643 INFO L93 Difference]: Finished difference Result 3998 states and 5914 transitions. [2021-11-07 11:28:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 11:28:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-07 11:28:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:44,649 INFO L225 Difference]: With dead ends: 3998 [2021-11-07 11:28:44,649 INFO L226 Difference]: Without dead ends: 2999 [2021-11-07 11:28:44,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 26.25ms TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:28:44,651 INFO L933 BasicCegarLoop]: 2904 mSDtfsCounter, 5813 mSDsluCounter, 2900 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2008.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5813 SdHoareTripleChecker+Valid, 5804 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.95ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2062.10ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:44,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5813 Valid, 5804 Invalid, 41 Unknown, 0 Unchecked, 5.95ms Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 2062.10ms Time] [2021-11-07 11:28:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2021-11-07 11:28:44,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1029. [2021-11-07 11:28:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.4708171206225682) internal successors, (1512), 1028 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1512 transitions. [2021-11-07 11:28:44,761 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1512 transitions. Word has length 67 [2021-11-07 11:28:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:44,762 INFO L470 AbstractCegarLoop]: Abstraction has 1029 states and 1512 transitions. [2021-11-07 11:28:44,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1512 transitions. [2021-11-07 11:28:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-07 11:28:44,764 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:44,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:44,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:44,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:44,984 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash 973079369, now seen corresponding path program 1 times [2021-11-07 11:28:44,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:44,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772849575] [2021-11-07 11:28:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:44,985 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:44,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:44,986 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-07 11:28:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:45,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 11:28:45,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:45,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:45,770 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:45,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772849575] [2021-11-07 11:28:45,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772849575] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 11:28:45,770 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 11:28:45,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-11-07 11:28:45,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400492333] [2021-11-07 11:28:45,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 11:28:45,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-07 11:28:45,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:45,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-07 11:28:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-07 11:28:45,772 INFO L87 Difference]: Start difference. First operand 1029 states and 1512 transitions. Second operand has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:47,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:49,168 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:51,186 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:53,194 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 11:28:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:54,657 INFO L93 Difference]: Finished difference Result 7995 states and 11824 transitions. [2021-11-07 11:28:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 11:28:54,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-07 11:28:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:54,670 INFO L225 Difference]: With dead ends: 7995 [2021-11-07 11:28:54,670 INFO L226 Difference]: Without dead ends: 6991 [2021-11-07 11:28:54,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 121.20ms TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2021-11-07 11:28:54,673 INFO L933 BasicCegarLoop]: 5606 mSDtfsCounter, 21770 mSDsluCounter, 17198 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8120.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 21770 SdHoareTripleChecker+Valid, 22804 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.85ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8265.56ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:54,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21770 Valid, 22804 Invalid, 172 Unknown, 0 Unchecked, 18.85ms Time], IncrementalHoareTripleChecker [19 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 8265.56ms Time] [2021-11-07 11:28:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6991 states. [2021-11-07 11:28:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6991 to 1041. [2021-11-07 11:28:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 1040 states have (on average 1.4692307692307693) internal successors, (1528), 1040 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:54,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1528 transitions. [2021-11-07 11:28:54,808 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1528 transitions. Word has length 73 [2021-11-07 11:28:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:54,808 INFO L470 AbstractCegarLoop]: Abstraction has 1041 states and 1528 transitions. [2021-11-07 11:28:54,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.9) internal successors, (129), 9 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1528 transitions. [2021-11-07 11:28:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 11:28:54,811 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:54,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:54,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:55,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:55,029 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 152916243, now seen corresponding path program 1 times [2021-11-07 11:28:55,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:55,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840719732] [2021-11-07 11:28:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:55,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:55,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:55,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:55,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-07 11:28:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:55,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 11:28:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:55,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:55,727 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:55,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840719732] [2021-11-07 11:28:55,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840719732] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:55,728 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:55,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-07 11:28:55,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796879020] [2021-11-07 11:28:55,728 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:55,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 11:28:55,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:55,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 11:28:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-07 11:28:55,728 INFO L87 Difference]: Start difference. First operand 1041 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:56,277 INFO L93 Difference]: Finished difference Result 4513 states and 6690 transitions. [2021-11-07 11:28:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 11:28:56,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-07 11:28:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:56,285 INFO L225 Difference]: With dead ends: 4513 [2021-11-07 11:28:56,285 INFO L226 Difference]: Without dead ends: 3497 [2021-11-07 11:28:56,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.01ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 11:28:56,288 INFO L933 BasicCegarLoop]: 2719 mSDtfsCounter, 6056 mSDsluCounter, 9285 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 200.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 6056 SdHoareTripleChecker+Valid, 12004 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.07ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 232.18ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:56,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6056 Valid, 12004 Invalid, 33 Unknown, 0 Unchecked, 8.07ms Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 232.18ms Time] [2021-11-07 11:28:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-11-07 11:28:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 1043. [2021-11-07 11:28:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1042 states have (on average 1.4683301343570057) internal successors, (1530), 1042 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1530 transitions. [2021-11-07 11:28:56,426 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1530 transitions. Word has length 75 [2021-11-07 11:28:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:56,427 INFO L470 AbstractCegarLoop]: Abstraction has 1043 states and 1530 transitions. [2021-11-07 11:28:56,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:56,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1530 transitions. [2021-11-07 11:28:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 11:28:56,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:56,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:56,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:56,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:56,643 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 800611437, now seen corresponding path program 1 times [2021-11-07 11:28:56,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:56,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783945819] [2021-11-07 11:28:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:56,645 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:56,646 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:56,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-07 11:28:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:57,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 11:28:57,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:57,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:57,341 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:57,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1783945819] [2021-11-07 11:28:57,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1783945819] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:57,341 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:57,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 11:28:57,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17540199] [2021-11-07 11:28:57,341 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:57,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:28:57,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:57,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:28:57,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:28:57,342 INFO L87 Difference]: Start difference. First operand 1043 states and 1530 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:28:57,791 INFO L93 Difference]: Finished difference Result 2901 states and 4285 transitions. [2021-11-07 11:28:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:28:57,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-07 11:28:57,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:28:57,795 INFO L225 Difference]: With dead ends: 2901 [2021-11-07 11:28:57,795 INFO L226 Difference]: Without dead ends: 1883 [2021-11-07 11:28:57,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.29ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:28:57,797 INFO L933 BasicCegarLoop]: 2719 mSDtfsCounter, 1243 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 257.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 4185 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.83ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 280.22ms IncrementalHoareTripleChecker+Time [2021-11-07 11:28:57,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 4185 Invalid, 18 Unknown, 0 Unchecked, 2.83ms Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 280.22ms Time] [2021-11-07 11:28:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2021-11-07 11:28:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1045. [2021-11-07 11:28:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 1044 states have (on average 1.4674329501915708) internal successors, (1532), 1044 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1532 transitions. [2021-11-07 11:28:57,909 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1532 transitions. Word has length 77 [2021-11-07 11:28:57,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:28:57,910 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1532 transitions. [2021-11-07 11:28:57,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:28:57,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1532 transitions. [2021-11-07 11:28:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-07 11:28:57,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:28:57,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:28:57,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-07 11:28:58,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:28:58,128 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:28:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:28:58,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1856276453, now seen corresponding path program 1 times [2021-11-07 11:28:58,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:28:58,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88444132] [2021-11-07 11:28:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:28:58,129 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:28:58,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:28:58,130 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:28:58,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-07 11:28:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:28:58,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 11:28:58,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:28:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:58,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:28:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:28:58,912 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:28:58,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88444132] [2021-11-07 11:28:58,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88444132] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:28:58,912 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:28:58,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-07 11:28:58,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249109076] [2021-11-07 11:28:58,912 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:28:58,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 11:28:58,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:28:58,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 11:28:58,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-07 11:28:58,913 INFO L87 Difference]: Start difference. First operand 1045 states and 1532 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:29:01,208 INFO L93 Difference]: Finished difference Result 8360 states and 12395 transitions. [2021-11-07 11:29:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-07 11:29:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-11-07 11:29:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:29:01,220 INFO L225 Difference]: With dead ends: 8360 [2021-11-07 11:29:01,220 INFO L226 Difference]: Without dead ends: 7340 [2021-11-07 11:29:01,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 195.36ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-07 11:29:01,225 INFO L933 BasicCegarLoop]: 4069 mSDtfsCounter, 15829 mSDsluCounter, 23293 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1137.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15829 SdHoareTripleChecker+Valid, 27362 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.47ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1304.97ms IncrementalHoareTripleChecker+Time [2021-11-07 11:29:01,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15829 Valid, 27362 Invalid, 339 Unknown, 0 Unchecked, 22.47ms Time], IncrementalHoareTripleChecker [19 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1304.97ms Time] [2021-11-07 11:29:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7340 states. [2021-11-07 11:29:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7340 to 1048. [2021-11-07 11:29:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.466093600764088) internal successors, (1535), 1047 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1535 transitions. [2021-11-07 11:29:01,426 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1535 transitions. Word has length 81 [2021-11-07 11:29:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:29:01,426 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1535 transitions. [2021-11-07 11:29:01,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1535 transitions. [2021-11-07 11:29:01,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-07 11:29:01,429 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:29:01,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:29:01,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-07 11:29:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:29:01,635 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:29:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:29:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1754920992, now seen corresponding path program 1 times [2021-11-07 11:29:01,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:29:01,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996741832] [2021-11-07 11:29:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:29:01,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:29:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:29:01,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:29:01,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-07 11:29:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:29:02,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 11:29:02,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:29:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:29:02,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:29:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:29:02,337 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 11:29:02,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996741832] [2021-11-07 11:29:02,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996741832] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 11:29:02,337 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 11:29:02,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 11:29:02,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855654764] [2021-11-07 11:29:02,337 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 11:29:02,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 11:29:02,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 11:29:02,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 11:29:02,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:29:02,338 INFO L87 Difference]: Start difference. First operand 1048 states and 1535 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 11:29:02,539 INFO L93 Difference]: Finished difference Result 2080 states and 3052 transitions. [2021-11-07 11:29:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 11:29:02,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2021-11-07 11:29:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 11:29:02,540 INFO L225 Difference]: With dead ends: 2080 [2021-11-07 11:29:02,541 INFO L226 Difference]: Without dead ends: 1057 [2021-11-07 11:29:02,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.98ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 11:29:02,542 INFO L933 BasicCegarLoop]: 1443 mSDtfsCounter, 0 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2824 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.67ms SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.51ms IncrementalHoareTripleChecker+Time [2021-11-07 11:29:02,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2824 Invalid, 141 Unknown, 0 Unchecked, 1.67ms Time], IncrementalHoareTripleChecker [61 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 90.51ms Time] [2021-11-07 11:29:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2021-11-07 11:29:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1048. [2021-11-07 11:29:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 1047 states have (on average 1.440305635148042) internal successors, (1508), 1047 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:02,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1508 transitions. [2021-11-07 11:29:02,655 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1508 transitions. Word has length 84 [2021-11-07 11:29:02,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 11:29:02,655 INFO L470 AbstractCegarLoop]: Abstraction has 1048 states and 1508 transitions. [2021-11-07 11:29:02,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 11:29:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1508 transitions. [2021-11-07 11:29:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-11-07 11:29:02,656 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 11:29:02,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 11:29:02,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-11-07 11:29:02,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-07 11:29:02,857 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 11:29:02,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 11:29:02,858 INFO L85 PathProgramCache]: Analyzing trace with hash -522722400, now seen corresponding path program 1 times [2021-11-07 11:29:02,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 11:29:02,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341710985] [2021-11-07 11:29:02,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 11:29:02,859 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 11:29:02,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 11:29:02,860 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 11:29:02,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-07 11:29:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 11:29:07,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 89 conjunts are in the unsatisfiable core [2021-11-07 11:29:07,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 11:29:07,289 INFO L354 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2021-11-07 11:29:07,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 22 [2021-11-07 11:29:07,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:07,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-11-07 11:29:08,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:08,672 INFO L354 Elim1Store]: treesize reduction 250, result has 16.9 percent of original size [2021-11-07 11:29:08,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 62 treesize of output 94 [2021-11-07 11:29:10,504 INFO L354 Elim1Store]: treesize reduction 72, result has 11.1 percent of original size [2021-11-07 11:29:10,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 92 [2021-11-07 11:29:11,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:11,440 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-07 11:29:11,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2021-11-07 11:29:12,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2021-11-07 11:29:12,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 11:29:12,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-07 11:29:12,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2021-11-07 11:29:12,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-07 11:29:12,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:12,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-11-07 11:29:13,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-07 11:29:13,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-07 11:29:13,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2021-11-07 11:29:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2021-11-07 11:29:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 22 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 76 [2021-11-07 11:29:13,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 355 treesize of output 319 [2021-11-07 11:29:13,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:13,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 302 treesize of output 299 [2021-11-07 11:29:14,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 258 [2021-11-07 11:29:14,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 258 [2021-11-07 11:29:14,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,655 INFO L354 Elim1Store]: treesize reduction 120, result has 18.9 percent of original size [2021-11-07 11:29:14,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 239 [2021-11-07 11:29:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:14,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,141 INFO L354 Elim1Store]: treesize reduction 126, result has 18.2 percent of original size [2021-11-07 11:29:15,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 235 [2021-11-07 11:29:15,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:15,493 INFO L354 Elim1Store]: treesize reduction 435, result has 16.5 percent of original size [2021-11-07 11:29:15,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 36 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 24 case distinctions, treesize of input 243 treesize of output 217 [2021-11-07 11:29:18,408 INFO L354 Elim1Store]: treesize reduction 376, result has 10.3 percent of original size [2021-11-07 11:29:18,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 481 treesize of output 307 [2021-11-07 11:29:18,711 INFO L354 Elim1Store]: treesize reduction 706, result has 9.7 percent of original size [2021-11-07 11:29:18,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 466 treesize of output 463 [2021-11-07 11:29:18,976 INFO L354 Elim1Store]: treesize reduction 1312, result has 10.0 percent of original size [2021-11-07 11:29:18,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 451 treesize of output 456 [2021-11-07 11:29:19,406 INFO L354 Elim1Store]: treesize reduction 1376, result has 9.5 percent of original size [2021-11-07 11:29:19,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 432 treesize of output 437 [2021-11-07 11:29:21,082 INFO L354 Elim1Store]: treesize reduction 400, result has 11.5 percent of original size [2021-11-07 11:29:21,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 464 treesize of output 292 [2021-11-07 11:29:21,595 INFO L354 Elim1Store]: treesize reduction 524, result has 11.9 percent of original size [2021-11-07 11:29:21,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 263 treesize of output 283 [2021-11-07 11:29:21,839 INFO L354 Elim1Store]: treesize reduction 448, result has 11.5 percent of original size [2021-11-07 11:29:21,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 250 treesize of output 249 [2021-11-07 11:29:31,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,975 INFO L354 Elim1Store]: treesize reduction 248, result has 8.1 percent of original size [2021-11-07 11:29:31,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 177 treesize of output 176 [2021-11-07 11:29:31,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:31,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,099 INFO L354 Elim1Store]: treesize reduction 248, result has 8.1 percent of original size [2021-11-07 11:29:32,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 158 treesize of output 157 [2021-11-07 11:29:32,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:32,507 INFO L354 Elim1Store]: treesize reduction 161, result has 5.3 percent of original size [2021-11-07 11:29:32,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 130 [2021-11-07 11:29:42,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:42,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,198 INFO L354 Elim1Store]: treesize reduction 360, result has 5.8 percent of original size [2021-11-07 11:29:43,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 199 treesize of output 187 [2021-11-07 11:29:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,414 INFO L354 Elim1Store]: treesize reduction 360, result has 5.8 percent of original size [2021-11-07 11:29:43,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 157 [2021-11-07 11:29:43,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 11:29:43,941 INFO L244 Elim1Store]: Index analysis took 139 ms [2021-11-07 11:29:43,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 55 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 155 [2021-11-07 11:29:55,750 INFO L354 Elim1Store]: treesize reduction 360, result has 12.2 percent of original size [2021-11-07 11:29:55,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 505 treesize of output 321 [2021-11-07 11:29:55,842 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-07 11:29:55,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 768 treesize of output 286 [2021-11-07 11:29:56,292 INFO L354 Elim1Store]: treesize reduction 322, result has 2.1 percent of original size [2021-11-07 11:29:56,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 55 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 395 treesize of output 313 [2021-11-07 11:29:56,777 INFO L354 Elim1Store]: treesize reduction 320, result has 13.0 percent of original size [2021-11-07 11:29:56,778 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 252 treesize of output 240 [2021-11-07 11:29:56,843 INFO L354 Elim1Store]: treesize reduction 133, result has 0.7 percent of original size [2021-11-07 11:29:56,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 151 [2021-11-07 11:29:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 11:29:57,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 11:30:33,705 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse12 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base (let ((.cse15 (let ((.cse17 (store (select .cse14 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv190 64))))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.base))))) (store .cse20 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse20 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.offset))))) (store .cse4 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse4 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-07 11:30:35,727 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) c_ULTIMATE.start_slip_open_~sl~12.offset)) (.cse12 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_int| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base (let ((.cse15 (let ((.cse17 (store (select .cse14 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 c_ULTIMATE.start_slip_open_~sl~12.base .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd c_ULTIMATE.start_slip_open_~sl~12.offset (_ bv190 64))))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.base))))) (store .cse20 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse20 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_slip_open_~sl~12.base) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_slip_open_~sl~12.offset))))) (store .cse4 c_ULTIMATE.start_slip_open_~sl~12.base (store (store (store (store (select .cse4 c_ULTIMATE.start_slip_open_~sl~12.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_slip_open_~sl~12.base) .cse12))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-07 11:30:41,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_18 (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse6 (bvadd (_ bv186 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse7 (bvadd (_ bv208 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse8 (bvadd (_ bv212 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse11 (bvadd (_ bv4 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)) (.cse12 (bvadd |c_ULTIMATE.start_sl_alloc_#res.offset| (_ bv12 64)))) (let ((.cse0 (select (let ((.cse13 (let ((.cse14 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 v_DerPreprocessor_21)))) (store .cse18 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse18 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| (let ((.cse15 (let ((.cse17 (store (select .cse14 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse17 .cse6 (select (select (store .cse14 |c_ULTIMATE.start_sl_alloc_#res.base| .cse17) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse16 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse15 (bvadd (_ bv190 64) |c_ULTIMATE.start_sl_alloc_#res.offset|)))) (_ bv250 32)))))) (store (store .cse15 .cse7 ((_ extract 31 0) .cse16)) .cse8 ((_ extract 63 32) .cse16)))))))) (store .cse13 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse13 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse19 (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 c_ULTIMATE.start_slip_open_~tty.base)))) (store .cse21 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse21 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.base|))))) (store .cse20 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse20 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sl_alloc_#res.base|) .cse11 ULTIMATE.start_slip_open_~tty.offset)))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 |c_ULTIMATE.start_sl_alloc_#res.offset|))))) (store .cse4 |c_ULTIMATE.start_sl_alloc_#res.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_sl_alloc_#res.base|) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) |c_ULTIMATE.start_sl_alloc_#res.base|) .cse12))) (concat (select .cse0 (bvadd .cse1 (_ bv116 64))) (select .cse0 (bvadd .cse1 (_ bv112 64))))))) (_ bv0 32))) is different from false [2021-11-07 11:31:15,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-07 11:31:17,804 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse19 (let ((.cse20 (let ((.cse24 (let ((.cse25 (let ((.cse26 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse27 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ extract 31 0) .cse27)) .cse16 ((_ extract 63 32) .cse27))) .cse17 v_DerPreprocessor_25)))) (store .cse26 c_~slip_devs~0.base (store (select .cse26 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse25 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse24 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse24 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse21 (let ((.cse23 (store (select .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse23 .cse6 (select (select (store .cse20 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse23) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse22 (bvadd ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse21 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32))) ~jiffies~0))) (store (store .cse21 .cse7 ((_ extract 31 0) .cse22)) .cse8 ((_ extract 63 32) .cse22)))))))) (store .cse19 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse19 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse28 (let ((.cse29 (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_22) .cse16 v_DerPreprocessor_23) .cse17 |#funAddr~sl_outfill.base|)))) (store .cse32 c_~slip_devs~0.base (store (select .cse32 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse31 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse30 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse30 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_26) .cse16 v_DerPreprocessor_27) .cse17 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse18))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-07 11:32:05,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-07 11:32:07,330 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse16 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse22 (let ((.cse23 (let ((.cse27 (let ((.cse28 (let ((.cse29 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse32 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse31 ((_ extract 63 32) .cse32))) (store (let ((.cse30 ((_ extract 31 0) .cse32))) (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 .cse30) .cse16 .cse31) .cse17 v_DerPreprocessor_28) .cse18 .cse30)) .cse19 .cse31))) .cse20 v_DerPreprocessor_25)))) (store .cse29 c_~slip_devs~0.base (store (select .cse29 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse28 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse27 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse27 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse24 (let ((.cse26 (store (select .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse26 .cse6 (select (select (store .cse23 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse26) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse25 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse24 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse24 .cse7 ((_ extract 31 0) .cse25)) .cse8 ((_ extract 63 32) .cse25)))))))) (store .cse22 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse22 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse33 (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_29) .cse16 v_DerPreprocessor_30) .cse17 |#funAddr~sl_keepalive.base|) .cse18 v_DerPreprocessor_22) .cse19 v_DerPreprocessor_23) .cse20 |#funAddr~sl_outfill.base|)))) (store .cse37 c_~slip_devs~0.base (store (select .cse37 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse36 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse35 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse35 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse34 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse33 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse33 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_31) .cse16 v_DerPreprocessor_32) .cse17 |#funAddr~sl_keepalive.offset|) .cse18 v_DerPreprocessor_26) .cse19 v_DerPreprocessor_27) .cse20 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse21))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true [2021-11-07 11:32:37,415 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from false [2021-11-07 11:32:39,434 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_slip_open_~tmp___1~6.base_18 (_ BitVec 64)) (~jiffies~0 (_ BitVec 64)) (v_DerPreprocessor_22 (_ BitVec 64)) (v_DerPreprocessor_23 (_ BitVec 64)) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_29 (_ BitVec 64)) (v_DerPreprocessor_21 (_ BitVec 32)) (v_DerPreprocessor_26 (_ BitVec 64)) (v_DerPreprocessor_27 (_ BitVec 64)) (v_DerPreprocessor_24 (_ BitVec 32)) (v_DerPreprocessor_25 (_ BitVec 32)) (ULTIMATE.start_slip_open_~tty.offset (_ BitVec 64)) (v_DerPreprocessor_28 (_ BitVec 32)) (|ULTIMATE.start_tty_devnum_#res| (_ BitVec 32)) (v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ BitVec 64)) (v_DerPreprocessor_19 (_ BitVec 64)) (v_DerPreprocessor_13 (_ BitVec 64)) (v_DerPreprocessor_14 (_ BitVec 64)) (v_DerPreprocessor_33 (_ BitVec 64)) (v_DerPreprocessor_11 (_ BitVec 64)) (v_DerPreprocessor_12 (_ BitVec 64)) (v_DerPreprocessor_34 (_ BitVec 64)) (v_DerPreprocessor_17 (_ BitVec 64)) (v_DerPreprocessor_18 (_ BitVec 64)) (~slip_devs~0.offset (_ BitVec 64)) (v_DerPreprocessor_15 (_ BitVec 64)) (v_DerPreprocessor_16 (_ BitVec 64)) (v_DerPreprocessor_31 (_ BitVec 64)) (v_DerPreprocessor_10 (_ BitVec 64)) (v_DerPreprocessor_32 (_ BitVec 64)) (v_DerPreprocessor_30 (_ BitVec 64))) (bvsle ((_ extract 31 0) (let ((.cse3 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv543 64))) (.cse5 (bvadd (_ bv182 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse6 (bvadd (_ bv186 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse7 (bvadd (_ bv208 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse8 (bvadd (_ bv212 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse10 (bvadd ULTIMATE.start_slip_open_~tty.offset (_ bv1095 64))) (.cse12 (bvadd (_ bv4 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse14 (bvadd (bvmul ((_ sign_extend 32) c_ULTIMATE.start_sl_alloc_~i~2) (_ bv8 64)) ~slip_devs~0.offset)) (.cse15 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv180 64))) (.cse16 (bvadd (_ bv356 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse17 (bvadd (_ bv360 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse18 (bvadd (_ bv348 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse19 (bvadd (_ bv232 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse20 (bvadd (_ bv236 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse21 (bvadd (_ bv224 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)) (.cse22 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.offset (_ bv12 64)))) (let ((.cse0 (select (let ((.cse23 (let ((.cse24 (let ((.cse28 (let ((.cse29 (let ((.cse30 (store |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (let ((.cse33 (bvadd c_ULTIMATE.start_sl_alloc_~sl~11.base c_ULTIMATE.start_sl_alloc_~sl~11.offset))) (let ((.cse32 ((_ extract 63 32) .cse33))) (store (let ((.cse31 ((_ extract 31 0) .cse33))) (store (store (store (store (store (select |c_#memory_int| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 ((_ sign_extend 24) (_ bv8 8))) .cse16 .cse31) .cse17 .cse32) .cse18 v_DerPreprocessor_28) .cse19 .cse31)) .cse20 .cse32))) .cse21 v_DerPreprocessor_25)))) (store .cse30 c_~slip_devs~0.base (store (select .cse30 c_~slip_devs~0.base) .cse14 v_DerPreprocessor_24))))) (store .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse29 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 v_DerPreprocessor_21))))) (store .cse28 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse28 c_ULTIMATE.start_slip_open_~tty.base) .cse10 v_DerPreprocessor_20))))) (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base (let ((.cse25 (let ((.cse27 (store (select .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 |ULTIMATE.start_tty_devnum_#res|))) (store .cse27 .cse6 (select (select (store .cse24 c_ULTIMATE.start_sl_alloc_~sl~11.base .cse27) v_ULTIMATE.start_slip_open_~tmp___1~6.base_18) (bvadd v_ULTIMATE.start_slip_open_~tmp___1~6.offset_18 (_ bv1130 64))))))) (let ((.cse26 (bvadd ~jiffies~0 ((_ sign_extend 32) (bvmul ((_ zero_extend 24) ((_ extract 7 0) (select .cse25 (bvadd (_ bv190 64) c_ULTIMATE.start_sl_alloc_~sl~11.offset)))) (_ bv250 32)))))) (store (store .cse25 .cse7 ((_ extract 31 0) .cse26)) .cse8 ((_ extract 63 32) .cse26)))))))) (store .cse23 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse23 c_ULTIMATE.start_slip_open_~tty.base) .cse3 (_ bv65536 32)))) (select (select (let ((.cse34 (let ((.cse35 (let ((.cse36 (let ((.cse37 (let ((.cse38 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_33) .cse16 v_DerPreprocessor_29) .cse17 v_DerPreprocessor_30) .cse18 |#funAddr~sl_keepalive.base|) .cse19 v_DerPreprocessor_22) .cse20 v_DerPreprocessor_23) .cse21 |#funAddr~sl_outfill.base|)))) (store .cse38 c_~slip_devs~0.base (store (select .cse38 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.base))))) (store .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse37 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 c_ULTIMATE.start_slip_open_~tty.base))))) (store .cse36 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse36 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.base))))) (store .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse35 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_18) .cse6 v_DerPreprocessor_16) .cse7 v_DerPreprocessor_12) .cse8 v_DerPreprocessor_13))))) (store .cse34 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse34 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_10))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (.cse1 (select (select (let ((.cse2 (let ((.cse4 (let ((.cse9 (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (store (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse15 v_DerPreprocessor_34) .cse16 v_DerPreprocessor_31) .cse17 v_DerPreprocessor_32) .cse18 |#funAddr~sl_keepalive.offset|) .cse19 v_DerPreprocessor_26) .cse20 v_DerPreprocessor_27) .cse21 |#funAddr~sl_outfill.offset|)))) (store .cse13 c_~slip_devs~0.base (store (select .cse13 c_~slip_devs~0.base) .cse14 c_ULTIMATE.start_sl_alloc_~dev~3.offset))))) (store .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (select .cse11 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse12 ULTIMATE.start_slip_open_~tty.offset))))) (store .cse9 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse9 c_ULTIMATE.start_slip_open_~tty.base) .cse10 c_ULTIMATE.start_sl_alloc_~sl~11.offset))))) (store .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base (store (store (store (store (select .cse4 c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse5 v_DerPreprocessor_19) .cse6 v_DerPreprocessor_17) .cse7 v_DerPreprocessor_14) .cse8 v_DerPreprocessor_15))))) (store .cse2 c_ULTIMATE.start_slip_open_~tty.base (store (select .cse2 c_ULTIMATE.start_slip_open_~tty.base) .cse3 v_DerPreprocessor_11))) c_ULTIMATE.start_sl_alloc_~sl~11.base) .cse22))) (concat (select .cse0 (bvadd (_ bv116 64) .cse1)) (select .cse0 (bvadd (_ bv112 64) .cse1)))))) (_ bv0 32))) is different from true