./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.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 a521111bd175d3310336dcb5a96ef10ad6928036ed2148cdf12f5390a99f6bb7 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-23 04:09:12,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 04:09:12,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 04:09:12,829 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 04:09:12,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 04:09:12,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 04:09:12,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 04:09:12,833 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 04:09:12,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 04:09:12,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 04:09:12,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 04:09:12,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 04:09:12,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 04:09:12,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 04:09:12,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 04:09:12,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 04:09:12,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 04:09:12,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 04:09:12,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 04:09:12,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 04:09:12,855 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 04:09:12,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 04:09:12,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 04:09:12,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 04:09:12,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 04:09:12,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 04:09:12,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 04:09:12,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 04:09:12,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 04:09:12,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 04:09:12,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 04:09:12,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 04:09:12,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 04:09:12,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 04:09:12,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 04:09:12,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 04:09:12,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 04:09:12,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 04:09:12,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 04:09:12,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 04:09:12,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 04:09:12,866 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-23 04:09:12,880 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 04:09:12,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 04:09:12,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 04:09:12,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 04:09:12,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 04:09:12,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 04:09:12,882 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 04:09:12,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 04:09:12,882 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 04:09:12,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 04:09:12,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 04:09:12,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 04:09:12,883 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 04:09:12,883 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 04:09:12,883 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 04:09:12,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 04:09:12,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 04:09:12,884 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 04:09:12,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 04:09:12,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 04:09:12,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 04:09:12,885 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 04:09:12,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 04:09:12,886 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 04:09:12,886 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 -> a521111bd175d3310336dcb5a96ef10ad6928036ed2148cdf12f5390a99f6bb7 [2021-11-23 04:09:13,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 04:09:13,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 04:09:13,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 04:09:13,067 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 04:09:13,068 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 04:09:13,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i [2021-11-23 04:09:13,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bde23a4/22ffe141ac0a4a399a22c4854b6ce890/FLAG7e544d411 [2021-11-23 04:09:13,878 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 04:09:13,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i [2021-11-23 04:09:13,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bde23a4/22ffe141ac0a4a399a22c4854b6ce890/FLAG7e544d411 [2021-11-23 04:09:14,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02bde23a4/22ffe141ac0a4a399a22c4854b6ce890 [2021-11-23 04:09:14,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 04:09:14,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 04:09:14,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 04:09:14,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 04:09:14,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 04:09:14,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:14" (1/1) ... [2021-11-23 04:09:14,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70569ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:14, skipping insertion in model container [2021-11-23 04:09:14,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:14" (1/1) ... [2021-11-23 04:09:14,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 04:09:14,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 04:09:18,107 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599511,599524] [2021-11-23 04:09:18,110 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599658,599671] [2021-11-23 04:09:18,110 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599797,599810] [2021-11-23 04:09:18,111 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599955,599968] [2021-11-23 04:09:18,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 04:09:18,236 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 04:09:18,750 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599511,599524] [2021-11-23 04:09:18,751 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599658,599671] [2021-11-23 04:09:18,752 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599797,599810] [2021-11-23 04:09:18,752 WARN L230 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-challenges/linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i[599955,599968] [2021-11-23 04:09:18,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 04:09:18,937 INFO L208 MainTranslator]: Completed translation [2021-11-23 04:09:18,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18 WrapperNode [2021-11-23 04:09:18,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 04:09:18,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 04:09:18,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 04:09:18,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 04:09:18,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:19,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:19,930 INFO L137 Inliner]: procedures = 547, calls = 8792, calls flagged for inlining = 1222, calls inlined = 2943, statements flattened = 44440 [2021-11-23 04:09:19,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 04:09:19,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 04:09:19,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 04:09:19,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 04:09:19,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:19,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 04:09:20,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 04:09:20,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 04:09:20,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 04:09:20,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (1/1) ... [2021-11-23 04:09:20,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 04:09:20,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-23 04:09:20,997 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-23 04:09:21,044 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-23 04:09:21,055 INFO L130 BoogieDeclarations]: Found specification of procedure __put_user_bad [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure __get_user_bad [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-23 04:09:21,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 04:09:21,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-23 04:09:21,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-23 04:09:21,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-23 04:09:21,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 04:09:22,092 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 04:09:22,093 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 04:12:04,186 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11600-3: __copy_from_user_nocheck_#t~ret1083#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_nocheck_~tmp___2~10#1 := __copy_from_user_nocheck_#t~ret1083#1;havoc __copy_from_user_nocheck_#t~ret1083#1;__copy_from_user_nocheck_#res#1 := (if __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 else __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-23 04:12:04,187 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11600-5: __copy_to_user_nocheck_#t~ret1088#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_nocheck_~tmp___2~11#1 := __copy_to_user_nocheck_#t~ret1088#1;havoc __copy_to_user_nocheck_#t~ret1088#1;__copy_to_user_nocheck_#res#1 := (if __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 else __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-23 04:12:04,187 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11600-1: __copy_from_user_nocheck_#t~ret1083#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_from_user_nocheck_~tmp___2~10#1 := __copy_from_user_nocheck_#t~ret1083#1;havoc __copy_from_user_nocheck_#t~ret1083#1;__copy_from_user_nocheck_#res#1 := (if __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 else __copy_from_user_nocheck_~tmp___2~10#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-23 04:12:04,187 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11600-7: __copy_to_user_nocheck_#t~ret1088#1 := copy_user_generic_#res#1;assume { :end_inline_copy_user_generic } true;__copy_to_user_nocheck_~tmp___2~11#1 := __copy_to_user_nocheck_#t~ret1088#1;havoc __copy_to_user_nocheck_#t~ret1088#1;__copy_to_user_nocheck_#res#1 := (if __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 <= 2147483647 then __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 else __copy_to_user_nocheck_~tmp___2~11#1 % 18446744073709551616 % 4294967296 - 4294967296); [2021-11-23 04:12:04,187 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11619-1: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11619: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#1: ldv_switch_1_#res#1 := 0; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#1: ldv_switch_2_#res#1 := 0; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#2: ldv_switch_2_#res#1 := 0; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11622-1: assume 2 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11622-1: assume !(2 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11622: assume 2 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,188 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11622: assume !(2 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11623-1: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11623: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11626: assume 4 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11626: assume !(4 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11626-1: assume 4 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11626-1: assume !(4 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11627-1: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,189 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11627: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11630-1: assume 8 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11630-1: assume !(8 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11630: assume 8 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11630: assume !(8 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11631-1: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,190 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11631: __copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11634: assume 10 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11634: assume !(10 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11634-1: assume 10 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11634-1: assume !(10 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,191 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635-1: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_nocheck_~ret~17#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11635: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_nocheck_~ret~17#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11638-1: assume 16 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11638-1: assume !(16 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11638: assume 16 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11638: assume !(16 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,192 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11639-1: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_nocheck_~ret~17#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,195 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11639: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_from_user_nocheck_~ret~17#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,195 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642: assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_nocheck_~dst#1.base, __copy_from_user_nocheck_~dst#1.offset, __copy_from_user_nocheck_~src#1.base, __copy_from_user_nocheck_~src#1.offset, __copy_from_user_nocheck_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~16#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~16#1;copy_user_generic_#res#1 := copy_user_generic_~ret~16#1 % 4294967296; [2021-11-23 04:12:04,195 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11642-1: assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_from_user_nocheck_~dst#1.base, __copy_from_user_nocheck_~dst#1.offset, __copy_from_user_nocheck_~src#1.base, __copy_from_user_nocheck_~src#1.offset, __copy_from_user_nocheck_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~16#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~16#1;copy_user_generic_#res#1 := copy_user_generic_~ret~16#1 % 4294967296; [2021-11-23 04:12:04,195 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670-1: assume 0 != __copy_from_user_nocheck_~tmp___0~25#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,196 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670-1: assume !(0 != __copy_from_user_nocheck_~tmp___0~25#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,196 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670: assume 0 != __copy_from_user_nocheck_~tmp___0~25#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,199 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11670: assume !(0 != __copy_from_user_nocheck_~tmp___0~25#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,199 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11685-1: assume 0 != __copy_from_user_nocheck_~tmp___1~14#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,199 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11685-1: assume !(0 != __copy_from_user_nocheck_~tmp___1~14#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,199 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11685: assume 0 != __copy_from_user_nocheck_~tmp___1~14#1;__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,199 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11685: assume !(0 != __copy_from_user_nocheck_~tmp___1~14#1);__copy_from_user_nocheck_#res#1 := __copy_from_user_nocheck_~ret~17#1; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11728: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11728-1: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11731-1: assume 2 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11731-1: assume !(2 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11731: assume 2 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11731: assume !(2 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11732: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,200 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11732-1: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735-1: assume 4 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735-1: assume !(4 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735: assume 4 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11735: assume !(4 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11736: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11736-1: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739-1: assume 8 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739-1: assume !(8 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,201 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739: assume 8 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11739: assume !(8 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11740: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11740-1: __copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11743-1: assume 10 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11743-1: assume !(10 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11743: assume 10 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,202 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11743: assume !(10 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11744: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_nocheck_~ret~18#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11744-1: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_nocheck_~ret~18#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11747-1: assume 16 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11747-1: assume !(16 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11747: assume 16 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11747: assume !(16 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11748: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_nocheck_~ret~18#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,203 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11748-1: assume { :begin_inline_ldv__builtin_expect } true;ldv__builtin_expect_#in~exp#1, ldv__builtin_expect_#in~c#1 := (if 0 != __copy_to_user_nocheck_~ret~18#1 then 1 else 0), 0;havoc ldv__builtin_expect_#res#1;havoc ldv__builtin_expect_~exp#1, ldv__builtin_expect_~c#1;ldv__builtin_expect_~exp#1 := ldv__builtin_expect_#in~exp#1;ldv__builtin_expect_~c#1 := ldv__builtin_expect_#in~c#1;ldv__builtin_expect_#res#1 := ldv__builtin_expect_~exp#1; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11751-1: assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_nocheck_~dst#1.base, __copy_to_user_nocheck_~dst#1.offset, __copy_to_user_nocheck_~src#1.base, __copy_to_user_nocheck_~src#1.offset, __copy_to_user_nocheck_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~16#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~16#1;copy_user_generic_#res#1 := copy_user_generic_~ret~16#1 % 4294967296; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11751: assume { :begin_inline_copy_user_generic } true;copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset, copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset, copy_user_generic_#in~len#1 := __copy_to_user_nocheck_~dst#1.base, __copy_to_user_nocheck_~dst#1.offset, __copy_to_user_nocheck_~src#1.base, __copy_to_user_nocheck_~src#1.offset, __copy_to_user_nocheck_~size#1;havoc copy_user_generic_#res#1;havoc copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset, copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset, copy_user_generic_~len#1, copy_user_generic_~ret~16#1;copy_user_generic_~to#1.base, copy_user_generic_~to#1.offset := copy_user_generic_#in~to#1.base, copy_user_generic_#in~to#1.offset;copy_user_generic_~from#1.base, copy_user_generic_~from#1.offset := copy_user_generic_#in~from#1.base, copy_user_generic_#in~from#1.offset;copy_user_generic_~len#1 := copy_user_generic_#in~len#1;havoc copy_user_generic_~ret~16#1;copy_user_generic_#res#1 := copy_user_generic_~ret~16#1 % 4294967296; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774-1: assume 0 != __copy_to_user_nocheck_~tmp___0~26#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774-1: assume !(0 != __copy_to_user_nocheck_~tmp___0~26#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774: assume 0 != __copy_to_user_nocheck_~tmp___0~26#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,204 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11774: assume !(0 != __copy_to_user_nocheck_~tmp___0~26#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11788: assume 0 != __copy_to_user_nocheck_~tmp___1~15#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11788: assume !(0 != __copy_to_user_nocheck_~tmp___1~15#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11788-1: assume 0 != __copy_to_user_nocheck_~tmp___1~15#1;__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L11788-1: assume !(0 != __copy_to_user_nocheck_~tmp___1~15#1);__copy_to_user_nocheck_#res#1 := __copy_to_user_nocheck_~ret~18#1; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_4_switch_break#1: ldv_switch_4_#res#1 := 0; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#1: ldv_switch_0_#res#1 := 0; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#2: ldv_switch_0_#res#1 := 0; [2021-11-23 04:12:04,205 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_3_switch_break#1: ldv_switch_3_#res#1 := 0; [2021-11-23 04:12:04,206 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5990: assume 1 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,206 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5991: assume !(1 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,206 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-23 04:12:04,207 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6073: assume 1 == __copy_from_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,207 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6074: assume !(1 == __copy_from_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,223 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6228: assume !(1 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,223 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6227: assume 1 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,223 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6176: assume 1 == __copy_to_user_nocheck_~size#1 % 4294967296; [2021-11-23 04:12:04,224 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6177: assume !(1 == __copy_to_user_nocheck_~size#1 % 4294967296); [2021-11-23 04:12:04,224 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-5: __copy_from_user_nocheck_#t~ret1081#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret1081#1 && __copy_from_user_nocheck_#t~ret1081#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___0~25#1 := __copy_from_user_nocheck_#t~ret1081#1;havoc __copy_from_user_nocheck_#t~ret1081#1; [2021-11-23 04:12:04,224 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-6: __copy_from_user_nocheck_#t~ret1082#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret1082#1 && __copy_from_user_nocheck_#t~ret1082#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___1~14#1 := __copy_from_user_nocheck_#t~ret1082#1;havoc __copy_from_user_nocheck_#t~ret1082#1; [2021-11-23 04:12:04,224 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-17: __copy_to_user_nocheck_#t~ret1087#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret1087#1 && __copy_to_user_nocheck_#t~ret1087#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___1~15#1 := __copy_to_user_nocheck_#t~ret1087#1;havoc __copy_to_user_nocheck_#t~ret1087#1; [2021-11-23 04:12:04,225 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-16: __copy_to_user_nocheck_#t~ret1086#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret1086#1 && __copy_to_user_nocheck_#t~ret1086#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___0~26#1 := __copy_to_user_nocheck_#t~ret1086#1;havoc __copy_to_user_nocheck_#t~ret1086#1; [2021-11-23 04:12:04,225 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-9: __copy_from_user_nocheck_#t~ret1081#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret1081#1 && __copy_from_user_nocheck_#t~ret1081#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___0~25#1 := __copy_from_user_nocheck_#t~ret1081#1;havoc __copy_from_user_nocheck_#t~ret1081#1; [2021-11-23 04:12:04,225 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-10: __copy_from_user_nocheck_#t~ret1082#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_from_user_nocheck_#t~ret1082#1 && __copy_from_user_nocheck_#t~ret1082#1 <= 9223372036854775807;__copy_from_user_nocheck_~tmp___1~14#1 := __copy_from_user_nocheck_#t~ret1082#1;havoc __copy_from_user_nocheck_#t~ret1082#1; [2021-11-23 04:12:04,225 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-13: __copy_to_user_nocheck_#t~ret1086#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret1086#1 && __copy_to_user_nocheck_#t~ret1086#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___0~26#1 := __copy_to_user_nocheck_#t~ret1086#1;havoc __copy_to_user_nocheck_#t~ret1086#1; [2021-11-23 04:12:04,225 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint L20889-14: __copy_to_user_nocheck_#t~ret1087#1 := ldv__builtin_expect_#res#1;assume { :end_inline_ldv__builtin_expect } true;assume -9223372036854775808 <= __copy_to_user_nocheck_#t~ret1087#1 && __copy_to_user_nocheck_#t~ret1087#1 <= 9223372036854775807;__copy_to_user_nocheck_~tmp___1~15#1 := __copy_to_user_nocheck_#t~ret1087#1;havoc __copy_to_user_nocheck_#t~ret1087#1; [2021-11-23 04:12:04,226 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 04:12:04,261 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 04:12:04,261 INFO L301 CfgBuilder]: Removed 15 assume(true) statements. [2021-11-23 04:12:04,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:04 BoogieIcfgContainer [2021-11-23 04:12:04,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 04:12:04,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 04:12:04,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 04:12:04,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 04:12:04,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:09:14" (1/3) ... [2021-11-23 04:12:04,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c97e0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:04, skipping insertion in model container [2021-11-23 04:12:04,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:18" (2/3) ... [2021-11-23 04:12:04,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c97e0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:12:04, skipping insertion in model container [2021-11-23 04:12:04,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:12:04" (3/3) ... [2021-11-23 04:12:04,275 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-usb-dev_drivers-media-usb-uvc-uvcvideo.cil.i [2021-11-23 04:12:04,279 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 04:12:04,280 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2021-11-23 04:12:04,339 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 04:12:04,343 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-23 04:12:04,343 INFO L340 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-11-23 04:12:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 7400 states, 7390 states have (on average 1.3677943166441138) internal successors, (10108), 7399 states have internal predecessors, (10108), 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-23 04:12:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-23 04:12:04,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:04,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:04,433 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:04,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2131676949, now seen corresponding path program 1 times [2021-11-23 04:12:04,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:04,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298848548] [2021-11-23 04:12:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:04,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:05,363 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-23 04:12:05,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:05,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298848548] [2021-11-23 04:12:05,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298848548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:05,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:05,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:05,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791701639] [2021-11-23 04:12:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:05,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:05,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:05,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:05,402 INFO L87 Difference]: Start difference. First operand has 7400 states, 7390 states have (on average 1.3677943166441138) internal successors, (10108), 7399 states have internal predecessors, (10108), 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 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-23 04:12:07,570 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:08,048 INFO L93 Difference]: Finished difference Result 21346 states and 29237 transitions. [2021-11-23 04:12:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2021-11-23 04:12:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:08,105 INFO L225 Difference]: With dead ends: 21346 [2021-11-23 04:12:08,105 INFO L226 Difference]: Without dead ends: 13661 [2021-11-23 04:12:08,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:08,126 INFO L933 BasicCegarLoop]: 10006 mSDtfsCounter, 9436 mSDsluCounter, 9905 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9436 SdHoareTripleChecker+Valid, 19911 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:08,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9436 Valid, 19911 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 04:12:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2021-11-23 04:12:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 13647. [2021-11-23 04:12:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13647 states, 13637 states have (on average 1.3354843440639437) internal successors, (18212), 13646 states have internal predecessors, (18212), 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-23 04:12:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13647 states to 13647 states and 18212 transitions. [2021-11-23 04:12:08,437 INFO L78 Accepts]: Start accepts. Automaton has 13647 states and 18212 transitions. Word has length 119 [2021-11-23 04:12:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:08,437 INFO L470 AbstractCegarLoop]: Abstraction has 13647 states and 18212 transitions. [2021-11-23 04:12:08,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-23 04:12:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 13647 states and 18212 transitions. [2021-11-23 04:12:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-11-23 04:12:08,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:08,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:08,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 04:12:08,446 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2144623915, now seen corresponding path program 1 times [2021-11-23 04:12:08,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:08,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616425885] [2021-11-23 04:12:08,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:08,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:08,946 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-23 04:12:08,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:08,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616425885] [2021-11-23 04:12:08,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616425885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:08,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:08,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:08,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844205974] [2021-11-23 04:12:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:08,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:08,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:08,951 INFO L87 Difference]: Start difference. First operand 13647 states and 18212 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-23 04:12:11,096 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:11,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:11,510 INFO L93 Difference]: Finished difference Result 30527 states and 40727 transitions. [2021-11-23 04:12:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:11,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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 138 [2021-11-23 04:12:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:11,580 INFO L225 Difference]: With dead ends: 30527 [2021-11-23 04:12:11,581 INFO L226 Difference]: Without dead ends: 17133 [2021-11-23 04:12:11,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:11,606 INFO L933 BasicCegarLoop]: 9328 mSDtfsCounter, 2361 mSDsluCounter, 9298 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 18626 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:11,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2361 Valid, 18626 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 04:12:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17133 states. [2021-11-23 04:12:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17133 to 17079. [2021-11-23 04:12:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17079 states, 17069 states have (on average 1.3313023610053314) internal successors, (22724), 17078 states have internal predecessors, (22724), 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-23 04:12:12,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17079 states to 17079 states and 22724 transitions. [2021-11-23 04:12:12,316 INFO L78 Accepts]: Start accepts. Automaton has 17079 states and 22724 transitions. Word has length 138 [2021-11-23 04:12:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:12,318 INFO L470 AbstractCegarLoop]: Abstraction has 17079 states and 22724 transitions. [2021-11-23 04:12:12,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-23 04:12:12,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17079 states and 22724 transitions. [2021-11-23 04:12:12,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-11-23 04:12:12,332 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:12,333 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:12,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 04:12:12,333 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1449529373, now seen corresponding path program 1 times [2021-11-23 04:12:12,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:12,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069613440] [2021-11-23 04:12:12,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:12,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:12:12,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069613440] [2021-11-23 04:12:12,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069613440] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:12,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:12,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:12,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883730664] [2021-11-23 04:12:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:12,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:12,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:12,895 INFO L87 Difference]: Start difference. First operand 17079 states and 22724 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-23 04:12:15,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:15,502 INFO L93 Difference]: Finished difference Result 35807 states and 47637 transitions. [2021-11-23 04:12:15,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2021-11-23 04:12:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:15,548 INFO L225 Difference]: With dead ends: 35807 [2021-11-23 04:12:15,548 INFO L226 Difference]: Without dead ends: 18981 [2021-11-23 04:12:15,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:15,583 INFO L933 BasicCegarLoop]: 16013 mSDtfsCounter, 9027 mSDsluCounter, 9298 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9027 SdHoareTripleChecker+Valid, 25311 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:15,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9027 Valid, 25311 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 04:12:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18981 states. [2021-11-23 04:12:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18981 to 18941. [2021-11-23 04:12:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18941 states, 18931 states have (on average 1.328825735566003) internal successors, (25156), 18940 states have internal predecessors, (25156), 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-23 04:12:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18941 states to 18941 states and 25156 transitions. [2021-11-23 04:12:15,948 INFO L78 Accepts]: Start accepts. Automaton has 18941 states and 25156 transitions. Word has length 157 [2021-11-23 04:12:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:15,949 INFO L470 AbstractCegarLoop]: Abstraction has 18941 states and 25156 transitions. [2021-11-23 04:12:15,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-23 04:12:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 18941 states and 25156 transitions. [2021-11-23 04:12:15,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 04:12:15,956 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:15,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:15,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 04:12:15,957 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1239928043, now seen corresponding path program 1 times [2021-11-23 04:12:15,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:15,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806488496] [2021-11-23 04:12:15,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:15,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:12:16,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:16,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806488496] [2021-11-23 04:12:16,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806488496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:16,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:16,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:16,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140451026] [2021-11-23 04:12:16,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:16,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:16,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:16,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:16,470 INFO L87 Difference]: Start difference. First operand 18941 states and 25156 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-23 04:12:18,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:19,144 INFO L93 Difference]: Finished difference Result 52515 states and 70007 transitions. [2021-11-23 04:12:19,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:19,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2021-11-23 04:12:19,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:19,217 INFO L225 Difference]: With dead ends: 52515 [2021-11-23 04:12:19,217 INFO L226 Difference]: Without dead ends: 35487 [2021-11-23 04:12:19,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:19,250 INFO L933 BasicCegarLoop]: 11507 mSDtfsCounter, 8876 mSDsluCounter, 9285 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8876 SdHoareTripleChecker+Valid, 20792 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:19,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8876 Valid, 20792 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 04:12:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35487 states. [2021-11-23 04:12:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35487 to 35473. [2021-11-23 04:12:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35473 states, 35463 states have (on average 1.3324309844062827) internal successors, (47252), 35472 states have internal predecessors, (47252), 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-23 04:12:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35473 states to 35473 states and 47252 transitions. [2021-11-23 04:12:20,102 INFO L78 Accepts]: Start accepts. Automaton has 35473 states and 47252 transitions. Word has length 171 [2021-11-23 04:12:20,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:20,103 INFO L470 AbstractCegarLoop]: Abstraction has 35473 states and 47252 transitions. [2021-11-23 04:12:20,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-23 04:12:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 35473 states and 47252 transitions. [2021-11-23 04:12:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-11-23 04:12:20,110 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:20,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:20,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 04:12:20,111 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:20,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:20,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1249600919, now seen corresponding path program 1 times [2021-11-23 04:12:20,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288015735] [2021-11-23 04:12:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:20,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 04:12:20,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:20,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288015735] [2021-11-23 04:12:20,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288015735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:20,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:20,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:20,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904125423] [2021-11-23 04:12:20,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:20,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:20,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:20,515 INFO L87 Difference]: Start difference. First operand 35473 states and 47252 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-23 04:12:22,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:23,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:23,589 INFO L93 Difference]: Finished difference Result 85583 states and 114207 transitions. [2021-11-23 04:12:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:23,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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 171 [2021-11-23 04:12:23,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:23,735 INFO L225 Difference]: With dead ends: 85583 [2021-11-23 04:12:23,735 INFO L226 Difference]: Without dead ends: 52023 [2021-11-23 04:12:23,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:23,803 INFO L933 BasicCegarLoop]: 18202 mSDtfsCounter, 8878 mSDsluCounter, 9284 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8878 SdHoareTripleChecker+Valid, 27486 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:23,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8878 Valid, 27486 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-11-23 04:12:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52023 states. [2021-11-23 04:12:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52023 to 51958. [2021-11-23 04:12:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51958 states, 51948 states have (on average 1.334045584045584) internal successors, (69301), 51957 states have internal predecessors, (69301), 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-23 04:12:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51958 states to 51958 states and 69301 transitions. [2021-11-23 04:12:25,217 INFO L78 Accepts]: Start accepts. Automaton has 51958 states and 69301 transitions. Word has length 171 [2021-11-23 04:12:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:25,218 INFO L470 AbstractCegarLoop]: Abstraction has 51958 states and 69301 transitions. [2021-11-23 04:12:25,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-23 04:12:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 51958 states and 69301 transitions. [2021-11-23 04:12:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-11-23 04:12:25,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:25,226 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:25,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 04:12:25,227 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1153468732, now seen corresponding path program 1 times [2021-11-23 04:12:25,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:25,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963944738] [2021-11-23 04:12:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:25,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 04:12:25,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:25,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963944738] [2021-11-23 04:12:25,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963944738] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:25,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:25,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:12:25,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110247748] [2021-11-23 04:12:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:25,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:12:25,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:12:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:12:25,893 INFO L87 Difference]: Start difference. First operand 51958 states and 69301 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-23 04:12:27,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:27,370 INFO L93 Difference]: Finished difference Result 152042 states and 202964 transitions. [2021-11-23 04:12:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 04:12:27,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 175 [2021-11-23 04:12:27,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:27,731 INFO L225 Difference]: With dead ends: 152042 [2021-11-23 04:12:27,732 INFO L226 Difference]: Without dead ends: 100165 [2021-11-23 04:12:27,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:12:27,799 INFO L933 BasicCegarLoop]: 9327 mSDtfsCounter, 9174 mSDsluCounter, 18362 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9174 SdHoareTripleChecker+Valid, 27689 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:27,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9174 Valid, 27689 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 04:12:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100165 states. [2021-11-23 04:12:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100165 to 100145. [2021-11-23 04:12:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100145 states, 100135 states have (on average 1.3349877665152046) internal successors, (133679), 100144 states have internal predecessors, (133679), 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-23 04:12:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100145 states to 100145 states and 133679 transitions. [2021-11-23 04:12:29,977 INFO L78 Accepts]: Start accepts. Automaton has 100145 states and 133679 transitions. Word has length 175 [2021-11-23 04:12:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:29,978 INFO L470 AbstractCegarLoop]: Abstraction has 100145 states and 133679 transitions. [2021-11-23 04:12:29,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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-23 04:12:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100145 states and 133679 transitions. [2021-11-23 04:12:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-11-23 04:12:30,036 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:30,036 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:30,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 04:12:30,036 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:30,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:30,037 INFO L85 PathProgramCache]: Analyzing trace with hash 576141977, now seen corresponding path program 1 times [2021-11-23 04:12:30,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:30,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122752800] [2021-11-23 04:12:30,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:30,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-23 04:12:30,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122752800] [2021-11-23 04:12:30,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122752800] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:30,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:30,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:30,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238211984] [2021-11-23 04:12:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:30,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:30,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:30,574 INFO L87 Difference]: Start difference. First operand 100145 states and 133679 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-23 04:12:32,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-23 04:12:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:35,139 INFO L93 Difference]: Finished difference Result 218729 states and 291761 transitions. [2021-11-23 04:12:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 213 [2021-11-23 04:12:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:35,393 INFO L225 Difference]: With dead ends: 218729 [2021-11-23 04:12:35,393 INFO L226 Difference]: Without dead ends: 120497 [2021-11-23 04:12:35,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:35,519 INFO L933 BasicCegarLoop]: 11698 mSDtfsCounter, 4555 mSDsluCounter, 7099 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4555 SdHoareTripleChecker+Valid, 18797 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:35,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4555 Valid, 18797 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-23 04:12:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120497 states. [2021-11-23 04:12:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120497 to 120405. [2021-11-23 04:12:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120405 states, 120395 states have (on average 1.3317828813488932) internal successors, (160340), 120404 states have internal predecessors, (160340), 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-23 04:12:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120405 states to 120405 states and 160340 transitions. [2021-11-23 04:12:38,248 INFO L78 Accepts]: Start accepts. Automaton has 120405 states and 160340 transitions. Word has length 213 [2021-11-23 04:12:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:38,249 INFO L470 AbstractCegarLoop]: Abstraction has 120405 states and 160340 transitions. [2021-11-23 04:12:38,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-23 04:12:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 120405 states and 160340 transitions. [2021-11-23 04:12:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-23 04:12:38,279 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:38,279 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:38,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 04:12:38,280 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 522529223, now seen corresponding path program 1 times [2021-11-23 04:12:38,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:38,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906087586] [2021-11-23 04:12:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:38,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 04:12:39,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:39,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906087586] [2021-11-23 04:12:39,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906087586] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:39,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:39,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 04:12:39,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086414488] [2021-11-23 04:12:39,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:39,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 04:12:39,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:39,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 04:12:39,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:39,081 INFO L87 Difference]: Start difference. First operand 120405 states and 160340 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-23 04:12:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:41,252 INFO L93 Difference]: Finished difference Result 238909 states and 318236 transitions. [2021-11-23 04:12:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 04:12:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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 232 [2021-11-23 04:12:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:41,564 INFO L225 Difference]: With dead ends: 238909 [2021-11-23 04:12:41,564 INFO L226 Difference]: Without dead ends: 120417 [2021-11-23 04:12:41,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 04:12:41,702 INFO L933 BasicCegarLoop]: 9340 mSDtfsCounter, 0 mSDsluCounter, 9335 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18675 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:41,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18675 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 04:12:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120417 states. [2021-11-23 04:12:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120417 to 120417. [2021-11-23 04:12:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120417 states, 120407 states have (on average 1.331749815210079) internal successors, (160352), 120416 states have internal predecessors, (160352), 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-23 04:12:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120417 states to 120417 states and 160352 transitions. [2021-11-23 04:12:44,441 INFO L78 Accepts]: Start accepts. Automaton has 120417 states and 160352 transitions. Word has length 232 [2021-11-23 04:12:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:44,441 INFO L470 AbstractCegarLoop]: Abstraction has 120417 states and 160352 transitions. [2021-11-23 04:12:44,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-23 04:12:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 120417 states and 160352 transitions. [2021-11-23 04:12:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2021-11-23 04:12:44,471 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:44,471 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:44,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-23 04:12:44,472 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1948697733, now seen corresponding path program 1 times [2021-11-23 04:12:44,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060219898] [2021-11-23 04:12:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:44,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:45,408 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 04:12:45,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:45,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060219898] [2021-11-23 04:12:45,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060219898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:45,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:45,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:12:45,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256572561] [2021-11-23 04:12:45,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:45,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:12:45,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:45,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:12:45,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:12:45,411 INFO L87 Difference]: Start difference. First operand 120417 states and 160352 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-23 04:12:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 04:12:48,787 INFO L93 Difference]: Finished difference Result 238933 states and 318224 transitions. [2021-11-23 04:12:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 04:12:48,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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 232 [2021-11-23 04:12:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 04:12:49,425 INFO L225 Difference]: With dead ends: 238933 [2021-11-23 04:12:49,425 INFO L226 Difference]: Without dead ends: 238931 [2021-11-23 04:12:49,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-23 04:12:49,514 INFO L933 BasicCegarLoop]: 18371 mSDtfsCounter, 27124 mSDsluCounter, 27399 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27124 SdHoareTripleChecker+Valid, 45770 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-23 04:12:49,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27124 Valid, 45770 Invalid, 78 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 04:12:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238931 states. [2021-11-23 04:12:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238931 to 120417. [2021-11-23 04:12:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120417 states, 120407 states have (on average 1.3316999842201864) internal successors, (160346), 120416 states have internal predecessors, (160346), 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-23 04:12:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120417 states to 120417 states and 160346 transitions. [2021-11-23 04:12:53,411 INFO L78 Accepts]: Start accepts. Automaton has 120417 states and 160346 transitions. Word has length 232 [2021-11-23 04:12:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 04:12:53,411 INFO L470 AbstractCegarLoop]: Abstraction has 120417 states and 160346 transitions. [2021-11-23 04:12:53,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-23 04:12:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 120417 states and 160346 transitions. [2021-11-23 04:12:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2021-11-23 04:12:53,442 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 04:12:53,442 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 04:12:53,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 04:12:53,443 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2021-11-23 04:12:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 04:12:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1277729890, now seen corresponding path program 1 times [2021-11-23 04:12:53,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 04:12:53,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210020661] [2021-11-23 04:12:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 04:12:53,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 04:12:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 04:12:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 04:12:54,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 04:12:54,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210020661] [2021-11-23 04:12:54,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210020661] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 04:12:54,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 04:12:54,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 04:12:54,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335788913] [2021-11-23 04:12:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 04:12:54,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 04:12:54,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 04:12:54,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 04:12:54,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 04:12:54,160 INFO L87 Difference]: Start difference. First operand 120417 states and 160346 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 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)