/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:29:54,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:29:54,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:29:54,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:29:54,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:29:54,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:29:54,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:29:55,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:29:55,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:29:55,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:29:55,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:29:55,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:29:55,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:29:55,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:29:55,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:29:55,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:29:55,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:29:55,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:29:55,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:29:55,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:29:55,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:29:55,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:29:55,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:29:55,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:29:55,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:29:55,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:29:55,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:29:55,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:29:55,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:29:55,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:29:55,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:29:55,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:29:55,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:29:55,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:29:55,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:29:55,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:29:55,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:29:55,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:29:55,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:29:55,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:29:55,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:29:55,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:29:55,108 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:29:55,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:29:55,109 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:29:55,109 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:29:55,110 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:29:55,110 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:29:55,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:29:55,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:29:55,112 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:29:55,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:29:55,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:29:55,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:29:55,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:29:55,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:29:55,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:29:55,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:29:55,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:29:55,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:29:55,115 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:29:55,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:29:55,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:29:55,115 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:29:55,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:29:55,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:29:55,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:29:55,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:29:55,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:29:55,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:29:55,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:29:55,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:29:55,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:29:55,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:29:55,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:29:55,119 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 [2022-10-16 12:29:55,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:29:55,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:29:55,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:29:55,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:29:55,506 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:29:55,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-10-16 12:29:55,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb5355dc/d1a07d7688804e27b939da0bec475f36/FLAGdc9752ea2 [2022-10-16 12:29:56,558 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:29:56,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-10-16 12:29:56,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb5355dc/d1a07d7688804e27b939da0bec475f36/FLAGdc9752ea2 [2022-10-16 12:29:57,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb5355dc/d1a07d7688804e27b939da0bec475f36 [2022-10-16 12:29:57,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:29:57,076 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:29:57,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:29:57,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:29:57,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:29:57,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:29:57" (1/1) ... [2022-10-16 12:29:57,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670dcd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:57, skipping insertion in model container [2022-10-16 12:29:57,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:29:57" (1/1) ... [2022-10-16 12:29:57,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:29:57,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:29:58,714 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-10-16 12:29:58,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:29:58,755 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:29:59,149 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i[202861,202874] [2022-10-16 12:29:59,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:29:59,314 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:29:59,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59 WrapperNode [2022-10-16 12:29:59,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:29:59,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:29:59,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:29:59,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:29:59,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,556 INFO L138 Inliner]: procedures = 157, calls = 812, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2866 [2022-10-16 12:29:59,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:29:59,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:29:59,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:29:59,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:29:59,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:29:59,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:29:59,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:29:59,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:29:59,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (1/1) ... [2022-10-16 12:29:59,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:29:59,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:29:59,839 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) [2022-10-16 12:29:59,861 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 [2022-10-16 12:29:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 12:29:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-10-16 12:29:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 12:29:59,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 12:29:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:29:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-10-16 12:29:59,899 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-10-16 12:29:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-10-16 12:29:59,899 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-10-16 12:29:59,899 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-10-16 12:29:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-10-16 12:29:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-16 12:29:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-16 12:29:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-10-16 12:29:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-10-16 12:29:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 12:29:59,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 12:29:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-10-16 12:29:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-10-16 12:29:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-10-16 12:29:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-10-16 12:29:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-10-16 12:29:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-10-16 12:29:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 12:29:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 12:29:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-10-16 12:29:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-10-16 12:29:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:29:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-10-16 12:29:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-10-16 12:29:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-10-16 12:29:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-10-16 12:29:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-10-16 12:29:59,903 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-10-16 12:29:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 12:29:59,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 12:29:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-10-16 12:29:59,903 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-10-16 12:29:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-10-16 12:29:59,904 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-10-16 12:29:59,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 12:29:59,904 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-10-16 12:29:59,904 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-10-16 12:29:59,904 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-10-16 12:29:59,904 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-10-16 12:29:59,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:29:59,905 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-10-16 12:29:59,905 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-10-16 12:29:59,905 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-10-16 12:29:59,905 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-10-16 12:29:59,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:29:59,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 12:29:59,905 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-10-16 12:29:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-10-16 12:29:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-10-16 12:29:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 12:29:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-10-16 12:29:59,906 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-10-16 12:29:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-10-16 12:29:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-10-16 12:29:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-10-16 12:29:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-10-16 12:29:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-10-16 12:29:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-10-16 12:29:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-10-16 12:29:59,907 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-10-16 12:29:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:29:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-10-16 12:29:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-10-16 12:29:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 12:29:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-10-16 12:29:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-10-16 12:29:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-10-16 12:29:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-10-16 12:29:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-16 12:29:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-16 12:29:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-10-16 12:29:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-10-16 12:29:59,909 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-10-16 12:29:59,909 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-10-16 12:29:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-10-16 12:29:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-10-16 12:29:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-10-16 12:29:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-10-16 12:29:59,910 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-10-16 12:29:59,910 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-10-16 12:29:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-10-16 12:29:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-10-16 12:29:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:29:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-10-16 12:29:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-10-16 12:29:59,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-10-16 12:29:59,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-10-16 12:29:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-10-16 12:29:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-10-16 12:29:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-10-16 12:29:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-10-16 12:29:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 12:29:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:29:59,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:29:59,912 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-10-16 12:29:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-10-16 12:29:59,913 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-10-16 12:29:59,913 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-10-16 12:30:00,402 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:30:00,407 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:30:03,479 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:30:03,496 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:30:03,497 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 12:30:03,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:03 BoogieIcfgContainer [2022-10-16 12:30:03,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:30:03,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:30:03,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:30:03,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:30:03,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:29:57" (1/3) ... [2022-10-16 12:30:03,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f909429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:03, skipping insertion in model container [2022-10-16 12:30:03,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:29:59" (2/3) ... [2022-10-16 12:30:03,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f909429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:03, skipping insertion in model container [2022-10-16 12:30:03,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:03" (3/3) ... [2022-10-16 12:30:03,510 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac-1.i [2022-10-16 12:30:03,531 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:30:03,531 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-10-16 12:30:03,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:30:03,625 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@379d7c89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:30:03,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-10-16 12:30:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 1124 states, 793 states have (on average 1.4918032786885247) internal successors, (1183), 899 states have internal predecessors, (1183), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-10-16 12:30:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 12:30:03,648 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:03,649 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:03,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1008385009, now seen corresponding path program 1 times [2022-10-16 12:30:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:03,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955531126] [2022-10-16 12:30:03,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 12:30:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:04,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:04,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955531126] [2022-10-16 12:30:04,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955531126] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:04,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:04,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:04,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724602957] [2022-10-16 12:30:04,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:04,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:04,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:04,429 INFO L87 Difference]: Start difference. First operand has 1124 states, 793 states have (on average 1.4918032786885247) internal successors, (1183), 899 states have internal predecessors, (1183), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 12:30:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:05,627 INFO L93 Difference]: Finished difference Result 2240 states and 3237 transitions. [2022-10-16 12:30:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-10-16 12:30:05,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:05,678 INFO L225 Difference]: With dead ends: 2240 [2022-10-16 12:30:05,678 INFO L226 Difference]: Without dead ends: 1107 [2022-10-16 12:30:05,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:05,715 INFO L413 NwaCegarLoop]: 1507 mSDtfsCounter, 1729 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1863 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:05,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1863 Valid, 2240 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 12:30:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-10-16 12:30:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1089. [2022-10-16 12:30:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 782 states have (on average 1.4565217391304348) internal successors, (1139), 865 states have internal predecessors, (1139), 206 states have call successors, (206), 43 states have call predecessors, (206), 43 states have return successors, (206), 204 states have call predecessors, (206), 206 states have call successors, (206) [2022-10-16 12:30:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1551 transitions. [2022-10-16 12:30:05,909 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1551 transitions. Word has length 48 [2022-10-16 12:30:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:05,910 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 1551 transitions. [2022-10-16 12:30:05,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 12:30:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1551 transitions. [2022-10-16 12:30:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 12:30:05,922 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:05,922 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:30:05,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -985752755, now seen corresponding path program 1 times [2022-10-16 12:30:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:05,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724122554] [2022-10-16 12:30:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 12:30:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:06,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:06,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724122554] [2022-10-16 12:30:06,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724122554] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:06,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:06,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104978932] [2022-10-16 12:30:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:06,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:06,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:06,208 INFO L87 Difference]: Start difference. First operand 1089 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 12:30:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:07,985 INFO L93 Difference]: Finished difference Result 2179 states and 3110 transitions. [2022-10-16 12:30:07,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:30:07,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-10-16 12:30:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:07,996 INFO L225 Difference]: With dead ends: 2179 [2022-10-16 12:30:07,997 INFO L226 Difference]: Without dead ends: 1107 [2022-10-16 12:30:08,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:08,003 INFO L413 NwaCegarLoop]: 1500 mSDtfsCounter, 386 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 4177 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:08,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 4177 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 12:30:08,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-10-16 12:30:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1089. [2022-10-16 12:30:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 782 states have (on average 1.4552429667519182) internal successors, (1138), 865 states have internal predecessors, (1138), 206 states have call successors, (206), 43 states have call predecessors, (206), 43 states have return successors, (206), 204 states have call predecessors, (206), 206 states have call successors, (206) [2022-10-16 12:30:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1550 transitions. [2022-10-16 12:30:08,074 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1550 transitions. Word has length 48 [2022-10-16 12:30:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:08,074 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 1550 transitions. [2022-10-16 12:30:08,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 12:30:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1550 transitions. [2022-10-16 12:30:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 12:30:08,077 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:08,077 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:08,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:30:08,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:08,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash 461179900, now seen corresponding path program 1 times [2022-10-16 12:30:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:08,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90767788] [2022-10-16 12:30:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:08,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:08,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:08,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90767788] [2022-10-16 12:30:08,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90767788] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:08,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:08,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:08,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537588290] [2022-10-16 12:30:08,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:08,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:08,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:08,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:08,303 INFO L87 Difference]: Start difference. First operand 1089 states and 1550 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 12:30:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:10,135 INFO L93 Difference]: Finished difference Result 1189 states and 1687 transitions. [2022-10-16 12:30:10,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:30:10,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 51 [2022-10-16 12:30:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:10,146 INFO L225 Difference]: With dead ends: 1189 [2022-10-16 12:30:10,146 INFO L226 Difference]: Without dead ends: 1133 [2022-10-16 12:30:10,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:10,149 INFO L413 NwaCegarLoop]: 1490 mSDtfsCounter, 1707 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:10,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 2977 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-10-16 12:30:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-10-16 12:30:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1113. [2022-10-16 12:30:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 800 states have (on average 1.4525) internal successors, (1162), 885 states have internal predecessors, (1162), 212 states have call successors, (212), 43 states have call predecessors, (212), 43 states have return successors, (212), 210 states have call predecessors, (212), 212 states have call successors, (212) [2022-10-16 12:30:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1586 transitions. [2022-10-16 12:30:10,227 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1586 transitions. Word has length 51 [2022-10-16 12:30:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:10,228 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1586 transitions. [2022-10-16 12:30:10,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 12:30:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1586 transitions. [2022-10-16 12:30:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 12:30:10,230 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:10,231 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:10,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:30:10,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:10,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash -165325051, now seen corresponding path program 1 times [2022-10-16 12:30:10,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:10,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980683460] [2022-10-16 12:30:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 12:30:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:10,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980683460] [2022-10-16 12:30:10,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980683460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:10,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:10,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:10,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084692463] [2022-10-16 12:30:10,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:10,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:10,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:10,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:10,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:10,420 INFO L87 Difference]: Start difference. First operand 1113 states and 1586 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:12,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:14,372 INFO L93 Difference]: Finished difference Result 1254 states and 1782 transitions. [2022-10-16 12:30:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:14,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2022-10-16 12:30:14,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:14,386 INFO L225 Difference]: With dead ends: 1254 [2022-10-16 12:30:14,386 INFO L226 Difference]: Without dead ends: 1174 [2022-10-16 12:30:14,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:14,398 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 409 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 220 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:14,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 4150 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1448 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-10-16 12:30:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-10-16 12:30:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1132. [2022-10-16 12:30:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 815 states have (on average 1.4478527607361964) internal successors, (1180), 901 states have internal predecessors, (1180), 216 states have call successors, (216), 43 states have call predecessors, (216), 43 states have return successors, (216), 214 states have call predecessors, (216), 216 states have call successors, (216) [2022-10-16 12:30:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1612 transitions. [2022-10-16 12:30:14,473 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1612 transitions. Word has length 56 [2022-10-16 12:30:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:14,473 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1612 transitions. [2022-10-16 12:30:14,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:14,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1612 transitions. [2022-10-16 12:30:14,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 12:30:14,476 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:14,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 12:30:14,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:30:14,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:14,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -830202508, now seen corresponding path program 1 times [2022-10-16 12:30:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:14,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445707162] [2022-10-16 12:30:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:14,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:14,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:14,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445707162] [2022-10-16 12:30:14,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445707162] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:30:14,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144881452] [2022-10-16 12:30:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:14,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:30:14,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:30:14,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 12:30:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:15,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:30:15,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:30:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:15,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:30:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:15,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144881452] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:30:15,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:30:15,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-16 12:30:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124953641] [2022-10-16 12:30:15,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:30:15,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 12:30:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:15,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 12:30:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 12:30:15,159 INFO L87 Difference]: Start difference. First operand 1132 states and 1612 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:17,554 INFO L93 Difference]: Finished difference Result 1299 states and 1865 transitions. [2022-10-16 12:30:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 12:30:17,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-10-16 12:30:17,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:17,564 INFO L225 Difference]: With dead ends: 1299 [2022-10-16 12:30:17,564 INFO L226 Difference]: Without dead ends: 1297 [2022-10-16 12:30:17,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 12:30:17,567 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 529 mSDsluCounter, 3718 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:17,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 5271 Invalid, 2375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [259 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-10-16 12:30:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-10-16 12:30:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1240. [2022-10-16 12:30:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 896 states have (on average 1.4475446428571428) internal successors, (1297), 991 states have internal predecessors, (1297), 243 states have call successors, (243), 43 states have call predecessors, (243), 43 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2022-10-16 12:30:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1783 transitions. [2022-10-16 12:30:17,643 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1783 transitions. Word has length 57 [2022-10-16 12:30:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:17,644 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1783 transitions. [2022-10-16 12:30:17,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1783 transitions. [2022-10-16 12:30:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 12:30:17,646 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:17,646 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:17,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 12:30:17,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:17,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:17,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash -205418670, now seen corresponding path program 1 times [2022-10-16 12:30:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:17,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284533060] [2022-10-16 12:30:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 12:30:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 12:30:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 12:30:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:18,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284533060] [2022-10-16 12:30:18,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284533060] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:18,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:18,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:18,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300015029] [2022-10-16 12:30:18,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:18,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:18,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:18,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:18,131 INFO L87 Difference]: Start difference. First operand 1240 states and 1783 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:20,248 INFO L93 Difference]: Finished difference Result 3233 states and 4724 transitions. [2022-10-16 12:30:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-10-16 12:30:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:20,265 INFO L225 Difference]: With dead ends: 3233 [2022-10-16 12:30:20,265 INFO L226 Difference]: Without dead ends: 2012 [2022-10-16 12:30:20,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:20,274 INFO L413 NwaCegarLoop]: 1621 mSDtfsCounter, 1033 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:20,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 3282 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 12:30:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-10-16 12:30:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1759. [2022-10-16 12:30:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1297 states have (on average 1.466461063993832) internal successors, (1902), 1407 states have internal predecessors, (1902), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2628 transitions. [2022-10-16 12:30:20,400 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2628 transitions. Word has length 60 [2022-10-16 12:30:20,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:20,401 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2628 transitions. [2022-10-16 12:30:20,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:20,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2628 transitions. [2022-10-16 12:30:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 12:30:20,403 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:20,403 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:20,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:30:20,404 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 33528070, now seen corresponding path program 1 times [2022-10-16 12:30:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005834740] [2022-10-16 12:30:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:20,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:20,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005834740] [2022-10-16 12:30:20,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005834740] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:30:20,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124168121] [2022-10-16 12:30:20,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:20,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:20,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:30:20,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:30:20,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 12:30:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:20,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:30:20,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:30:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:20,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:30:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124168121] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:20,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:30:20,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 12:30:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737366143] [2022-10-16 12:30:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:20,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:20,947 INFO L87 Difference]: Start difference. First operand 1759 states and 2628 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:21,085 INFO L93 Difference]: Finished difference Result 1760 states and 2629 transitions. [2022-10-16 12:30:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-10-16 12:30:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:21,098 INFO L225 Difference]: With dead ends: 1760 [2022-10-16 12:30:21,098 INFO L226 Difference]: Without dead ends: 1758 [2022-10-16 12:30:21,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:21,100 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 47 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:21,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4570 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:30:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-10-16 12:30:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1757. [2022-10-16 12:30:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1297 states have (on average 1.4595219737856593) internal successors, (1893), 1405 states have internal predecessors, (1893), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2619 transitions. [2022-10-16 12:30:21,207 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2619 transitions. Word has length 58 [2022-10-16 12:30:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:21,207 INFO L495 AbstractCegarLoop]: Abstraction has 1757 states and 2619 transitions. [2022-10-16 12:30:21,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2619 transitions. [2022-10-16 12:30:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 12:30:21,209 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:21,209 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:21,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 12:30:21,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-16 12:30:21,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:21,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1000363897, now seen corresponding path program 1 times [2022-10-16 12:30:21,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:21,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761700529] [2022-10-16 12:30:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:21,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:21,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761700529] [2022-10-16 12:30:21,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761700529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:21,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:21,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639123808] [2022-10-16 12:30:21,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:21,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:21,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:21,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:21,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:21,695 INFO L87 Difference]: Start difference. First operand 1757 states and 2619 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:25,451 INFO L93 Difference]: Finished difference Result 5365 states and 8233 transitions. [2022-10-16 12:30:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:25,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-10-16 12:30:25,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:25,492 INFO L225 Difference]: With dead ends: 5365 [2022-10-16 12:30:25,492 INFO L226 Difference]: Without dead ends: 5364 [2022-10-16 12:30:25,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:25,498 INFO L413 NwaCegarLoop]: 3376 mSDtfsCounter, 2365 mSDsluCounter, 5474 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2693 SdHoareTripleChecker+Valid, 8850 SdHoareTripleChecker+Invalid, 2581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:25,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2693 Valid, 8850 Invalid, 2581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-10-16 12:30:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2022-10-16 12:30:25,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 1756. [2022-10-16 12:30:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1297 states have (on average 1.4579799537393987) internal successors, (1891), 1404 states have internal predecessors, (1891), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2617 transitions. [2022-10-16 12:30:25,735 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2617 transitions. Word has length 61 [2022-10-16 12:30:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:25,737 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2617 transitions. [2022-10-16 12:30:25,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2617 transitions. [2022-10-16 12:30:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-16 12:30:25,740 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:25,740 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:30:25,741 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -946508908, now seen corresponding path program 1 times [2022-10-16 12:30:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:25,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578925143] [2022-10-16 12:30:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578925143] [2022-10-16 12:30:25,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578925143] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:25,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:25,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:25,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298004002] [2022-10-16 12:30:25,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:25,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:25,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:25,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:25,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:25,982 INFO L87 Difference]: Start difference. First operand 1756 states and 2617 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:29,526 INFO L93 Difference]: Finished difference Result 5364 states and 8231 transitions. [2022-10-16 12:30:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-10-16 12:30:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:29,564 INFO L225 Difference]: With dead ends: 5364 [2022-10-16 12:30:29,564 INFO L226 Difference]: Without dead ends: 5363 [2022-10-16 12:30:29,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:29,569 INFO L413 NwaCegarLoop]: 3377 mSDtfsCounter, 2362 mSDsluCounter, 5473 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 8850 SdHoareTripleChecker+Invalid, 2575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:29,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 8850 Invalid, 2575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-10-16 12:30:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2022-10-16 12:30:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 1755. [2022-10-16 12:30:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1297 states have (on average 1.4564379336931381) internal successors, (1889), 1403 states have internal predecessors, (1889), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2615 transitions. [2022-10-16 12:30:29,761 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2615 transitions. Word has length 62 [2022-10-16 12:30:29,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:29,762 INFO L495 AbstractCegarLoop]: Abstraction has 1755 states and 2615 transitions. [2022-10-16 12:30:29,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2615 transitions. [2022-10-16 12:30:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 12:30:29,764 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:29,764 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:29,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:30:29,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:29,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:29,765 INFO L85 PathProgramCache]: Analyzing trace with hash 938032729, now seen corresponding path program 1 times [2022-10-16 12:30:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:29,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515621054] [2022-10-16 12:30:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:29,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:29,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515621054] [2022-10-16 12:30:29,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515621054] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:29,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:29,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031901445] [2022-10-16 12:30:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:29,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:29,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:29,924 INFO L87 Difference]: Start difference. First operand 1755 states and 2615 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:32,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:32,051 INFO L93 Difference]: Finished difference Result 3088 states and 4717 transitions. [2022-10-16 12:30:32,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:32,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-10-16 12:30:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:32,074 INFO L225 Difference]: With dead ends: 3088 [2022-10-16 12:30:32,074 INFO L226 Difference]: Without dead ends: 3085 [2022-10-16 12:30:32,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:32,077 INFO L413 NwaCegarLoop]: 2448 mSDtfsCounter, 1063 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 4922 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:32,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 4922 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-10-16 12:30:32,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-10-16 12:30:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 1773. [2022-10-16 12:30:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1311 states have (on average 1.4546147978642259) internal successors, (1907), 1417 states have internal predecessors, (1907), 367 states have call successors, (367), 43 states have call predecessors, (367), 43 states have return successors, (367), 364 states have call predecessors, (367), 367 states have call successors, (367) [2022-10-16 12:30:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2641 transitions. [2022-10-16 12:30:32,254 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2641 transitions. Word has length 64 [2022-10-16 12:30:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:32,255 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2641 transitions. [2022-10-16 12:30:32,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2641 transitions. [2022-10-16 12:30:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 12:30:32,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:32,257 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:32,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:30:32,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:32,258 INFO L85 PathProgramCache]: Analyzing trace with hash 938032791, now seen corresponding path program 1 times [2022-10-16 12:30:32,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:32,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265174145] [2022-10-16 12:30:32,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:32,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:32,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:32,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265174145] [2022-10-16 12:30:32,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265174145] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:32,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:32,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:32,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102979173] [2022-10-16 12:30:32,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:32,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:30:32,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:32,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:30:32,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:32,497 INFO L87 Difference]: Start difference. First operand 1773 states and 2641 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:36,633 INFO L93 Difference]: Finished difference Result 5381 states and 8259 transitions. [2022-10-16 12:30:36,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:30:36,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-10-16 12:30:36,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:36,666 INFO L225 Difference]: With dead ends: 5381 [2022-10-16 12:30:36,666 INFO L226 Difference]: Without dead ends: 5378 [2022-10-16 12:30:36,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-16 12:30:36,669 INFO L413 NwaCegarLoop]: 3367 mSDtfsCounter, 3641 mSDsluCounter, 7245 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 938 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3829 SdHoareTripleChecker+Valid, 10612 SdHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 938 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:36,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3829 Valid, 10612 Invalid, 3748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [938 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-10-16 12:30:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2022-10-16 12:30:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 1752. [2022-10-16 12:30:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1297 states have (on average 1.4518118735543561) internal successors, (1883), 1400 states have internal predecessors, (1883), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2609 transitions. [2022-10-16 12:30:36,917 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2609 transitions. Word has length 64 [2022-10-16 12:30:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:36,918 INFO L495 AbstractCegarLoop]: Abstraction has 1752 states and 2609 transitions. [2022-10-16 12:30:36,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:36,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2609 transitions. [2022-10-16 12:30:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 12:30:36,921 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:36,921 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:36,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:30:36,921 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash -985755636, now seen corresponding path program 1 times [2022-10-16 12:30:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:36,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136045851] [2022-10-16 12:30:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:37,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:37,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136045851] [2022-10-16 12:30:37,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136045851] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:37,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:37,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434311769] [2022-10-16 12:30:37,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:37,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:37,058 INFO L87 Difference]: Start difference. First operand 1752 states and 2609 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:39,013 INFO L93 Difference]: Finished difference Result 2972 states and 4517 transitions. [2022-10-16 12:30:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-10-16 12:30:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:39,030 INFO L225 Difference]: With dead ends: 2972 [2022-10-16 12:30:39,030 INFO L226 Difference]: Without dead ends: 2969 [2022-10-16 12:30:39,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:39,032 INFO L413 NwaCegarLoop]: 2357 mSDtfsCounter, 1061 mSDsluCounter, 2329 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 4686 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:39,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 4686 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 12:30:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2022-10-16 12:30:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1749. [2022-10-16 12:30:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1297 states have (on average 1.4471858134155744) internal successors, (1877), 1397 states have internal predecessors, (1877), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2603 transitions. [2022-10-16 12:30:39,254 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2603 transitions. Word has length 65 [2022-10-16 12:30:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:39,255 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2603 transitions. [2022-10-16 12:30:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:39,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2603 transitions. [2022-10-16 12:30:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 12:30:39,257 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:39,257 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:39,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:30:39,258 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash 829761248, now seen corresponding path program 1 times [2022-10-16 12:30:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:39,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823580561] [2022-10-16 12:30:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:30:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:39,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823580561] [2022-10-16 12:30:39,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823580561] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:39,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:39,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462985723] [2022-10-16 12:30:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:39,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:39,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:39,434 INFO L87 Difference]: Start difference. First operand 1749 states and 2603 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:41,328 INFO L93 Difference]: Finished difference Result 4493 states and 6770 transitions. [2022-10-16 12:30:41,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:41,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-10-16 12:30:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:41,340 INFO L225 Difference]: With dead ends: 4493 [2022-10-16 12:30:41,340 INFO L226 Difference]: Without dead ends: 2763 [2022-10-16 12:30:41,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:41,348 INFO L413 NwaCegarLoop]: 1596 mSDtfsCounter, 1040 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 3063 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:41,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 3063 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-16 12:30:41,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2022-10-16 12:30:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2524. [2022-10-16 12:30:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 1886 states have (on average 1.4575821845174974) internal successors, (2749), 2008 states have internal predecessors, (2749), 551 states have call successors, (551), 43 states have call predecessors, (551), 43 states have return successors, (551), 546 states have call predecessors, (551), 551 states have call successors, (551) [2022-10-16 12:30:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3851 transitions. [2022-10-16 12:30:41,649 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3851 transitions. Word has length 69 [2022-10-16 12:30:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:41,649 INFO L495 AbstractCegarLoop]: Abstraction has 2524 states and 3851 transitions. [2022-10-16 12:30:41,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3851 transitions. [2022-10-16 12:30:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 12:30:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:41,652 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 12:30:41,653 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1439332099, now seen corresponding path program 1 times [2022-10-16 12:30:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:41,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582191441] [2022-10-16 12:30:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 12:30:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:41,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582191441] [2022-10-16 12:30:41,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582191441] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:41,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:41,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400655260] [2022-10-16 12:30:41,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:41,869 INFO L87 Difference]: Start difference. First operand 2524 states and 3851 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:43,962 INFO L93 Difference]: Finished difference Result 4635 states and 7217 transitions. [2022-10-16 12:30:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:43,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-10-16 12:30:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:43,982 INFO L225 Difference]: With dead ends: 4635 [2022-10-16 12:30:43,982 INFO L226 Difference]: Without dead ends: 4633 [2022-10-16 12:30:43,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:43,986 INFO L413 NwaCegarLoop]: 2262 mSDtfsCounter, 1055 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 4566 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:43,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 4566 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-10-16 12:30:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2022-10-16 12:30:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 2546. [2022-10-16 12:30:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1906 states have (on average 1.4580272822665268) internal successors, (2779), 2028 states have internal predecessors, (2779), 553 states have call successors, (553), 43 states have call predecessors, (553), 43 states have return successors, (553), 548 states have call predecessors, (553), 553 states have call successors, (553) [2022-10-16 12:30:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3885 transitions. [2022-10-16 12:30:44,334 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3885 transitions. Word has length 72 [2022-10-16 12:30:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:44,334 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3885 transitions. [2022-10-16 12:30:44,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3885 transitions. [2022-10-16 12:30:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 12:30:44,338 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:44,338 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:44,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:30:44,338 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:44,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2035527323, now seen corresponding path program 1 times [2022-10-16 12:30:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:44,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188621840] [2022-10-16 12:30:44,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:44,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 12:30:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:30:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:44,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:44,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188621840] [2022-10-16 12:30:44,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188621840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:44,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:44,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:44,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019342608] [2022-10-16 12:30:44,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:44,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:44,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:44,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:44,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:44,500 INFO L87 Difference]: Start difference. First operand 2546 states and 3885 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:46,037 INFO L93 Difference]: Finished difference Result 5095 states and 7805 transitions. [2022-10-16 12:30:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:46,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-10-16 12:30:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:46,047 INFO L225 Difference]: With dead ends: 5095 [2022-10-16 12:30:46,047 INFO L226 Difference]: Without dead ends: 2568 [2022-10-16 12:30:46,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:46,059 INFO L413 NwaCegarLoop]: 1494 mSDtfsCounter, 385 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:46,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 3174 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 12:30:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-10-16 12:30:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2550. [2022-10-16 12:30:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1910 states have (on average 1.4570680628272252) internal successors, (2783), 2032 states have internal predecessors, (2783), 553 states have call successors, (553), 43 states have call predecessors, (553), 43 states have return successors, (553), 548 states have call predecessors, (553), 553 states have call successors, (553) [2022-10-16 12:30:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3889 transitions. [2022-10-16 12:30:46,428 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3889 transitions. Word has length 76 [2022-10-16 12:30:46,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:46,428 INFO L495 AbstractCegarLoop]: Abstraction has 2550 states and 3889 transitions. [2022-10-16 12:30:46,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3889 transitions. [2022-10-16 12:30:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 12:30:46,432 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:46,432 INFO L195 NwaCegarLoop]: 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] [2022-10-16 12:30:46,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:30:46,434 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:46,434 INFO L85 PathProgramCache]: Analyzing trace with hash 979576295, now seen corresponding path program 1 times [2022-10-16 12:30:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:46,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994781739] [2022-10-16 12:30:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:46,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:46,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:46,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:46,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 12:30:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:30:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:47,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 12:30:47,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:47,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994781739] [2022-10-16 12:30:47,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994781739] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:47,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:47,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 12:30:47,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298843616] [2022-10-16 12:30:47,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:47,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 12:30:47,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 12:30:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:30:47,288 INFO L87 Difference]: Start difference. First operand 2550 states and 3889 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:50,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:52,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:54,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:56,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:58,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:31:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:31:02,153 INFO L93 Difference]: Finished difference Result 5137 states and 7843 transitions. [2022-10-16 12:31:02,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 12:31:02,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-10-16 12:31:02,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:31:02,165 INFO L225 Difference]: With dead ends: 5137 [2022-10-16 12:31:02,165 INFO L226 Difference]: Without dead ends: 2593 [2022-10-16 12:31:02,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-10-16 12:31:02,177 INFO L413 NwaCegarLoop]: 1482 mSDtfsCounter, 431 mSDsluCounter, 7379 mSDsCounter, 0 mSdLazyCounter, 4377 mSolverCounterSat, 219 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 8861 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 4377 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-10-16 12:31:02,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 8861 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 4377 Invalid, 5 Unknown, 0 Unchecked, 14.3s Time] [2022-10-16 12:31:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-10-16 12:31:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2572. [2022-10-16 12:31:02,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 1925 states have (on average 1.454025974025974) internal successors, (2799), 2048 states have internal predecessors, (2799), 555 states have call successors, (555), 47 states have call predecessors, (555), 48 states have return successors, (556), 550 states have call predecessors, (556), 555 states have call successors, (556) [2022-10-16 12:31:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3910 transitions. [2022-10-16 12:31:02,542 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3910 transitions. Word has length 76 [2022-10-16 12:31:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:31:02,542 INFO L495 AbstractCegarLoop]: Abstraction has 2572 states and 3910 transitions. [2022-10-16 12:31:02,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:31:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3910 transitions. [2022-10-16 12:31:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 12:31:02,547 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:31:02,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:02,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:31:02,548 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:31:02,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:31:02,549 INFO L85 PathProgramCache]: Analyzing trace with hash -260089941, now seen corresponding path program 1 times [2022-10-16 12:31:02,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:31:02,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784228077] [2022-10-16 12:31:02,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:31:02,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:31:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:31:02,804 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:31:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:31:03,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:31:03,018 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:31:03,019 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 80 remaining) [2022-10-16 12:31:03,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 80 remaining) [2022-10-16 12:31:03,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 80 remaining) [2022-10-16 12:31:03,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 80 remaining) [2022-10-16 12:31:03,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 80 remaining) [2022-10-16 12:31:03,022 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 80 remaining) [2022-10-16 12:31:03,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 80 remaining) [2022-10-16 12:31:03,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 80 remaining) [2022-10-16 12:31:03,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 80 remaining) [2022-10-16 12:31:03,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 80 remaining) [2022-10-16 12:31:03,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 80 remaining) [2022-10-16 12:31:03,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 80 remaining) [2022-10-16 12:31:03,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 80 remaining) [2022-10-16 12:31:03,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 80 remaining) [2022-10-16 12:31:03,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 80 remaining) [2022-10-16 12:31:03,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 80 remaining) [2022-10-16 12:31:03,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 80 remaining) [2022-10-16 12:31:03,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 80 remaining) [2022-10-16 12:31:03,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 80 remaining) [2022-10-16 12:31:03,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 80 remaining) [2022-10-16 12:31:03,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 80 remaining) [2022-10-16 12:31:03,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 80 remaining) [2022-10-16 12:31:03,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 80 remaining) [2022-10-16 12:31:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 80 remaining) [2022-10-16 12:31:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 80 remaining) [2022-10-16 12:31:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 80 remaining) [2022-10-16 12:31:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 80 remaining) [2022-10-16 12:31:03,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 80 remaining) [2022-10-16 12:31:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 80 remaining) [2022-10-16 12:31:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 80 remaining) [2022-10-16 12:31:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 80 remaining) [2022-10-16 12:31:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 80 remaining) [2022-10-16 12:31:03,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 80 remaining) [2022-10-16 12:31:03,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 80 remaining) [2022-10-16 12:31:03,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 80 remaining) [2022-10-16 12:31:03,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 80 remaining) [2022-10-16 12:31:03,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 80 remaining) [2022-10-16 12:31:03,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 80 remaining) [2022-10-16 12:31:03,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 80 remaining) [2022-10-16 12:31:03,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 80 remaining) [2022-10-16 12:31:03,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 80 remaining) [2022-10-16 12:31:03,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 80 remaining) [2022-10-16 12:31:03,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 80 remaining) [2022-10-16 12:31:03,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 80 remaining) [2022-10-16 12:31:03,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 80 remaining) [2022-10-16 12:31:03,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 80 remaining) [2022-10-16 12:31:03,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 80 remaining) [2022-10-16 12:31:03,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 80 remaining) [2022-10-16 12:31:03,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 80 remaining) [2022-10-16 12:31:03,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 80 remaining) [2022-10-16 12:31:03,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 80 remaining) [2022-10-16 12:31:03,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 80 remaining) [2022-10-16 12:31:03,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 80 remaining) [2022-10-16 12:31:03,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 80 remaining) [2022-10-16 12:31:03,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_bumpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 80 remaining) [2022-10-16 12:31:03,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_bumpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 80 remaining) [2022-10-16 12:31:03,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 80 remaining) [2022-10-16 12:31:03,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 80 remaining) [2022-10-16 12:31:03,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 80 remaining) [2022-10-16 12:31:03,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 80 remaining) [2022-10-16 12:31:03,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 12:31:03,042 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:03,047 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:31:03,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:31:03 BoogieIcfgContainer [2022-10-16 12:31:03,149 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:31:03,150 INFO L158 Benchmark]: Toolchain (without parser) took 66077.74ms. Allocated memory was 164.6MB in the beginning and 644.9MB in the end (delta: 480.2MB). Free memory was 129.5MB in the beginning and 462.4MB in the end (delta: -332.9MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,150 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 164.6MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:31:03,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2237.11ms. Allocated memory was 164.6MB in the beginning and 206.6MB in the end (delta: 41.9MB). Free memory was 129.3MB in the beginning and 135.8MB in the end (delta: -6.5MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 240.95ms. Allocated memory is still 206.6MB. Free memory was 135.8MB in the beginning and 120.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,151 INFO L158 Benchmark]: Boogie Preprocessor took 238.25ms. Allocated memory is still 206.6MB. Free memory was 120.1MB in the beginning and 142.1MB in the end (delta: -22.0MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,152 INFO L158 Benchmark]: RCFGBuilder took 3701.09ms. Allocated memory was 206.6MB in the beginning and 323.0MB in the end (delta: 116.4MB). Free memory was 142.1MB in the beginning and 238.0MB in the end (delta: -95.9MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,152 INFO L158 Benchmark]: TraceAbstraction took 59645.95ms. Allocated memory was 323.0MB in the beginning and 644.9MB in the end (delta: 321.9MB). Free memory was 237.5MB in the beginning and 462.4MB in the end (delta: -224.9MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. [2022-10-16 12:31:03,154 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 164.6MB. Free memory is still 134.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2237.11ms. Allocated memory was 164.6MB in the beginning and 206.6MB in the end (delta: 41.9MB). Free memory was 129.3MB in the beginning and 135.8MB in the end (delta: -6.5MB). Peak memory consumption was 107.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 240.95ms. Allocated memory is still 206.6MB. Free memory was 135.8MB in the beginning and 120.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 238.25ms. Allocated memory is still 206.6MB. Free memory was 120.1MB in the beginning and 142.1MB in the end (delta: -22.0MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * RCFGBuilder took 3701.09ms. Allocated memory was 206.6MB in the beginning and 323.0MB in the end (delta: 116.4MB). Free memory was 142.1MB in the beginning and 238.0MB in the end (delta: -95.9MB). Peak memory consumption was 94.9MB. Max. memory is 8.0GB. * TraceAbstraction took 59645.95ms. Allocated memory was 323.0MB in the beginning and 644.9MB in the end (delta: 321.9MB). Free memory was 237.5MB in the beginning and 462.4MB in the end (delta: -224.9MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 5915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 4873, overapproximation of shiftRight at line 4735, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6939] CALL, EXPR dev_alloc_skb(1U) VAL [\old(arg0)=1, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(size)=195, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [\old(size)=195, \result={0:0}, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=0, size=195, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(arg0)=1, __this_module={4294967339:4294967335}, arg0=1, LDV_IN_INTERRUPT=0, ldv_malloc(sizeof(struct sk_buff))={0:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] RET, EXPR dev_alloc_skb(1U) VAL [__this_module={4294967339:4294967335}, dev_alloc_skb(1U)={0:0}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 [L6943] FCALL ldv_initialize() [L6944] FCALL ldv_handler_precall() VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6945] CALL, EXPR slip_init() [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4871] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967339:4294967335}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4862] void *tmp___2 ; [L4864] CALL, EXPR __kmalloc(size, flags) [L4857] CALL, EXPR ldv_malloc(size) VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ptr={-4294971391:0}, ptr={-4294971391:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967339:4294967335}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2048, \result={-4294971391:0}, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, res={-4294971391:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=44, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-4294971391:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, t=44] [L4857] return ldv_malloc(size); [L4864] RET, EXPR __kmalloc(size, flags) [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [\old(flags)=44, \old(size)=2048, \result={-4294971391:0}, __this_module={4294967339:4294967335}, flags=44, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-4294971391:0}] [L4873] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967339:4294967335}, flags=208, kmalloc(size, flags | 32768U)={-4294971391:0}, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-4294971391:0}, __this_module={4294967339:4294967335}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-4294971391:0}] [L6740] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp={-4294971391:0}] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6747] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7287] return __VERIFIER_nondet_int(); [L6747] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, status=0, tmp={-4294971391:0}] [L6753] return (status); VAL [\result=0, __this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, status=0, tmp={-4294971391:0}] [L6945] RET, EXPR slip_init() [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___1=1, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: [L7034] case 10: [L7042] case 11: [L7046] case 12: [L7050] case 13: [L7054] case 14: VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___0=14, tmp___1=1, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7055] FCALL ldv_handler_precall() VAL [__this_module={4294967339:4294967335}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___0=14, tmp___1=1, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7056-L7057] CALL slip_receive_buf(&var_group5, var_slip_receive_buf_18_p1, var_slip_receive_buf_18_p2, var_slip_receive_buf_18_p3) [L5869] struct slip *sl ; [L5870] int tmp ; [L5871] int tmp___0 ; [L5872] char *tmp___1 ; [L5873] unsigned char const *tmp___2 ; [L5874] unsigned char const *tmp___3 ; [L5875] int tmp___4 ; [L5877] EXPR tty->disc_data [L5877] sl = (struct slip *)tty->disc_data [L5878] (unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250 [L5878] EXPR sl->magic [L5878] (unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250 VAL [(unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250=0, \old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl->magic=21250, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5878] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250) [L5881] EXPR sl->dev VAL [\old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl->dev={4294967337:-39}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5881] CALL, EXPR netif_running((struct net_device const *)sl->dev) VAL [__this_module={4294967339:4294967335}, dev={4294967337:-39}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5015] int tmp ; VAL [__this_module={4294967339:4294967335}, dev={4294967337:-39}, dev={4294967337:-39}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5017] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) VAL [\old(nr)=0, __this_module={4294967339:4294967335}, addr={4294967337:39}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L5017] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) VAL [__this_module={4294967339:4294967335}, constant_test_bit(0U, (unsigned long const volatile *)(& dev->state))=38, dev={4294967337:-39}, dev={4294967337:-39}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5017] tmp = constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) [L5018] return (tmp); VAL [\result=38, __this_module={4294967339:4294967335}, dev={4294967337:-39}, dev={4294967337:-39}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=38] [L5881] RET, EXPR netif_running((struct net_device const *)sl->dev) VAL [\old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, netif_running((struct net_device const *)sl->dev)=38, sl={35:-34}, sl->dev={4294967337:-39}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5881] tmp = netif_running((struct net_device const *)sl->dev) [L5882] COND FALSE !(tmp == 0) VAL [\old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=38, tty={30:0}, tty={30:0}] [L5914] tmp___4 = count VAL [\old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=38, tmp___4=2147483649, tty={30:0}, tty={30:0}] [L5915] count - 1 VAL [\old(count)=2147483649, __this_module={4294967339:4294967335}, count=2147483649, cp={4294967338:4294967336}, cp={4294967338:4294967336}, fp={4294967341:4294967342}, fp={4294967341:4294967342}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=38, tmp___4=2147483649, tty={30:0}, tty={30:0}] - UnprovableResult [Line: 6671]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6671]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6689]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6689]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6976]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6976]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6989]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6989]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6297]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6297]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5618]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5618]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5384]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5384]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5386]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5386]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5673]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5673]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5949]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5949]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5985]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5985]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5080]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5080]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6091]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6091]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7030]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7030]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6341]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6341]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6343]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6343]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6349]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6349]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6250]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6250]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5648]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5648]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6897]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6897]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6865]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6865]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5544]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5544]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 44 procedures, 1124 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 59.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 21644 SdHoareTripleChecker+Valid, 44.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19243 mSDsluCounter, 84251 SdHoareTripleChecker+Invalid, 39.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51774 mSDsCounter, 5131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23500 IncrementalHoareTripleChecker+Invalid, 28637 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5131 mSolverCounterUnsat, 32477 mSDtfsCounter, 23500 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2572occurred in iteration=16, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 16148 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1251 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 120/137 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 12:31:03,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...