/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-linux-3.0/module_get_put-drivers-net-ppp_generic.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:09:55,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:09:55,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:09:55,236 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:09:55,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:09:55,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:09:55,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:09:55,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:09:55,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:09:55,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:09:55,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:09:55,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:09:55,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:09:55,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:09:55,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:09:55,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:09:55,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:09:55,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:09:55,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:09:55,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:09:55,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:09:55,325 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:09:55,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:09:55,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:09:55,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:09:55,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:09:55,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:09:55,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:09:55,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:09:55,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:09:55,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:09:55,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:09:55,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:09:55,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:09:55,354 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:09:55,354 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:09:55,355 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:09:55,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:09:55,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:09:55,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:09:55,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:09:55,360 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-15 21:09:55,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:09:55,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:09:55,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:09:55,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:09:55,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:09:55,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:09:55,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:09:55,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:09:55,418 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:09:55,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:09:55,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:09:55,419 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:09:55,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:09:55,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:09:55,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:09:55,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:09:55,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:09:55,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:09:55,421 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:09:55,421 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:09:55,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:09:55,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:09:55,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:09:55,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:09:55,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:09:55,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:09:55,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:09:55,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:09:55,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:09:55,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:09:55,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:09:55,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:09:55,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:09:55,425 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-15 21:09:55,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:09:55,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:09:55,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:09:55,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:09:55,839 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:09:55,840 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-ppp_generic.ko.cil.out.i [2022-10-15 21:09:55,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d23cca04/4ecf0643889742d49fa1c9593f158e41/FLAG150faa51e [2022-10-15 21:09:57,018 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:09:57,019 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-ppp_generic.ko.cil.out.i [2022-10-15 21:09:57,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d23cca04/4ecf0643889742d49fa1c9593f158e41/FLAG150faa51e [2022-10-15 21:09:57,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d23cca04/4ecf0643889742d49fa1c9593f158e41 [2022-10-15 21:09:57,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:09:57,385 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:09:57,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:09:57,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:09:57,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:09:57,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:09:57" (1/1) ... [2022-10-15 21:09:57,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f455156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:57, skipping insertion in model container [2022-10-15 21:09:57,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:09:57" (1/1) ... [2022-10-15 21:09:57,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:09:57,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:09:59,864 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-linux-3.0/module_get_put-drivers-net-ppp_generic.ko.cil.out.i[288087,288100] [2022-10-15 21:09:59,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:10:00,035 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:10:00,577 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-linux-3.0/module_get_put-drivers-net-ppp_generic.ko.cil.out.i[288087,288100] [2022-10-15 21:10:00,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:10:00,931 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:10:00,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00 WrapperNode [2022-10-15 21:10:00,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:10:00,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:10:00,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:10:00,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:10:00,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,341 INFO L138 Inliner]: procedures = 301, calls = 1795, calls flagged for inlining = 144, calls inlined = 114, statements flattened = 4392 [2022-10-15 21:10:01,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:10:01,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:10:01,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:10:01,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:10:01,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,568 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:10:01,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:10:01,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:10:01,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:10:01,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (1/1) ... [2022-10-15 21:10:01,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:10:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:10:01,689 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-15 21:10:01,716 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-15 21:10:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure find_comp_entry [2022-10-15 21:10:01,769 INFO L138 BoogieDeclarations]: Found implementation of procedure find_comp_entry [2022-10-15 21:10:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-10-15 21:10:01,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2022-10-15 21:10:01,769 INFO L130 BoogieDeclarations]: Found specification of procedure skb_dequeue [2022-10-15 21:10:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_dequeue [2022-10-15 21:10:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_lock_bh [2022-10-15 21:10:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_lock_bh [2022-10-15 21:10:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-10-15 21:10:01,770 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_write_unlock_bh [2022-10-15 21:10:01,770 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_write_unlock_bh [2022-10-15 21:10:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-15 21:10:01,771 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2022-10-15 21:10:01,771 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2022-10-15 21:10:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-15 21:10:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2022-10-15 21:10:01,772 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2022-10-15 21:10:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-10-15 21:10:01,772 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-10-15 21:10:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_xmit_process [2022-10-15 21:10:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_xmit_process [2022-10-15 21:10:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_shutdown_interface [2022-10-15 21:10:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_shutdown_interface [2022-10-15 21:10:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_destroy_interface [2022-10-15 21:10:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_destroy_interface [2022-10-15 21:10:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-10-15 21:10:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-10-15 21:10:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-10-15 21:10:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-10-15 21:10:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-10-15 21:10:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-10-15 21:10:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:10:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:10:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_lock_bh [2022-10-15 21:10:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_lock_bh [2022-10-15 21:10:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-10-15 21:10:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-10-15 21:10:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_push [2022-10-15 21:10:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_push [2022-10-15 21:10:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure unit_find [2022-10-15 21:10:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure unit_find [2022-10-15 21:10:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-10-15 21:10:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-10-15 21:10:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure pskb_expand_head [2022-10-15 21:10:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure pskb_expand_head [2022-10-15 21:10:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_be16 [2022-10-15 21:10:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_be16 [2022-10-15 21:10:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-10-15 21:10:01,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-10-15 21:10:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-10-15 21:10:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-10-15 21:10:01,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-10-15 21:10:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-10-15 21:10:01,779 INFO L130 BoogieDeclarations]: Found specification of procedure init_ppp_file [2022-10-15 21:10:01,779 INFO L138 BoogieDeclarations]: Found implementation of procedure init_ppp_file [2022-10-15 21:10:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-10-15 21:10:01,780 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-10-15 21:10:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure skb_peek [2022-10-15 21:10:01,780 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_peek [2022-10-15 21:10:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_release [2022-10-15 21:10:01,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_release [2022-10-15 21:10:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure get_filter [2022-10-15 21:10:01,781 INFO L138 BoogieDeclarations]: Found implementation of procedure get_filter [2022-10-15 21:10:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure __unit_alloc [2022-10-15 21:10:01,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __unit_alloc [2022-10-15 21:10:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:10:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-10-15 21:10:01,782 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-10-15 21:10:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_empty [2022-10-15 21:10:01,783 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_empty [2022-10-15 21:10:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:10:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-10-15 21:10:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-10-15 21:10:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-10-15 21:10:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-10-15 21:10:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-10-15 21:10:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-10-15 21:10:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:10:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:10:01,786 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_find_unit [2022-10-15 21:10:01,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_find_unit [2022-10-15 21:10:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-15 21:10:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-15 21:10:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-10-15 21:10:01,787 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-10-15 21:10:01,787 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-10-15 21:10:01,788 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-10-15 21:10:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-10-15 21:10:01,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-10-15 21:10:01,788 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_push [2022-10-15 21:10:01,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_channel_push [2022-10-15 21:10:01,789 INFO L130 BoogieDeclarations]: Found specification of procedure sk_run_filter [2022-10-15 21:10:01,790 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_run_filter [2022-10-15 21:10:01,790 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-10-15 21:10:01,790 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-10-15 21:10:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-10-15 21:10:01,791 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-10-15 21:10:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-10-15 21:10:01,792 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-10-15 21:10:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure find_compressor [2022-10-15 21:10:01,792 INFO L138 BoogieDeclarations]: Found implementation of procedure find_compressor [2022-10-15 21:10:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_pernet [2022-10-15 21:10:01,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_pernet [2022-10-15 21:10:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-10-15 21:10:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-10-15 21:10:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-10-15 21:10:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-10-15 21:10:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-15 21:10:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-10-15 21:10:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-10-15 21:10:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pernet_device [2022-10-15 21:10:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pernet_device [2022-10-15 21:10:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-10-15 21:10:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-10-15 21:10:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_disconnect_channel [2022-10-15 21:10:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_disconnect_channel [2022-10-15 21:10:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-15 21:10:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_read_unlock_bh [2022-10-15 21:10:01,795 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_read_unlock_bh [2022-10-15 21:10:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-10-15 21:10:01,796 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-10-15 21:10:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2022-10-15 21:10:01,798 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2022-10-15 21:10:01,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:10:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-10-15 21:10:01,803 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-10-15 21:10:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headroom [2022-10-15 21:10:01,803 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headroom [2022-10-15 21:10:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_exit_net [2022-10-15 21:10:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_exit_net [2022-10-15 21:10:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-10-15 21:10:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-10-15 21:10:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-10-15 21:10:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-10-15 21:10:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure proto_to_npindex [2022-10-15 21:10:01,804 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_to_npindex [2022-10-15 21:10:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure net_generic [2022-10-15 21:10:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure net_generic [2022-10-15 21:10:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:10:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:10:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure unit_put [2022-10-15 21:10:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure unit_put [2022-10-15 21:10:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2022-10-15 21:10:01,805 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2022-10-15 21:10:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:10:01,805 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-10-15 21:10:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-10-15 21:10:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-10-15 21:10:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-10-15 21:10:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure net_ratelimit [2022-10-15 21:10:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure net_ratelimit [2022-10-15 21:10:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ccp_closed [2022-10-15 21:10:01,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ccp_closed [2022-10-15 21:10:01,806 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_open [2022-10-15 21:10:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_open [2022-10-15 21:10:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:10:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-10-15 21:10:01,807 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-10-15 21:10:01,807 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-10-15 21:10:01,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-10-15 21:10:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:10:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-10-15 21:10:01,808 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-10-15 21:10:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:10:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-10-15 21:10:01,808 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~$Pointer$ [2022-10-15 21:10:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~$Pointer$ [2022-10-15 21:10:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-10-15 21:10:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-10-15 21:10:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure skb_headlen [2022-10-15 21:10:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_headlen [2022-10-15 21:10:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-10-15 21:10:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-10-15 21:10:01,809 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-10-15 21:10:01,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-10-15 21:10:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-15 21:10:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-15 21:10:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_long_read [2022-10-15 21:10:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_long_read [2022-10-15 21:10:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-10-15 21:10:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-10-15 21:10:01,810 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-10-15 21:10:01,810 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-10-15 21:10:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-10-15 21:10:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-10-15 21:10:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-10-15 21:10:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-10-15 21:10:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-10-15 21:10:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-10-15 21:10:01,811 INFO L130 BoogieDeclarations]: Found specification of procedure pskb_may_pull [2022-10-15 21:10:01,811 INFO L138 BoogieDeclarations]: Found implementation of procedure pskb_may_pull [2022-10-15 21:10:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-15 21:10:01,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-15 21:10:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ioctl [2022-10-15 21:10:01,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ioctl [2022-10-15 21:10:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ccp_peek [2022-10-15 21:10:01,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ccp_peek [2022-10-15 21:10:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_poll [2022-10-15 21:10:01,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_poll [2022-10-15 21:10:01,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:10:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_destroy_channel [2022-10-15 21:10:01,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_destroy_channel [2022-10-15 21:10:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-10-15 21:10:01,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-10-15 21:10:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:10:01,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:10:01,813 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-10-15 21:10:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-10-15 21:10:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:10:01,814 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:10:02,656 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:10:02,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:10:03,531 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-10-15 21:10:03,531 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-10-15 21:10:06,691 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:10:06,697 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:10:06,700 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:10:07,308 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##201: assume !false; [2022-10-15 21:10:07,308 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##200: assume false; [2022-10-15 21:10:07,308 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##261: assume false; [2022-10-15 21:10:07,308 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##262: assume !false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##207: assume !false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##206: assume false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume !false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##212: assume false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##221: assume !false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume false; [2022-10-15 21:10:07,309 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##93: assume !false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##92: assume false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##89: assume !false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume false; [2022-10-15 21:10:07,310 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume !false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##143: assume false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##148: assume !false; [2022-10-15 21:10:07,311 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##147: assume false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume false; [2022-10-15 21:10:07,312 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##163: assume !false; [2022-10-15 21:10:07,553 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:10:07,563 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:10:08,330 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6446: SUMMARY for call ppp_read_#t~ret294#1.base, ppp_read_#t~ret294#1.offset := get_current(); srcloc: null [2022-10-15 21:10:08,330 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6446-1: ppp_read_~tmp___0~15#1.base, ppp_read_~tmp___0~15#1.offset := ppp_read_#t~ret294#1.base, ppp_read_#t~ret294#1.offset;havoc ppp_read_#t~ret294#1.base, ppp_read_#t~ret294#1.offset;ppp_read_~__ptr~0#1.base, ppp_read_~__ptr~0#1.offset := ppp_read_~tmp___0~15#1.base, ppp_read_~tmp___0~15#1.offset; [2022-10-15 21:10:08,330 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6528-1: ppp_read_~tmp___6~0#1.base, ppp_read_~tmp___6~0#1.offset := ppp_read_#t~ret306#1.base, ppp_read_#t~ret306#1.offset;havoc ppp_read_#t~ret306#1.base, ppp_read_#t~ret306#1.offset;ppp_read_~__ptr___3~0#1.base, ppp_read_~__ptr___3~0#1.offset := ppp_read_~tmp___6~0#1.base, ppp_read_~tmp___6~0#1.offset; [2022-10-15 21:10:08,330 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint L6528: SUMMARY for call ppp_read_#t~ret306#1.base, ppp_read_#t~ret306#1.offset := get_current(); srcloc: null [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##64: assume !false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##63: assume false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume !false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##42: assume false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2022-10-15 21:10:08,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume !false; [2022-10-15 21:10:08,332 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##160: assume false; [2022-10-15 21:10:08,495 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:10:08,531 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:10:08,531 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 21:10:08,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:10:08 BoogieIcfgContainer [2022-10-15 21:10:08,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:10:08,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:10:08,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:10:08,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:10:08,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:09:57" (1/3) ... [2022-10-15 21:10:08,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:10:08, skipping insertion in model container [2022-10-15 21:10:08,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:10:00" (2/3) ... [2022-10-15 21:10:08,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a93391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:10:08, skipping insertion in model container [2022-10-15 21:10:08,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:10:08" (3/3) ... [2022-10-15 21:10:08,551 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-ppp_generic.ko.cil.out.i [2022-10-15 21:10:08,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:10:08,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 128 error locations. [2022-10-15 21:10:08,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:10:08,696 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;@fa2086e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:10:08,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 128 error locations. [2022-10-15 21:10:08,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 1718 states, 1164 states have (on average 1.4347079037800687) internal successors, (1670), 1326 states have internal predecessors, (1670), 331 states have call successors, (331), 96 states have call predecessors, (331), 96 states have return successors, (331), 323 states have call predecessors, (331), 331 states have call successors, (331) [2022-10-15 21:10:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 21:10:08,724 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:08,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:08,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2103546809, now seen corresponding path program 1 times [2022-10-15 21:10:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:08,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506280699] [2022-10-15 21:10:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:09,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 21:10:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506280699] [2022-10-15 21:10:09,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506280699] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:09,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:09,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:10:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778021462] [2022-10-15 21:10:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:09,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:09,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:09,459 INFO L87 Difference]: Start difference. First operand has 1718 states, 1164 states have (on average 1.4347079037800687) internal successors, (1670), 1326 states have internal predecessors, (1670), 331 states have call successors, (331), 96 states have call predecessors, (331), 96 states have return successors, (331), 323 states have call predecessors, (331), 331 states have call successors, (331) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:09,896 INFO L93 Difference]: Finished difference Result 3586 states and 4980 transitions. [2022-10-15 21:10:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-10-15 21:10:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:09,951 INFO L225 Difference]: With dead ends: 3586 [2022-10-15 21:10:09,952 INFO L226 Difference]: Without dead ends: 1832 [2022-10-15 21:10:09,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:09,986 INFO L413 NwaCegarLoop]: 2300 mSDtfsCounter, 198 mSDsluCounter, 2224 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:09,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 4524 Invalid, 33 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:10:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2022-10-15 21:10:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1824. [2022-10-15 21:10:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1259 states have (on average 1.3939634630659254) internal successors, (1755), 1409 states have internal predecessors, (1755), 354 states have call successors, (354), 95 states have call predecessors, (354), 95 states have return successors, (354), 346 states have call predecessors, (354), 354 states have call successors, (354) [2022-10-15 21:10:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2463 transitions. [2022-10-15 21:10:10,210 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2463 transitions. Word has length 23 [2022-10-15 21:10:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:10,211 INFO L495 AbstractCegarLoop]: Abstraction has 1824 states and 2463 transitions. [2022-10-15 21:10:10,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2463 transitions. [2022-10-15 21:10:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 21:10:10,217 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:10,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:10,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:10:10,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting net_genericErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:10,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2088231898, now seen corresponding path program 1 times [2022-10-15 21:10:10,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:10,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183900101] [2022-10-15 21:10:10,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:10,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:10:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183900101] [2022-10-15 21:10:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183900101] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:10,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:10,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:10:10,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245890554] [2022-10-15 21:10:10,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:10,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:10:10,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:10:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:10:10,896 INFO L87 Difference]: Start difference. First operand 1824 states and 2463 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:13,804 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-15 21:10:15,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:15,433 INFO L93 Difference]: Finished difference Result 4451 states and 6029 transitions. [2022-10-15 21:10:15,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:10:15,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-10-15 21:10:15,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:15,460 INFO L225 Difference]: With dead ends: 4451 [2022-10-15 21:10:15,461 INFO L226 Difference]: Without dead ends: 2634 [2022-10-15 21:10:15,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:10:15,495 INFO L413 NwaCegarLoop]: 2381 mSDtfsCounter, 918 mSDsluCounter, 9100 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 11481 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:15,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 11481 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 570 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-10-15 21:10:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2022-10-15 21:10:15,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2575. [2022-10-15 21:10:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 1825 states have (on average 1.3884931506849314) internal successors, (2534), 1997 states have internal predecessors, (2534), 490 states have call successors, (490), 147 states have call predecessors, (490), 144 states have return successors, (503), 458 states have call predecessors, (503), 490 states have call successors, (503) [2022-10-15 21:10:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 3527 transitions. [2022-10-15 21:10:15,740 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 3527 transitions. Word has length 36 [2022-10-15 21:10:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:15,741 INFO L495 AbstractCegarLoop]: Abstraction has 2575 states and 3527 transitions. [2022-10-15 21:10:15,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 3527 transitions. [2022-10-15 21:10:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 21:10:15,747 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:15,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:15,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:10:15,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting net_genericErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:15,759 INFO L85 PathProgramCache]: Analyzing trace with hash -47844198, now seen corresponding path program 1 times [2022-10-15 21:10:15,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:15,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857527111] [2022-10-15 21:10:15,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:15,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-10-15 21:10:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:16,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857527111] [2022-10-15 21:10:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857527111] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:16,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:16,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:10:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001051182] [2022-10-15 21:10:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:16,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:10:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:16,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:10:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:10:16,287 INFO L87 Difference]: Start difference. First operand 2575 states and 3527 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:19,465 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-15 21:10:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:21,010 INFO L93 Difference]: Finished difference Result 4446 states and 6018 transitions. [2022-10-15 21:10:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:10:21,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-10-15 21:10:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:21,035 INFO L225 Difference]: With dead ends: 4446 [2022-10-15 21:10:21,035 INFO L226 Difference]: Without dead ends: 2621 [2022-10-15 21:10:21,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:10:21,048 INFO L413 NwaCegarLoop]: 2335 mSDtfsCounter, 929 mSDsluCounter, 11329 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 13664 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:21,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 13664 Invalid, 653 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 646 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-10-15 21:10:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2621 states. [2022-10-15 21:10:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2621 to 2571. [2022-10-15 21:10:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 1823 states have (on average 1.387822270981898) internal successors, (2530), 1993 states have internal predecessors, (2530), 488 states have call successors, (488), 147 states have call predecessors, (488), 144 states have return successors, (501), 458 states have call predecessors, (501), 488 states have call successors, (501) [2022-10-15 21:10:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3519 transitions. [2022-10-15 21:10:21,251 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3519 transitions. Word has length 34 [2022-10-15 21:10:21,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:21,252 INFO L495 AbstractCegarLoop]: Abstraction has 2571 states and 3519 transitions. [2022-10-15 21:10:21,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:10:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3519 transitions. [2022-10-15 21:10:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 21:10:21,259 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:21,260 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:10:21,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:10:21,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1589135488, now seen corresponding path program 1 times [2022-10-15 21:10:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:21,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832218133] [2022-10-15 21:10:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:10:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:10:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:21,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832218133] [2022-10-15 21:10:21,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832218133] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:21,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:21,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:10:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913634410] [2022-10-15 21:10:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:21,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:21,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:21,438 INFO L87 Difference]: Start difference. First operand 2571 states and 3519 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:21,567 INFO L93 Difference]: Finished difference Result 5120 states and 7026 transitions. [2022-10-15 21:10:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-10-15 21:10:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:21,589 INFO L225 Difference]: With dead ends: 5120 [2022-10-15 21:10:21,589 INFO L226 Difference]: Without dead ends: 2577 [2022-10-15 21:10:21,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:21,607 INFO L413 NwaCegarLoop]: 2235 mSDtfsCounter, 2 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4466 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:21,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4466 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:21,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2022-10-15 21:10:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2573. [2022-10-15 21:10:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2573 states, 1825 states have (on average 1.3873972602739726) internal successors, (2532), 1995 states have internal predecessors, (2532), 488 states have call successors, (488), 147 states have call predecessors, (488), 144 states have return successors, (501), 458 states have call predecessors, (501), 488 states have call successors, (501) [2022-10-15 21:10:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2573 states to 2573 states and 3521 transitions. [2022-10-15 21:10:21,740 INFO L78 Accepts]: Start accepts. Automaton has 2573 states and 3521 transitions. Word has length 43 [2022-10-15 21:10:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:21,741 INFO L495 AbstractCegarLoop]: Abstraction has 2573 states and 3521 transitions. [2022-10-15 21:10:21,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2573 states and 3521 transitions. [2022-10-15 21:10:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 21:10:21,744 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:21,744 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:10:21,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:10:21,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1558115681, now seen corresponding path program 1 times [2022-10-15 21:10:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:21,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871200951] [2022-10-15 21:10:21,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:21,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:10:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:10:21,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:21,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871200951] [2022-10-15 21:10:21,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871200951] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:10:21,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864308166] [2022-10-15 21:10:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:21,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:10:21,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:10:21,973 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-15 21:10:22,022 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-15 21:10:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:22,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:10:22,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:10:22,533 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-15 21:10:22,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:10:22,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864308166] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:22,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:10:22,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-15 21:10:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154364826] [2022-10-15 21:10:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:22,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:22,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:22,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:10:22,536 INFO L87 Difference]: Start difference. First operand 2573 states and 3521 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:22,691 INFO L93 Difference]: Finished difference Result 2581 states and 3521 transitions. [2022-10-15 21:10:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-10-15 21:10:22,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:22,713 INFO L225 Difference]: With dead ends: 2581 [2022-10-15 21:10:22,713 INFO L226 Difference]: Without dead ends: 2579 [2022-10-15 21:10:22,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:10:22,717 INFO L413 NwaCegarLoop]: 2254 mSDtfsCounter, 254 mSDsluCounter, 2111 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 4365 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:22,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 4365 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2022-10-15 21:10:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2571. [2022-10-15 21:10:22,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 1825 states have (on average 1.3857534246575343) internal successors, (2529), 1993 states have internal predecessors, (2529), 488 states have call successors, (488), 147 states have call predecessors, (488), 144 states have return successors, (501), 458 states have call predecessors, (501), 488 states have call successors, (501) [2022-10-15 21:10:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3518 transitions. [2022-10-15 21:10:22,877 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3518 transitions. Word has length 43 [2022-10-15 21:10:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:22,878 INFO L495 AbstractCegarLoop]: Abstraction has 2571 states and 3518 transitions. [2022-10-15 21:10:22,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3518 transitions. [2022-10-15 21:10:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 21:10:22,882 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:22,882 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:10:22,930 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-15 21:10:23,096 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-15 21:10:23,096 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1056942633, now seen corresponding path program 1 times [2022-10-15 21:10:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790942586] [2022-10-15 21:10:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:10:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:23,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:10:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:23,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790942586] [2022-10-15 21:10:23,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790942586] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:10:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694861128] [2022-10-15 21:10:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:23,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:10:23,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:10:23,350 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-15 21:10:23,371 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-15 21:10:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:23,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:10:23,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:10:23,851 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-15 21:10:23,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:10:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694861128] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:23,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:10:23,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-15 21:10:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756498246] [2022-10-15 21:10:23,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:10:23,854 INFO L87 Difference]: Start difference. First operand 2571 states and 3518 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:24,036 INFO L93 Difference]: Finished difference Result 5383 states and 7421 transitions. [2022-10-15 21:10:24,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:24,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-10-15 21:10:24,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:24,066 INFO L225 Difference]: With dead ends: 5383 [2022-10-15 21:10:24,067 INFO L226 Difference]: Without dead ends: 2840 [2022-10-15 21:10:24,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:10:24,087 INFO L413 NwaCegarLoop]: 2455 mSDtfsCounter, 190 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 4667 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:24,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 4667 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2840 states. [2022-10-15 21:10:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2840 to 2832. [2022-10-15 21:10:24,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2832 states, 2039 states have (on average 1.394310936733693) internal successors, (2843), 2210 states have internal predecessors, (2843), 536 states have call successors, (536), 147 states have call predecessors, (536), 144 states have return successors, (552), 503 states have call predecessors, (552), 536 states have call successors, (552) [2022-10-15 21:10:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 3931 transitions. [2022-10-15 21:10:24,250 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 3931 transitions. Word has length 44 [2022-10-15 21:10:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:24,250 INFO L495 AbstractCegarLoop]: Abstraction has 2832 states and 3931 transitions. [2022-10-15 21:10:24,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:10:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 3931 transitions. [2022-10-15 21:10:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 21:10:24,256 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:24,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:24,295 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-15 21:10:24,470 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,SelfDestructingSolverStorable5 [2022-10-15 21:10:24,471 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ppp_ioctlErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:24,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1787306641, now seen corresponding path program 1 times [2022-10-15 21:10:24,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:24,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299774304] [2022-10-15 21:10:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:24,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:10:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:24,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:24,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299774304] [2022-10-15 21:10:24,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299774304] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:24,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:24,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:10:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376653749] [2022-10-15 21:10:24,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:24,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:24,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:24,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:24,657 INFO L87 Difference]: Start difference. First operand 2832 states and 3931 transitions. Second operand has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:24,814 INFO L93 Difference]: Finished difference Result 2875 states and 4004 transitions. [2022-10-15 21:10:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-10-15 21:10:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:24,837 INFO L225 Difference]: With dead ends: 2875 [2022-10-15 21:10:24,837 INFO L226 Difference]: Without dead ends: 2873 [2022-10-15 21:10:24,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:24,841 INFO L413 NwaCegarLoop]: 2250 mSDtfsCounter, 18 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4480 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:24,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4480 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2022-10-15 21:10:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2836. [2022-10-15 21:10:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2043 states have (on average 1.3935389133627019) internal successors, (2847), 2214 states have internal predecessors, (2847), 536 states have call successors, (536), 147 states have call predecessors, (536), 144 states have return successors, (552), 503 states have call predecessors, (552), 536 states have call successors, (552) [2022-10-15 21:10:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3935 transitions. [2022-10-15 21:10:25,014 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3935 transitions. Word has length 45 [2022-10-15 21:10:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:25,014 INFO L495 AbstractCegarLoop]: Abstraction has 2836 states and 3935 transitions. [2022-10-15 21:10:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 20.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3935 transitions. [2022-10-15 21:10:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 21:10:25,019 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:25,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:10:25,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting net_genericErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:25,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 122045782, now seen corresponding path program 1 times [2022-10-15 21:10:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:25,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041805470] [2022-10-15 21:10:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-15 21:10:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:25,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:25,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041805470] [2022-10-15 21:10:25,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041805470] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:25,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:25,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:10:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817321623] [2022-10-15 21:10:25,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:25,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:10:25,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:25,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:10:25,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:10:25,623 INFO L87 Difference]: Start difference. First operand 2836 states and 3935 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:10:28,800 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-15 21:10:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:30,297 INFO L93 Difference]: Finished difference Result 5621 states and 7792 transitions. [2022-10-15 21:10:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:10:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-10-15 21:10:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:30,323 INFO L225 Difference]: With dead ends: 5621 [2022-10-15 21:10:30,323 INFO L226 Difference]: Without dead ends: 2786 [2022-10-15 21:10:30,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:10:30,341 INFO L413 NwaCegarLoop]: 2287 mSDtfsCounter, 806 mSDsluCounter, 11115 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 13402 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:30,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 13402 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 573 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-10-15 21:10:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2022-10-15 21:10:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2747. [2022-10-15 21:10:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2747 states, 1983 states have (on average 1.3978819969742813) internal successors, (2772), 2151 states have internal predecessors, (2772), 515 states have call successors, (515), 138 states have call predecessors, (515), 136 states have return successors, (531), 485 states have call predecessors, (531), 515 states have call successors, (531) [2022-10-15 21:10:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2747 states to 2747 states and 3818 transitions. [2022-10-15 21:10:30,477 INFO L78 Accepts]: Start accepts. Automaton has 2747 states and 3818 transitions. Word has length 48 [2022-10-15 21:10:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:30,477 INFO L495 AbstractCegarLoop]: Abstraction has 2747 states and 3818 transitions. [2022-10-15 21:10:30,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:10:30,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2747 states and 3818 transitions. [2022-10-15 21:10:30,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-10-15 21:10:30,480 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:30,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:10:30,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ppp_ioctlErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash 428048578, now seen corresponding path program 1 times [2022-10-15 21:10:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196236780] [2022-10-15 21:10:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:10:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:30,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:30,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196236780] [2022-10-15 21:10:30,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196236780] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:30,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:30,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:10:30,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063394379] [2022-10-15 21:10:30,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:30,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:10:30,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:30,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:10:30,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:10:30,812 INFO L87 Difference]: Start difference. First operand 2747 states and 3818 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:31,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:31,045 INFO L93 Difference]: Finished difference Result 2826 states and 3956 transitions. [2022-10-15 21:10:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:10:31,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-10-15 21:10:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:31,070 INFO L225 Difference]: With dead ends: 2826 [2022-10-15 21:10:31,070 INFO L226 Difference]: Without dead ends: 2824 [2022-10-15 21:10:31,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 21:10:31,074 INFO L413 NwaCegarLoop]: 2265 mSDtfsCounter, 53 mSDsluCounter, 4454 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 6719 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:31,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 6719 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:10:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2824 states. [2022-10-15 21:10:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2824 to 2752. [2022-10-15 21:10:31,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2752 states, 1989 states have (on average 1.396681749622926) internal successors, (2778), 2156 states have internal predecessors, (2778), 515 states have call successors, (515), 138 states have call predecessors, (515), 136 states have return successors, (531), 485 states have call predecessors, (531), 515 states have call successors, (531) [2022-10-15 21:10:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2752 states to 2752 states and 3824 transitions. [2022-10-15 21:10:31,215 INFO L78 Accepts]: Start accepts. Automaton has 2752 states and 3824 transitions. Word has length 46 [2022-10-15 21:10:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:31,216 INFO L495 AbstractCegarLoop]: Abstraction has 2752 states and 3824 transitions. [2022-10-15 21:10:31,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2752 states and 3824 transitions. [2022-10-15 21:10:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-15 21:10:31,220 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:31,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:31,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:10:31,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ppp_ioctlErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 385313809, now seen corresponding path program 1 times [2022-10-15 21:10:31,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:31,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909283771] [2022-10-15 21:10:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:10:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:31,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909283771] [2022-10-15 21:10:31,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909283771] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:31,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:31,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:10:31,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054029420] [2022-10-15 21:10:31,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:31,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:31,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:31,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:31,417 INFO L87 Difference]: Start difference. First operand 2752 states and 3824 transitions. Second operand has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:31,564 INFO L93 Difference]: Finished difference Result 2790 states and 3889 transitions. [2022-10-15 21:10:31,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-10-15 21:10:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:31,588 INFO L225 Difference]: With dead ends: 2790 [2022-10-15 21:10:31,588 INFO L226 Difference]: Without dead ends: 2788 [2022-10-15 21:10:31,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:31,592 INFO L413 NwaCegarLoop]: 2244 mSDtfsCounter, 15 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4459 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:31,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4459 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:10:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2022-10-15 21:10:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2754. [2022-10-15 21:10:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 1991 states have (on average 1.3962832747363134) internal successors, (2780), 2158 states have internal predecessors, (2780), 515 states have call successors, (515), 138 states have call predecessors, (515), 136 states have return successors, (531), 485 states have call predecessors, (531), 515 states have call successors, (531) [2022-10-15 21:10:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3826 transitions. [2022-10-15 21:10:31,731 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3826 transitions. Word has length 47 [2022-10-15 21:10:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:31,732 INFO L495 AbstractCegarLoop]: Abstraction has 2754 states and 3826 transitions. [2022-10-15 21:10:31,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3826 transitions. [2022-10-15 21:10:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-10-15 21:10:31,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:31,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:31,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:10:31,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ppp_ioctlErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:31,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:31,738 INFO L85 PathProgramCache]: Analyzing trace with hash 384606449, now seen corresponding path program 1 times [2022-10-15 21:10:31,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:31,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458884459] [2022-10-15 21:10:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:10:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 21:10:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:31,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:31,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458884459] [2022-10-15 21:10:31,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458884459] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:31,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:31,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:10:31,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380376964] [2022-10-15 21:10:31,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:31,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:10:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:10:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:10:31,989 INFO L87 Difference]: Start difference. First operand 2754 states and 3826 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:32,219 INFO L93 Difference]: Finished difference Result 2821 states and 3944 transitions. [2022-10-15 21:10:32,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:10:32,220 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-10-15 21:10:32,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:32,263 INFO L225 Difference]: With dead ends: 2821 [2022-10-15 21:10:32,264 INFO L226 Difference]: Without dead ends: 2820 [2022-10-15 21:10:32,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 21:10:32,268 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 37 mSDsluCounter, 4461 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 6732 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:32,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 6732 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:10:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-10-15 21:10:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2750. [2022-10-15 21:10:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 1987 states have (on average 1.3960744841469552) internal successors, (2774), 2154 states have internal predecessors, (2774), 515 states have call successors, (515), 138 states have call predecessors, (515), 136 states have return successors, (531), 485 states have call predecessors, (531), 515 states have call successors, (531) [2022-10-15 21:10:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3820 transitions. [2022-10-15 21:10:32,439 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3820 transitions. Word has length 47 [2022-10-15 21:10:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:32,440 INFO L495 AbstractCegarLoop]: Abstraction has 2750 states and 3820 transitions. [2022-10-15 21:10:32,440 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, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:10:32,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3820 transitions. [2022-10-15 21:10:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 21:10:32,445 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:32,445 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:10:32,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:10:32,446 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1731346258, now seen corresponding path program 1 times [2022-10-15 21:10:32,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:32,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843433048] [2022-10-15 21:10:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:32,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-15 21:10:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-15 21:10:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:10:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:32,621 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-15 21:10:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:32,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843433048] [2022-10-15 21:10:32,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843433048] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:32,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:32,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:10:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175363053] [2022-10-15 21:10:32,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:32,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:10:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:10:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:32,624 INFO L87 Difference]: Start difference. First operand 2750 states and 3820 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:10:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:32,779 INFO L93 Difference]: Finished difference Result 4850 states and 6714 transitions. [2022-10-15 21:10:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:10:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2022-10-15 21:10:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:32,799 INFO L225 Difference]: With dead ends: 4850 [2022-10-15 21:10:32,799 INFO L226 Difference]: Without dead ends: 2905 [2022-10-15 21:10:32,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:10:32,811 INFO L413 NwaCegarLoop]: 2451 mSDtfsCounter, 232 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 4613 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:32,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4613 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2022-10-15 21:10:32,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2897. [2022-10-15 21:10:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2106 states have (on average 1.399335232668566) internal successors, (2947), 2273 states have internal predecessors, (2947), 544 states have call successors, (544), 138 states have call predecessors, (544), 136 states have return successors, (560), 514 states have call predecessors, (560), 544 states have call successors, (560) [2022-10-15 21:10:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4051 transitions. [2022-10-15 21:10:32,950 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4051 transitions. Word has length 50 [2022-10-15 21:10:32,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:32,950 INFO L495 AbstractCegarLoop]: Abstraction has 2897 states and 4051 transitions. [2022-10-15 21:10:32,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:10:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4051 transitions. [2022-10-15 21:10:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 21:10:32,955 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:32,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:32,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 21:10:32,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1024898040, now seen corresponding path program 1 times [2022-10-15 21:10:32,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:32,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027803] [2022-10-15 21:10:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:33,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:10:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:33,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-10-15 21:10:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-15 21:10:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-10-15 21:10:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:10:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:10:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:10:33,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027803] [2022-10-15 21:10:33,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027803] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:10:33,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:10:33,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:10:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976547413] [2022-10-15 21:10:33,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:10:33,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:10:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:10:33,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:10:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:10:33,344 INFO L87 Difference]: Start difference. First operand 2897 states and 4051 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 21:10:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:10:33,562 INFO L93 Difference]: Finished difference Result 5770 states and 8073 transitions. [2022-10-15 21:10:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:10:33,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-10-15 21:10:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:10:33,579 INFO L225 Difference]: With dead ends: 5770 [2022-10-15 21:10:33,580 INFO L226 Difference]: Without dead ends: 2897 [2022-10-15 21:10:33,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:10:33,601 INFO L413 NwaCegarLoop]: 2230 mSDtfsCounter, 3 mSDsluCounter, 6678 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8908 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:10:33,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8908 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:10:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-10-15 21:10:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2897. [2022-10-15 21:10:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2106 states have (on average 1.3983855650522317) internal successors, (2945), 2271 states have internal predecessors, (2945), 544 states have call successors, (544), 138 states have call predecessors, (544), 136 states have return successors, (560), 514 states have call predecessors, (560), 544 states have call successors, (560) [2022-10-15 21:10:33,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4049 transitions. [2022-10-15 21:10:33,809 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4049 transitions. Word has length 51 [2022-10-15 21:10:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:10:33,809 INFO L495 AbstractCegarLoop]: Abstraction has 2897 states and 4049 transitions. [2022-10-15 21:10:33,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 21:10:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4049 transitions. [2022-10-15 21:10:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-15 21:10:33,814 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:10:33,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:33,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 21:10:33,816 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 125 more)] === [2022-10-15 21:10:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:10:33,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1965634888, now seen corresponding path program 1 times [2022-10-15 21:10:33,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:10:33,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99881712] [2022-10-15 21:10:33,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:10:33,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:10:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:10:34,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:10:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:10:34,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:10:34,320 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:10:34,321 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 128 remaining) [2022-10-15 21:10:34,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_disconnect_channelErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 128 remaining) [2022-10-15 21:10:34,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_disconnect_channelErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 128 remaining) [2022-10-15 21:10:34,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 128 remaining) [2022-10-15 21:10:34,324 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 128 remaining) [2022-10-15 21:10:34,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 128 remaining) [2022-10-15 21:10:34,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 128 remaining) [2022-10-15 21:10:34,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 128 remaining) [2022-10-15 21:10:34,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_xmit_processErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 128 remaining) [2022-10-15 21:10:34,325 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 128 remaining) [2022-10-15 21:10:34,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_module_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 128 remaining) [2022-10-15 21:10:34,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location net_genericErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 128 remaining) [2022-10-15 21:10:34,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location net_genericErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 128 remaining) [2022-10-15 21:10:34,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 128 remaining) [2022-10-15 21:10:34,326 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 128 remaining) [2022-10-15 21:10:34,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 128 remaining) [2022-10-15 21:10:34,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 128 remaining) [2022-10-15 21:10:34,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 128 remaining) [2022-10-15 21:10:34,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 128 remaining) [2022-10-15 21:10:34,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 128 remaining) [2022-10-15 21:10:34,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 128 remaining) [2022-10-15 21:10:34,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 128 remaining) [2022-10-15 21:10:34,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 128 remaining) [2022-10-15 21:10:34,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 128 remaining) [2022-10-15 21:10:34,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 128 remaining) [2022-10-15 21:10:34,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 128 remaining) [2022-10-15 21:10:34,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 128 remaining) [2022-10-15 21:10:34,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 128 remaining) [2022-10-15 21:10:34,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 128 remaining) [2022-10-15 21:10:34,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 128 remaining) [2022-10-15 21:10:34,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 128 remaining) [2022-10-15 21:10:34,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 128 remaining) [2022-10-15 21:10:34,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 128 remaining) [2022-10-15 21:10:34,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 128 remaining) [2022-10-15 21:10:34,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 128 remaining) [2022-10-15 21:10:34,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 128 remaining) [2022-10-15 21:10:34,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 128 remaining) [2022-10-15 21:10:34,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 128 remaining) [2022-10-15 21:10:34,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 128 remaining) [2022-10-15 21:10:34,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 128 remaining) [2022-10-15 21:10:34,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 128 remaining) [2022-10-15 21:10:34,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 128 remaining) [2022-10-15 21:10:34,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 128 remaining) [2022-10-15 21:10:34,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 128 remaining) [2022-10-15 21:10:34,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 128 remaining) [2022-10-15 21:10:34,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 128 remaining) [2022-10-15 21:10:34,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 128 remaining) [2022-10-15 21:10:34,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 128 remaining) [2022-10-15 21:10:34,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 128 remaining) [2022-10-15 21:10:34,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 128 remaining) [2022-10-15 21:10:34,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 128 remaining) [2022-10-15 21:10:34,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 128 remaining) [2022-10-15 21:10:34,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 128 remaining) [2022-10-15 21:10:34,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 128 remaining) [2022-10-15 21:10:34,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 128 remaining) [2022-10-15 21:10:34,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 128 remaining) [2022-10-15 21:10:34,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 128 remaining) [2022-10-15 21:10:34,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 128 remaining) [2022-10-15 21:10:34,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 128 remaining) [2022-10-15 21:10:34,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 128 remaining) [2022-10-15 21:10:34,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 128 remaining) [2022-10-15 21:10:34,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 128 remaining) [2022-10-15 21:10:34,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 128 remaining) [2022-10-15 21:10:34,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 128 remaining) [2022-10-15 21:10:34,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 128 remaining) [2022-10-15 21:10:34,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 128 remaining) [2022-10-15 21:10:34,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 128 remaining) [2022-10-15 21:10:34,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 128 remaining) [2022-10-15 21:10:34,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 128 remaining) [2022-10-15 21:10:34,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 128 remaining) [2022-10-15 21:10:34,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 128 remaining) [2022-10-15 21:10:34,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 128 remaining) [2022-10-15 21:10:34,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 128 remaining) [2022-10-15 21:10:34,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 128 remaining) [2022-10-15 21:10:34,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 128 remaining) [2022-10-15 21:10:34,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 128 remaining) [2022-10-15 21:10:34,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 128 remaining) [2022-10-15 21:10:34,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 128 remaining) [2022-10-15 21:10:34,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 128 remaining) [2022-10-15 21:10:34,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 128 remaining) [2022-10-15 21:10:34,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 128 remaining) [2022-10-15 21:10:34,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 128 remaining) [2022-10-15 21:10:34,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_pushErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 128 remaining) [2022-10-15 21:10:34,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fswab16Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 128 remaining) [2022-10-15 21:10:34,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fswab16Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 128 remaining) [2022-10-15 21:10:34,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 128 remaining) [2022-10-15 21:10:34,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 128 remaining) [2022-10-15 21:10:34,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 128 remaining) [2022-10-15 21:10:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 128 remaining) [2022-10-15 21:10:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ioctlErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 128 remaining) [2022-10-15 21:10:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 128 remaining) [2022-10-15 21:10:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 128 remaining) [2022-10-15 21:10:34,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 128 remaining) [2022-10-15 21:10:34,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 128 remaining) [2022-10-15 21:10:34,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 128 remaining) [2022-10-15 21:10:34,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 128 remaining) [2022-10-15 21:10:34,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 128 remaining) [2022-10-15 21:10:34,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ppp_ccp_peekErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location find_compressorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location find_compressorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 128 remaining) [2022-10-15 21:10:34,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 128 remaining) [2022-10-15 21:10:34,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 128 remaining) [2022-10-15 21:10:34,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 128 remaining) [2022-10-15 21:10:34,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 128 remaining) [2022-10-15 21:10:34,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 128 remaining) [2022-10-15 21:10:34,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 128 remaining) [2022-10-15 21:10:34,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 128 remaining) [2022-10-15 21:10:34,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 128 remaining) [2022-10-15 21:10:34,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 128 remaining) [2022-10-15 21:10:34,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 128 remaining) [2022-10-15 21:10:34,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:10:34,353 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:10:34,359 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:10:34,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:10:34 BoogieIcfgContainer [2022-10-15 21:10:34,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:10:34,497 INFO L158 Benchmark]: Toolchain (without parser) took 37116.92ms. Allocated memory was 151.0MB in the beginning and 620.8MB in the end (delta: 469.8MB). Free memory was 113.1MB in the beginning and 407.9MB in the end (delta: -294.8MB). Peak memory consumption was 175.1MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,498 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:10:34,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3545.43ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 113.0MB in the beginning and 93.8MB in the end (delta: 19.2MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,500 INFO L158 Benchmark]: Boogie Procedure Inliner took 408.84ms. Allocated memory is still 205.5MB. Free memory was 93.8MB in the beginning and 131.1MB in the end (delta: -37.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,501 INFO L158 Benchmark]: Boogie Preprocessor took 293.41ms. Allocated memory is still 205.5MB. Free memory was 131.1MB in the beginning and 103.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,501 INFO L158 Benchmark]: RCFGBuilder took 6899.55ms. Allocated memory was 205.5MB in the beginning and 407.9MB in the end (delta: 202.4MB). Free memory was 103.8MB in the beginning and 308.1MB in the end (delta: -204.3MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,501 INFO L158 Benchmark]: TraceAbstraction took 25953.81ms. Allocated memory was 407.9MB in the beginning and 620.8MB in the end (delta: 212.9MB). Free memory was 307.6MB in the beginning and 407.9MB in the end (delta: -100.3MB). Peak memory consumption was 112.0MB. Max. memory is 8.0GB. [2022-10-15 21:10:34,504 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.24ms. Allocated memory is still 151.0MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3545.43ms. Allocated memory was 151.0MB in the beginning and 205.5MB in the end (delta: 54.5MB). Free memory was 113.0MB in the beginning and 93.8MB in the end (delta: 19.2MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 408.84ms. Allocated memory is still 205.5MB. Free memory was 93.8MB in the beginning and 131.1MB in the end (delta: -37.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 293.41ms. Allocated memory is still 205.5MB. Free memory was 131.1MB in the beginning and 103.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * RCFGBuilder took 6899.55ms. Allocated memory was 205.5MB in the beginning and 407.9MB in the end (delta: 202.4MB). Free memory was 103.8MB in the beginning and 308.1MB in the end (delta: -204.3MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. * TraceAbstraction took 25953.81ms. Allocated memory was 407.9MB in the beginning and 620.8MB in the end (delta: 212.9MB). Free memory was 307.6MB in the beginning and 407.9MB in the end (delta: -100.3MB). Peak memory consumption was 112.0MB. Max. memory is 8.0GB. * 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: 5595]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 6167, overapproximation of bitwiseOr at line 5150, overapproximation of bitwiseAnd at line 5595. Possible FailurePath: [L6164-L6171] static struct mutex ppp_mutex = {{1}, {{{{0U}, 3735899821U, 4294967295U, (void *)0x0fffffffffffffffUL, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "ppp_mutex.wait_lock", 0, 0UL}}}}, {& ppp_mutex.wait_list, & ppp_mutex.wait_list}, (struct task_struct *)0, (char const *)0, (void *)(& ppp_mutex), {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "ppp_mutex", 0, 0UL}}; [L6172] static atomic_t ppp_unit_count = {0}; [L6173] static atomic_t channel_count = {0}; [L6174] static int ppp_net_id ; [L6207] static struct class *ppp_class ; [L6268-L6269] static int const npindex_to_proto[6U] = { (int const )33, (int const )87, (int const )43, (int const )41, (int const )641, (int const )643}; [L6313-L6314] static int const npindex_to_ethertype[6U] = { (int const )2048, (int const )34525, (int const )33079, (int const )16, (int const )34887, (int const )34888}; [L7621-L7646] static struct file_operations const ppp_device_fops = {& __this_module, & noop_llseek, & ppp_read, & ppp_write, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (ssize_t (*)(struct kiocb * , struct iovec const * , unsigned long , loff_t ))0, (int (*)(struct file * , void * , int (*)(void * , char const * , int , loff_t , u64 , unsigned int ) ))0, & ppp_poll, & ppp_ioctl, (long (*)(struct file * , unsigned int , unsigned long ))0, (int (*)(struct file * , struct vm_area_struct * ))0, & ppp_open, (int (*)(struct file * , fl_owner_t ))0, & ppp_release, (int (*)(struct file * , int ))0, (int (*)(struct kiocb * , int ))0, (int (*)(int , struct file * , int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct file * , struct page * , int , size_t , loff_t * , int ))0, (unsigned long (*)(struct file * , unsigned long , unsigned long , unsigned long , unsigned long ))0, (int (*)(int ))0, (int (*)(struct file * , int , struct file_lock * ))0, (ssize_t (*)(struct pipe_inode_info * , struct file * , loff_t * , size_t , unsigned int ))0, (ssize_t (*)(struct file * , loff_t * , struct pipe_inode_info * , size_t , unsigned int ))0, (int (*)(struct file * , long , struct file_lock ** ))0, (long (*)(struct file * , int , loff_t , loff_t ))0}; [L7679-L7680] static struct pernet_operations ppp_net_ops = {{(struct list_head *)0, (struct list_head *)0}, & ppp_init_net, & ppp_exit_net, (void (*)(struct list_head * ))0, & ppp_net_id, 376UL}; [L7891-L7927] static struct net_device_ops const ppp_netdev_ops = {(int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (int (*)(struct net_device * ))0, (int (*)(struct net_device * ))0, & ppp_start_xmit, (u16 (*)(struct net_device * , struct sk_buff * ))0, (void (*)(struct net_device * , int ))0, (void (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (int (*)(struct net_device * , void * ))0, (int (*)(struct net_device * ))0, & ppp_net_ioctl, (int (*)(struct net_device * , struct ifmap * ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct neigh_parms * ))0, (void (*)(struct net_device * ))0, (struct rtnl_link_stats64 *(*)(struct net_device * , struct rtnl_link_stats64 * ))0, (struct net_device_stats *(*)(struct net_device * ))0, (void (*)(struct net_device * , struct vlan_group * ))0, (void (*)(struct net_device * , unsigned short ))0, (void (*)(struct net_device * , unsigned short ))0, (void (*)(struct net_device * ))0, (int (*)(struct net_device * , struct netpoll_info * ))0, (void (*)(struct net_device * ))0, (int (*)(struct net_device * , int , u8 * ))0, (int (*)(struct net_device * , int , u16 , u8 ))0, (int (*)(struct net_device * , int , int ))0, (int (*)(struct net_device * , int , struct ifla_vf_info * ))0, (int (*)(struct net_device * , int , struct nlattr ** ))0, (int (*)(struct net_device * , int , struct sk_buff * ))0, (int (*)(struct net_device * , u8 ))0, (int (*)(struct net_device * ))0, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , u16 , struct scatterlist * , unsigned int ))0, (int (*)(struct net_device * , u16 ))0, (int (*)(struct net_device * , u16 , struct scatterlist * , unsigned int ))0, (int (*)(struct net_device * , u64 * , int ))0, (int (*)(struct net_device * , struct sk_buff const * , u16 , u32 ))0, (int (*)(struct net_device * , struct net_device * ))0, (int (*)(struct net_device * , struct net_device * ))0, (u32 (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , u32 ))0}; [L8312] static bool mp_protocol_compress = (bool )1; [L9989] static struct list_head compressor_list = {& compressor_list, & compressor_list}; [L9990-L9994] static spinlock_t compressor_list_lock = {{{{0U}, 3735899821U, 4294967295U, (void *)0x0fffffffffffffffUL, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "compressor_list_lock", 0, 0UL}}}}; [L10620] int LDV_IN_INTERRUPT ; [L10813] int ldv_module_refcounter = 1; VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=0, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L10622] struct file *var_group1 ; [L10623] char *var_ppp_read_5_p1 ; [L10624] size_t var_ppp_read_5_p2 ; [L10625] loff_t *var_ppp_read_5_p3 ; [L10626] ssize_t res_ppp_read_5 ; [L10627] char const *var_ppp_write_6_p1 ; [L10628] size_t var_ppp_write_6_p2 ; [L10629] loff_t *var_ppp_write_6_p3 ; [L10630] ssize_t res_ppp_write_6 ; [L10631] poll_table *var_ppp_poll_7_p1 ; [L10632] unsigned int var_ppp_ioctl_9_p1 ; [L10633] unsigned long var_ppp_ioctl_9_p2 ; [L10634] struct inode *var_group2 ; [L10635] int res_ppp_open_3 ; [L10636] struct net *var_group3 ; [L10637] struct sk_buff *var_group4 ; [L10638] struct net_device *var_group5 ; [L10639] struct ifreq *var_group6 ; [L10640] int var_ppp_net_ioctl_15_p2 ; [L10641] int ldv_s_ppp_device_fops_file_operations ; [L10642] int tmp ; [L10643] int tmp___0 ; [L10644] int tmp___1 ; [L10647] ldv_s_ppp_device_fops_file_operations = 0 [L10648] LDV_IN_INTERRUPT = 1 [L10649] FCALL ldv_initialize() [L10650] CALL, EXPR ppp_init() [L7682] int err ; [L7683] struct lock_class_key __key ; [L7684] struct class *tmp ; [L7685] long tmp___0 ; [L7686] long tmp___1 ; [L7690] CALL, EXPR register_pernet_device(& ppp_net_ops) [L11180] return __VERIFIER_nondet_int(); [L7690] RET, EXPR register_pernet_device(& ppp_net_ops) [L7690] err = register_pernet_device(& ppp_net_ops) [L7692] COND FALSE !(err != 0) [L7700] CALL, EXPR register_chrdev(108U, "ppp", & ppp_device_fops) [L5879] int tmp ; [L5882] CALL, EXPR __register_chrdev(major, 0U, 256U, name, fops) [L11003] return __VERIFIER_nondet_int(); [L5882] RET, EXPR __register_chrdev(major, 0U, 256U, name, fops) [L5882] tmp = __register_chrdev(major, 0U, 256U, name, fops) [L5884] return (tmp); VAL [\old(major)=108, \result=0, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, fops={66:0}, fops={66:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, major=108, mp_protocol_compress=1, name={18:0}, name={18:0}, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0] [L7700] RET, EXPR register_chrdev(108U, "ppp", & ppp_device_fops) [L7700] err = register_chrdev(108U, "ppp", & ppp_device_fops) [L7702] COND FALSE !(err != 0) [L7710] CALL, EXPR __class_create(& __this_module, "ppp", & __key) [L10972] CALL, EXPR ldv_malloc(sizeof(struct class)) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L10957] COND TRUE __VERIFIER_nondet_bool() [L10957] return 0; VAL [\old(size)=64, \result={0:0}, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, size=64] [L10972] RET, EXPR ldv_malloc(sizeof(struct class)) VAL [__this_module={4294967298:4294967296}, arg0={4294967298:4294967296}, arg0={4294967298:4294967296}, arg1={20:0}, arg1={20:0}, arg2={71:0}, arg2={71:0}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct class))={0:0}, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L10972] return ldv_malloc(sizeof(struct class)); [L7710] RET, EXPR __class_create(& __this_module, "ppp", & __key) [L7710] tmp = __class_create(& __this_module, "ppp", & __key) [L7711] ppp_class = tmp VAL [__key={71:0}, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, err=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp={0:0}] [L7712] CALL, EXPR IS_ERR((void const *)ppp_class) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, ptr={0:0}] [L5217] long tmp ; [L5220] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L5222] return (tmp); VAL [\result=0, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, ptr={0:0}, ptr={0:0}, tmp=0] [L7712] RET, EXPR IS_ERR((void const *)ppp_class) VAL [__key={71:0}, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, err=0, IS_ERR((void const *)ppp_class)=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp={0:0}] [L7712] tmp___1 = IS_ERR((void const *)ppp_class) [L7714] COND FALSE !(tmp___1 != 0L) [L7725] return (0); [L7725] return (0); VAL [\result=0, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, err=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp={0:0}, tmp___1=0] [L10650] RET, EXPR ppp_init() [L10650] tmp = ppp_init() [L10652] COND FALSE !(tmp != 0) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0] [L10784] tmp___1 = __VERIFIER_nondet_int() [L10786] COND TRUE tmp___1 != 0 VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___1=1] [L10659] tmp___0 = __VERIFIER_nondet_int() [L10661] COND FALSE !(tmp___0 == 0) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10664] COND FALSE !(tmp___0 == 1) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10667] COND FALSE !(tmp___0 == 2) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10670] COND FALSE !(tmp___0 == 3) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10673] COND FALSE !(tmp___0 == 4) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10676] COND FALSE !(tmp___0 == 5) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10679] COND FALSE !(tmp___0 == 6) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10682] COND FALSE !(tmp___0 == 7) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10685] COND TRUE tmp___0 == 8 VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, ldv_s_ppp_device_fops_file_operations=0, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, tmp=0, tmp___0=8, tmp___1=1] [L10768] CALL ppp_start_xmit(var_group4, var_group5) [L7739] struct ppp *ppp ; [L7740] void *tmp ; [L7741] int npi ; [L7742] int proto ; [L7743] unsigned char *pp ; [L7744] __u16 tmp___0 ; [L7745] int tmp___1 ; VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}] [L7748] CALL, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L5952] return ((void *)dev + 2560U); VAL [\result={4294967297:0}, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L7748] RET, EXPR netdev_priv((struct net_device const *)dev) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, netdev_priv((struct net_device const *)dev)={4294967297:0}, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}] [L7748] tmp = netdev_priv((struct net_device const *)dev) [L7749] ppp = (struct ppp *)tmp [L7750] EXPR skb->protocol VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp={4294967297:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, skb->protocol=65288, tmp={4294967297:0}] [L7750] CALL, EXPR __fswab16((__u16 )((int )skb->protocol)) VAL [\old(val)=65288, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L5150] EXPR (int )val << 8 [L5150] return ((__u16 )((int )((short )((int )val << 8)) | (int )((short )((int )val >> 8)))); VAL [\old(val)=65288, \result=2048, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, val=65288] [L7750] RET, EXPR __fswab16((__u16 )((int )skb->protocol)) VAL [__fswab16((__u16 )((int )skb->protocol))=2048, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp={4294967297:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, skb->protocol=65288, tmp={4294967297:0}] [L7750] tmp___0 = __fswab16((__u16 )((int )skb->protocol)) [L7751] CALL, EXPR ethertype_to_npindex((int )tmp___0) [L6273] COND TRUE ethertype == 2048 VAL [\old(ethertype)=2048, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, ethertype=2048, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L6296] return (0); VAL [\old(ethertype)=2048, \result=0, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, ethertype=2048, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}] [L7751] RET, EXPR ethertype_to_npindex((int )tmp___0) [L7751] npi = ethertype_to_npindex((int )tmp___0) [L7753] COND FALSE !(npi < 0) [L7757] EXPR ppp->npmode[npi] VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dev={4294967297:-2560}, dev={4294967297:-2560}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npi=0, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp={4294967297:0}, ppp->npmode[npi]=0, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, tmp={4294967297:0}, tmp___0=2048] [L7757] COND TRUE (int )((unsigned int )ppp->npmode[npi]) == 0 [L7781] CALL skb_cow_head(skb, 4U) [L5860] int tmp ; [L5861] int tmp___0 ; [L5864] CALL skb_header_cloned((struct sk_buff const *)skb) [L5585] int dataref ; [L5586] unsigned char *tmp ; [L5588] EXPR (unsigned char *)skb + 124UL VAL [(unsigned char *)skb + 124UL=257, __this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}] [L5588] COND FALSE !((unsigned int )*((unsigned char *)skb + 124UL) == 0U) [L5593] CALL, EXPR skb_end_pointer(skb) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}] [L5529] EXPR skb->head [L5529] EXPR skb->end [L5529] return ((unsigned char *)skb->head + (unsigned long )skb->end); [L5593] RET, EXPR skb_end_pointer(skb) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, skb_end_pointer(skb)={4294967299:-33}] [L5593] tmp = skb_end_pointer(skb) [L5594] CALL, EXPR atomic_read((atomic_t const *)(& ((struct skb_shared_info *)tmp)->dataref)) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, v={4294967299:0}] [L5228] EXPR v->counter [L5228] return ((int )*((int volatile *)(& v->counter))); [L5594] RET, EXPR atomic_read((atomic_t const *)(& ((struct skb_shared_info *)tmp)->dataref)) VAL [__this_module={4294967298:4294967296}, atomic_read((atomic_t const *)(& ((struct skb_shared_info *)tmp)->dataref))=-2147418113, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, tmp={4294967299:-33}] [L5594] dataref = atomic_read((atomic_t const *)(& ((struct skb_shared_info *)tmp)->dataref)) [L5595] (dataref & 65535) - (dataref >> 16) VAL [__this_module={4294967298:4294967296}, channel_count={62:0}, compressor_list={69:0}, compressor_list_lock={70:0}, dataref=-2147418113, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, mp_protocol_compress=1, npindex_to_ethertype={65:0}, npindex_to_proto={64:0}, ppp_class={0:0}, ppp_device_fops={66:0}, ppp_mutex={60:0}, ppp_net_id={63:0}, ppp_net_ops={67:0}, ppp_netdev_ops={68:0}, ppp_unit_count={61:0}, skb={4294967300:0}, skb={4294967300:0}, tmp={4294967299:-33}] - UnprovableResult [Line: 10463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10463]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8170]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8170]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8021]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8021]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10852]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6158]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6158]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8359]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8359]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8374]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8374]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8376]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8376]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8380]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8380]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8392]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8392]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8405]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8405]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8414]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8414]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8431]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8431]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8450]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8450]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8468]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8468]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8470]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8476]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8476]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8477]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8477]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8478]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8478]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8490]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8492]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8492]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8493]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8497]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8499]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8504]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8504]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8522]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8522]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8536]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8536]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8536]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8536]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8543]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8543]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 8580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5150]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10167]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10167]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10421]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10421]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10428]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10428]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7257]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9871]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9871]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9871]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9871]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9872]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9872]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9879]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 9879]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10832]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10832]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10703]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10703]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10718]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10733]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 10733]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5595]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5851]: 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 97 procedures, 1718 locations, 128 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3857 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3655 mSDsluCounter, 92480 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62522 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2029 IncrementalHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 29958 mSDtfsCounter, 2029 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2897occurred in iteration=12, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 397 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2127 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 34/42 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-15 21:10:34,567 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...