/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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:07:01,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:07:01,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:07:01,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:07:01,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:07:01,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:07:01,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:07:01,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:07:01,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:07:01,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:07:01,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:07:01,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:07:01,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:07:01,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:07:01,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:07:01,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:07:01,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:07:01,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:07:01,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:07:01,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:07:01,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:07:01,650 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:07:01,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:07:01,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:07:01,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:07:01,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:07:01,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:07:01,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:07:01,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:07:01,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:07:01,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:07:01,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:07:01,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:07:01,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:07:01,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:07:01,668 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:07:01,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:07:01,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:07:01,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:07:01,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:07:01,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:07:01,674 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:07:01,708 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:07:01,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:07:01,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:07:01,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:07:01,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:07:01,711 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:07:01,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:07:01,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:07:01,712 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:07:01,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:07:01,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:07:01,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:07:01,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:07:01,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:07:01,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:07:01,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:07:01,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:07:01,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:07:01,715 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:07:01,715 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:07:01,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:07:01,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:07:01,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:07:01,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:07:01,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:07:01,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:07:01,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:07:01,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:07:01,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:07:01,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:07:01,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:07:01,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:07:01,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:07:01,719 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:07:02,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:07:02,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:07:02,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:07:02,218 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:07:02,219 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:07:02,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i [2022-10-15 21:07:02,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c7d71b0/e1af86f2bb034dcfa281646c34977176/FLAGf04425082 [2022-10-15 21:07:03,848 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:07:03,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i [2022-10-15 21:07:03,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c7d71b0/e1af86f2bb034dcfa281646c34977176/FLAGf04425082 [2022-10-15 21:07:04,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78c7d71b0/e1af86f2bb034dcfa281646c34977176 [2022-10-15 21:07:04,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:07:04,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:07:04,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:07:04,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:07:04,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:07:04,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:07:04" (1/1) ... [2022-10-15 21:07:04,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287abcb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:04, skipping insertion in model container [2022-10-15 21:07:04,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:07:04" (1/1) ... [2022-10-15 21:07:04,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:07:04,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:07:06,194 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i[222523,222536] [2022-10-15 21:07:06,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:07:06,414 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:07:07,135 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i[222523,222536] [2022-10-15 21:07:07,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:07:07,211 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:07:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07 WrapperNode [2022-10-15 21:07:07,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:07:07,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:07:07,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:07:07,215 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:07:07,227 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:07:07" (1/1) ... [2022-10-15 21:07:07,306 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:07:07" (1/1) ... [2022-10-15 21:07:07,408 INFO L138 Inliner]: procedures = 127, calls = 967, calls flagged for inlining = 54, calls inlined = 42, statements flattened = 903 [2022-10-15 21:07:07,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:07:07,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:07:07,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:07:07,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:07:07,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,620 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:07:07,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:07:07,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:07:07,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:07:07,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (1/1) ... [2022-10-15 21:07:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:07:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:07,720 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:07:07,739 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:07:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-10-15 21:07:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-10-15 21:07:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure flexcop_device_exit [2022-10-15 21:07:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure flexcop_device_exit [2022-10-15 21:07:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-10-15 21:07:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-10-15 21:07:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:07:07,844 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-10-15 21:07:07,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-10-15 21:07:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:07:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:07:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure flexcop_usb_exit [2022-10-15 21:07:07,845 INFO L138 BoogieDeclarations]: Found implementation of procedure flexcop_usb_exit [2022-10-15 21:07:07,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:07:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:07:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:07:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-15 21:07:07,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-15 21:07:07,846 INFO L130 BoogieDeclarations]: Found specification of procedure flexcop_device_kfree [2022-10-15 21:07:07,847 INFO L138 BoogieDeclarations]: Found implementation of procedure flexcop_device_kfree [2022-10-15 21:07:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:07:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:07:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:07:07,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:07:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure flexcop_usb_transfer_exit [2022-10-15 21:07:07,848 INFO L138 BoogieDeclarations]: Found implementation of procedure flexcop_usb_transfer_exit [2022-10-15 21:07:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:07:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-10-15 21:07:07,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-10-15 21:07:07,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:07:07,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:07:07,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:07:08,726 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:07:08,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:07:11,486 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:07:11,501 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:07:11,502 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:07:11,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:07:11 BoogieIcfgContainer [2022-10-15 21:07:11,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:07:11,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:07:11,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:07:11,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:07:11,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:07:04" (1/3) ... [2022-10-15 21:07:11,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae36d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:07:11, skipping insertion in model container [2022-10-15 21:07:11,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:07" (2/3) ... [2022-10-15 21:07:11,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae36d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:07:11, skipping insertion in model container [2022-10-15 21:07:11,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:07:11" (3/3) ... [2022-10-15 21:07:11,521 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--media--usb--b2c2--b2c2-flexcop-usb.ko-main.cil.out.i [2022-10-15 21:07:11,552 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:07:11,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-10-15 21:07:11,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:07:11,647 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;@1125590c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:07:11,648 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-10-15 21:07:11,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 237 states have internal predecessors, (305), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-10-15 21:07:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 21:07:11,669 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:11,670 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] [2022-10-15 21:07:11,670 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:11,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:11,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1694574358, now seen corresponding path program 1 times [2022-10-15 21:07:11,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:11,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320880740] [2022-10-15 21:07:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 21:07:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:12,474 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:07:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:12,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320880740] [2022-10-15 21:07:12,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320880740] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:12,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:12,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123449553] [2022-10-15 21:07:12,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:12,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:12,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:12,533 INFO L87 Difference]: Start difference. First operand has 268 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 237 states have internal predecessors, (305), 24 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:07:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:13,056 INFO L93 Difference]: Finished difference Result 554 states and 748 transitions. [2022-10-15 21:07:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:13,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-10-15 21:07:13,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:13,079 INFO L225 Difference]: With dead ends: 554 [2022-10-15 21:07:13,079 INFO L226 Difference]: Without dead ends: 260 [2022-10-15 21:07:13,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:07:13,092 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 106 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:13,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 773 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:07:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-10-15 21:07:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2022-10-15 21:07:13,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 208 states have (on average 1.4134615384615385) internal successors, (294), 227 states have internal predecessors, (294), 21 states have call successors, (21), 10 states have call predecessors, (21), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-10-15 21:07:13,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 336 transitions. [2022-10-15 21:07:13,186 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 336 transitions. Word has length 20 [2022-10-15 21:07:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:13,187 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 336 transitions. [2022-10-15 21:07:13,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:07:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 336 transitions. [2022-10-15 21:07:13,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 21:07:13,190 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:13,191 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:13,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:07:13,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:13,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1915533527, now seen corresponding path program 1 times [2022-10-15 21:07:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:13,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589246491] [2022-10-15 21:07:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:13,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:07:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:13,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589246491] [2022-10-15 21:07:13,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589246491] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:13,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:13,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:13,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284640896] [2022-10-15 21:07:13,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:13,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:13,589 INFO L87 Difference]: Start difference. First operand 257 states and 336 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:07:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:14,075 INFO L93 Difference]: Finished difference Result 515 states and 677 transitions. [2022-10-15 21:07:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 32 [2022-10-15 21:07:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:14,082 INFO L225 Difference]: With dead ends: 515 [2022-10-15 21:07:14,083 INFO L226 Difference]: Without dead ends: 511 [2022-10-15 21:07:14,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:07:14,086 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 396 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:14,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 730 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:07:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-10-15 21:07:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 493. [2022-10-15 21:07:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 413 states have (on average 1.4067796610169492) internal successors, (581), 434 states have internal predecessors, (581), 42 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2022-10-15 21:07:14,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2022-10-15 21:07:14,202 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 32 [2022-10-15 21:07:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:14,204 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2022-10-15 21:07:14,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:07:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2022-10-15 21:07:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:07:14,210 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:14,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:14,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:07:14,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 536371035, now seen corresponding path program 1 times [2022-10-15 21:07:14,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:14,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756647285] [2022-10-15 21:07:14,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:14,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:14,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:07:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:14,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756647285] [2022-10-15 21:07:14,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756647285] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:14,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:14,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205922523] [2022-10-15 21:07:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:14,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:14,643 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 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:07:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:14,952 INFO L93 Difference]: Finished difference Result 1060 states and 1423 transitions. [2022-10-15 21:07:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 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 35 [2022-10-15 21:07:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:14,959 INFO L225 Difference]: With dead ends: 1060 [2022-10-15 21:07:14,960 INFO L226 Difference]: Without dead ends: 570 [2022-10-15 21:07:14,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:07:14,964 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 342 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:14,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 642 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-10-15 21:07:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 560. [2022-10-15 21:07:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 471 states have (on average 1.3991507430997876) internal successors, (659), 492 states have internal predecessors, (659), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:07:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 745 transitions. [2022-10-15 21:07:15,019 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 745 transitions. Word has length 35 [2022-10-15 21:07:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:15,020 INFO L495 AbstractCegarLoop]: Abstraction has 560 states and 745 transitions. [2022-10-15 21:07:15,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 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:07:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 745 transitions. [2022-10-15 21:07:15,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-10-15 21:07:15,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:15,023 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:15,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:07:15,024 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1904645204, now seen corresponding path program 1 times [2022-10-15 21:07:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:15,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261156825] [2022-10-15 21:07:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:15,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:15,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-15 21:07:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:07:15,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:15,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261156825] [2022-10-15 21:07:15,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261156825] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:15,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:15,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:07:15,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932265750] [2022-10-15 21:07:15,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:15,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:07:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:15,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:07:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:07:15,311 INFO L87 Difference]: Start difference. First operand 560 states and 745 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:07:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:15,919 INFO L93 Difference]: Finished difference Result 1338 states and 1767 transitions. [2022-10-15 21:07:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:07:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-10-15 21:07:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:15,928 INFO L225 Difference]: With dead ends: 1338 [2022-10-15 21:07:15,929 INFO L226 Difference]: Without dead ends: 1000 [2022-10-15 21:07:15,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:07:15,932 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 366 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:15,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1557 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:07:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-10-15 21:07:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 564. [2022-10-15 21:07:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 475 states have (on average 1.3957894736842105) internal successors, (663), 496 states have internal predecessors, (663), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:07:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 749 transitions. [2022-10-15 21:07:15,989 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 749 transitions. Word has length 50 [2022-10-15 21:07:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:15,990 INFO L495 AbstractCegarLoop]: Abstraction has 564 states and 749 transitions. [2022-10-15 21:07:15,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:07:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 749 transitions. [2022-10-15 21:07:15,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-15 21:07:15,993 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:15,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:15,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:07:15,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:15,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:15,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1848415247, now seen corresponding path program 1 times [2022-10-15 21:07:15,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:15,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794322988] [2022-10-15 21:07:15,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:15,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:07:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:07:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:16,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794322988] [2022-10-15 21:07:16,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794322988] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:16,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:16,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459917086] [2022-10-15 21:07:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:16,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:16,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:16,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:16,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:16,288 INFO L87 Difference]: Start difference. First operand 564 states and 749 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:07:16,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:16,555 INFO L93 Difference]: Finished difference Result 1145 states and 1527 transitions. [2022-10-15 21:07:16,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:16,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-10-15 21:07:16,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:16,561 INFO L225 Difference]: With dead ends: 1145 [2022-10-15 21:07:16,561 INFO L226 Difference]: Without dead ends: 597 [2022-10-15 21:07:16,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:07:16,565 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 85 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:16,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 731 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-10-15 21:07:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 591. [2022-10-15 21:07:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 502 states have (on average 1.3864541832669324) internal successors, (696), 523 states have internal predecessors, (696), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:07:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 782 transitions. [2022-10-15 21:07:16,619 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 782 transitions. Word has length 62 [2022-10-15 21:07:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:16,620 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 782 transitions. [2022-10-15 21:07:16,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:07:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 782 transitions. [2022-10-15 21:07:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-10-15 21:07:16,622 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:16,623 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:16,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:07:16,623 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:16,624 INFO L85 PathProgramCache]: Analyzing trace with hash 948657256, now seen corresponding path program 1 times [2022-10-15 21:07:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966292233] [2022-10-15 21:07:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:16,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:07:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 21:07:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:16,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966292233] [2022-10-15 21:07:16,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966292233] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:16,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:16,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616816042] [2022-10-15 21:07:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:16,976 INFO L87 Difference]: Start difference. First operand 591 states and 782 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:07:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:17,232 INFO L93 Difference]: Finished difference Result 597 states and 790 transitions. [2022-10-15 21:07:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 67 [2022-10-15 21:07:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:17,240 INFO L225 Difference]: With dead ends: 597 [2022-10-15 21:07:17,240 INFO L226 Difference]: Without dead ends: 596 [2022-10-15 21:07:17,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:07:17,249 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 75 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:17,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 729 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:17,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-10-15 21:07:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 590. [2022-10-15 21:07:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 502 states have (on average 1.3804780876494025) internal successors, (693), 522 states have internal predecessors, (693), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:07:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 779 transitions. [2022-10-15 21:07:17,318 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 779 transitions. Word has length 67 [2022-10-15 21:07:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:17,321 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 779 transitions. [2022-10-15 21:07:17,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:07:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 779 transitions. [2022-10-15 21:07:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 21:07:17,325 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:17,326 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:17,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:07:17,326 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash -291629634, now seen corresponding path program 1 times [2022-10-15 21:07:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:17,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709786429] [2022-10-15 21:07:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:17,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:07:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-15 21:07:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 21:07:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:17,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709786429] [2022-10-15 21:07:17,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709786429] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:17,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:17,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965774071] [2022-10-15 21:07:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:17,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:17,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:17,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:17,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:17,814 INFO L87 Difference]: Start difference. First operand 590 states and 779 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 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:07:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:18,151 INFO L93 Difference]: Finished difference Result 940 states and 1225 transitions. [2022-10-15 21:07:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 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 68 [2022-10-15 21:07:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:18,157 INFO L225 Difference]: With dead ends: 940 [2022-10-15 21:07:18,158 INFO L226 Difference]: Without dead ends: 585 [2022-10-15 21:07:18,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:07:18,163 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 208 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:18,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 783 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-10-15 21:07:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 577. [2022-10-15 21:07:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 489 states have (on average 1.3701431492842535) internal successors, (670), 509 states have internal predecessors, (670), 43 states have call successors, (43), 28 states have call predecessors, (43), 28 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-10-15 21:07:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 756 transitions. [2022-10-15 21:07:18,242 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 756 transitions. Word has length 68 [2022-10-15 21:07:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:18,242 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 756 transitions. [2022-10-15 21:07:18,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 2 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:07:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 756 transitions. [2022-10-15 21:07:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-10-15 21:07:18,272 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:18,273 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:18,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:07:18,274 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -656396059, now seen corresponding path program 1 times [2022-10-15 21:07:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:18,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389819670] [2022-10-15 21:07:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:18,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:18,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-15 21:07:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 21:07:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:18,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389819670] [2022-10-15 21:07:18,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389819670] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:18,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055969954] [2022-10-15 21:07:18,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:18,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:18,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:18,685 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:07:18,712 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:07:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:19,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:07:19,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:07:19,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:19,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055969954] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:19,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:19,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2022-10-15 21:07:19,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380471264] [2022-10-15 21:07:19,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:19,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:07:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:07:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:07:19,201 INFO L87 Difference]: Start difference. First operand 577 states and 756 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:07:21,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-15 21:07:23,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-15 21:07:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:23,658 INFO L93 Difference]: Finished difference Result 1665 states and 2194 transitions. [2022-10-15 21:07:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 21:07:23,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-10-15 21:07:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:23,669 INFO L225 Difference]: With dead ends: 1665 [2022-10-15 21:07:23,670 INFO L226 Difference]: Without dead ends: 1104 [2022-10-15 21:07:23,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-10-15 21:07:23,674 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 446 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:23,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 2638 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-10-15 21:07:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2022-10-15 21:07:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 585. [2022-10-15 21:07:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 495 states have (on average 1.3656565656565656) internal successors, (676), 515 states have internal predecessors, (676), 45 states have call successors, (45), 28 states have call predecessors, (45), 28 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-10-15 21:07:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 766 transitions. [2022-10-15 21:07:23,794 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 766 transitions. Word has length 68 [2022-10-15 21:07:23,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:23,794 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 766 transitions. [2022-10-15 21:07:23,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 21:07:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 766 transitions. [2022-10-15 21:07:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-15 21:07:23,803 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:23,803 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:23,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 21:07:24,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:24,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:24,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1905328007, now seen corresponding path program 1 times [2022-10-15 21:07:24,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:24,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519072621] [2022-10-15 21:07:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:24,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-15 21:07:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:07:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-15 21:07:24,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:24,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519072621] [2022-10-15 21:07:24,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519072621] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:24,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:24,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 21:07:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925125505] [2022-10-15 21:07:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:24,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:07:24,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:07:24,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:07:24,508 INFO L87 Difference]: Start difference. First operand 585 states and 766 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:26,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-15 21:07:28,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-15 21:07:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:28,939 INFO L93 Difference]: Finished difference Result 1316 states and 1746 transitions. [2022-10-15 21:07:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 76 [2022-10-15 21:07:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:28,947 INFO L225 Difference]: With dead ends: 1316 [2022-10-15 21:07:28,947 INFO L226 Difference]: Without dead ends: 747 [2022-10-15 21:07:28,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:28,951 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 477 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:28,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 832 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 214 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-10-15 21:07:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-10-15 21:07:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 585. [2022-10-15 21:07:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 495 states have (on average 1.3616161616161617) internal successors, (674), 513 states have internal predecessors, (674), 45 states have call successors, (45), 28 states have call predecessors, (45), 28 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-10-15 21:07:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 764 transitions. [2022-10-15 21:07:29,028 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 764 transitions. Word has length 76 [2022-10-15 21:07:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:29,028 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 764 transitions. [2022-10-15 21:07:29,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 764 transitions. [2022-10-15 21:07:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:07:29,030 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:29,031 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:07:29,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:29,032 INFO L85 PathProgramCache]: Analyzing trace with hash 74477910, now seen corresponding path program 1 times [2022-10-15 21:07:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:29,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372838840] [2022-10-15 21:07:29,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:29,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:29,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:29,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-15 21:07:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:07:29,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:29,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372838840] [2022-10-15 21:07:29,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372838840] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:29,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:29,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:29,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934558026] [2022-10-15 21:07:29,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:29,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:29,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:29,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:29,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:29,571 INFO L87 Difference]: Start difference. First operand 585 states and 764 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-15 21:07:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:29,843 INFO L93 Difference]: Finished difference Result 1160 states and 1515 transitions. [2022-10-15 21:07:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 82 [2022-10-15 21:07:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:29,849 INFO L225 Difference]: With dead ends: 1160 [2022-10-15 21:07:29,850 INFO L226 Difference]: Without dead ends: 591 [2022-10-15 21:07:29,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:07:29,854 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 316 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:29,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 493 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:07:29,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-10-15 21:07:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 585. [2022-10-15 21:07:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 495 states have (on average 1.3333333333333333) internal successors, (660), 513 states have internal predecessors, (660), 45 states have call successors, (45), 28 states have call predecessors, (45), 28 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-10-15 21:07:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 750 transitions. [2022-10-15 21:07:29,943 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 750 transitions. Word has length 82 [2022-10-15 21:07:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:29,943 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 750 transitions. [2022-10-15 21:07:29,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-10-15 21:07:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 750 transitions. [2022-10-15 21:07:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-15 21:07:29,946 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:29,946 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:29,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:07:29,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash 735856474, now seen corresponding path program 1 times [2022-10-15 21:07:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:29,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257802666] [2022-10-15 21:07:29,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:29,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:30,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-15 21:07:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:07:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:30,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257802666] [2022-10-15 21:07:30,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257802666] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:30,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:30,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249292724] [2022-10-15 21:07:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:30,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:30,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:30,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:30,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:30,379 INFO L87 Difference]: Start difference. First operand 585 states and 750 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:30,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:30,626 INFO L93 Difference]: Finished difference Result 892 states and 1136 transitions. [2022-10-15 21:07:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-10-15 21:07:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:30,630 INFO L225 Difference]: With dead ends: 892 [2022-10-15 21:07:30,630 INFO L226 Difference]: Without dead ends: 279 [2022-10-15 21:07:30,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:30,633 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:30,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 389 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:30,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-10-15 21:07:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 273. [2022-10-15 21:07:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 229 states have (on average 1.3275109170305677) internal successors, (304), 233 states have internal predecessors, (304), 23 states have call successors, (23), 16 states have call predecessors, (23), 16 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-10-15 21:07:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 350 transitions. [2022-10-15 21:07:30,666 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 350 transitions. Word has length 82 [2022-10-15 21:07:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:30,666 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 350 transitions. [2022-10-15 21:07:30,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 350 transitions. [2022-10-15 21:07:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-10-15 21:07:30,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:30,669 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:30,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 21:07:30,669 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash -851947015, now seen corresponding path program 1 times [2022-10-15 21:07:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:30,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826922980] [2022-10-15 21:07:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:07:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:07:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:07:31,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826922980] [2022-10-15 21:07:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826922980] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053198428] [2022-10-15 21:07:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:31,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:31,167 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:07:31,186 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:07:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:31,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:07:31,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 21:07:31,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:31,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053198428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:31,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:31,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-15 21:07:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408352335] [2022-10-15 21:07:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:31,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:31,616 INFO L87 Difference]: Start difference. First operand 273 states and 350 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-15 21:07:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:31,667 INFO L93 Difference]: Finished difference Result 273 states and 350 transitions. [2022-10-15 21:07:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2022-10-15 21:07:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:31,671 INFO L225 Difference]: With dead ends: 273 [2022-10-15 21:07:31,671 INFO L226 Difference]: Without dead ends: 272 [2022-10-15 21:07:31,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:31,673 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 34 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:31,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 448 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:07:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-10-15 21:07:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 264. [2022-10-15 21:07:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 221 states have (on average 1.330316742081448) internal successors, (294), 224 states have internal predecessors, (294), 23 states have call successors, (23), 16 states have call predecessors, (23), 16 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-10-15 21:07:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 340 transitions. [2022-10-15 21:07:31,705 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 340 transitions. Word has length 88 [2022-10-15 21:07:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:31,706 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 340 transitions. [2022-10-15 21:07:31,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-15 21:07:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 340 transitions. [2022-10-15 21:07:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-15 21:07:31,708 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:31,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:31,761 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:07:31,922 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,SelfDestructingSolverStorable11 [2022-10-15 21:07:31,923 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -797407862, now seen corresponding path program 1 times [2022-10-15 21:07:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:31,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694416997] [2022-10-15 21:07:31,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:07:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:07:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:07:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-15 21:07:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-15 21:07:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 21:07:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-10-15 21:07:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:32,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694416997] [2022-10-15 21:07:32,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694416997] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:32,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387556818] [2022-10-15 21:07:32,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:32,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:32,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:32,471 INFO L229 MonitoredProcess]: Starting monitored process 4 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:07:32,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:07:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:32,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:07:32,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:07:33,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:07:33,281 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-10-15 21:07:33,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387556818] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:07:33,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:07:33,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-10-15 21:07:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855903960] [2022-10-15 21:07:33,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:07:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:07:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:33,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:07:33,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:07:33,294 INFO L87 Difference]: Start difference. First operand 264 states and 340 transitions. Second operand has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 8 states have internal predecessors, (217), 6 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-10-15 21:07:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:34,450 INFO L93 Difference]: Finished difference Result 920 states and 1177 transitions. [2022-10-15 21:07:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 21:07:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 8 states have internal predecessors, (217), 6 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 112 [2022-10-15 21:07:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:34,457 INFO L225 Difference]: With dead ends: 920 [2022-10-15 21:07:34,457 INFO L226 Difference]: Without dead ends: 745 [2022-10-15 21:07:34,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:07:34,459 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 1239 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:34,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 678 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-15 21:07:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-10-15 21:07:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 524. [2022-10-15 21:07:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 443 states have (on average 1.309255079006772) internal successors, (580), 445 states have internal predecessors, (580), 46 states have call successors, (46), 32 states have call predecessors, (46), 32 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-10-15 21:07:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 672 transitions. [2022-10-15 21:07:34,520 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 672 transitions. Word has length 112 [2022-10-15 21:07:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:34,521 INFO L495 AbstractCegarLoop]: Abstraction has 524 states and 672 transitions. [2022-10-15 21:07:34,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.11111111111111) internal successors, (217), 8 states have internal predecessors, (217), 6 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2022-10-15 21:07:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 672 transitions. [2022-10-15 21:07:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-10-15 21:07:34,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:34,523 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:34,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:07:34,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:34,740 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:34,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash -635100397, now seen corresponding path program 1 times [2022-10-15 21:07:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:34,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829068345] [2022-10-15 21:07:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:07:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-15 21:07:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:07:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-10-15 21:07:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-15 21:07:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-15 21:07:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-10-15 21:07:35,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:35,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829068345] [2022-10-15 21:07:35,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829068345] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:35,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117687326] [2022-10-15 21:07:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:35,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:35,549 INFO L229 MonitoredProcess]: Starting monitored process 5 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:07:35,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 21:07:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:35,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:07:35,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 21:07:36,128 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:36,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117687326] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:36,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:36,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-15 21:07:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895759784] [2022-10-15 21:07:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:36,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:36,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:36,131 INFO L87 Difference]: Start difference. First operand 524 states and 672 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:07:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:36,278 INFO L93 Difference]: Finished difference Result 597 states and 769 transitions. [2022-10-15 21:07:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:36,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2022-10-15 21:07:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:36,283 INFO L225 Difference]: With dead ends: 597 [2022-10-15 21:07:36,284 INFO L226 Difference]: Without dead ends: 595 [2022-10-15 21:07:36,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:36,285 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 211 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:36,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 330 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:07:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-10-15 21:07:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 449. [2022-10-15 21:07:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 380 states have (on average 1.2973684210526315) internal successors, (493), 380 states have internal predecessors, (493), 40 states have call successors, (40), 28 states have call predecessors, (40), 28 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-10-15 21:07:36,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 573 transitions. [2022-10-15 21:07:36,341 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 573 transitions. Word has length 118 [2022-10-15 21:07:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:36,342 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 573 transitions. [2022-10-15 21:07:36,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-10-15 21:07:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 573 transitions. [2022-10-15 21:07:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-10-15 21:07:36,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:36,346 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-10-15 21:07:36,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 21:07:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:36,559 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2051079594, now seen corresponding path program 1 times [2022-10-15 21:07:36,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:36,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630671463] [2022-10-15 21:07:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:07:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 21:07:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:07:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-15 21:07:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-15 21:07:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-15 21:07:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:07:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-15 21:07:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-10-15 21:07:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-10-15 21:07:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:37,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630671463] [2022-10-15 21:07:37,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630671463] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:37,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:37,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:37,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698601927] [2022-10-15 21:07:37,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:37,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:37,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:37,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:37,342 INFO L87 Difference]: Start difference. First operand 449 states and 573 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 21:07:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:37,655 INFO L93 Difference]: Finished difference Result 1323 states and 1676 transitions. [2022-10-15 21:07:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 179 [2022-10-15 21:07:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:37,660 INFO L225 Difference]: With dead ends: 1323 [2022-10-15 21:07:37,660 INFO L226 Difference]: Without dead ends: 710 [2022-10-15 21:07:37,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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:07:37,663 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 226 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:37,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 378 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-10-15 21:07:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 693. [2022-10-15 21:07:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 585 states have (on average 1.2854700854700856) internal successors, (752), 585 states have internal predecessors, (752), 63 states have call successors, (63), 44 states have call predecessors, (63), 44 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2022-10-15 21:07:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 878 transitions. [2022-10-15 21:07:37,743 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 878 transitions. Word has length 179 [2022-10-15 21:07:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:37,744 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 878 transitions. [2022-10-15 21:07:37,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-10-15 21:07:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 878 transitions. [2022-10-15 21:07:37,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-10-15 21:07:37,748 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:37,748 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-10-15 21:07:37,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:07:37,749 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2022-10-15 21:07:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:37,749 INFO L85 PathProgramCache]: Analyzing trace with hash 610806038, now seen corresponding path program 1 times [2022-10-15 21:07:37,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:37,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187396670] [2022-10-15 21:07:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:37,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-10-15 21:07:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-10-15 21:07:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-15 21:07:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-15 21:07:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-15 21:07:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-10-15 21:07:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-10-15 21:07:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-15 21:07:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-15 21:07:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-10-15 21:07:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-15 21:07:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-10-15 21:07:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-10-15 21:07:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:38,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187396670] [2022-10-15 21:07:38,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187396670] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:38,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:38,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240455003] [2022-10-15 21:07:38,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:38,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:38,292 INFO L87 Difference]: Start difference. First operand 693 states and 878 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:38,320 INFO L93 Difference]: Finished difference Result 698 states and 883 transitions. [2022-10-15 21:07:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:07:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 179 [2022-10-15 21:07:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:38,321 INFO L225 Difference]: With dead ends: 698 [2022-10-15 21:07:38,321 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:07:38,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:38,324 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:38,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:07:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:07:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:07:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:07:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:07:38,326 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 179 [2022-10-15 21:07:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:38,326 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:07:38,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:07:38,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:07:38,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2022-10-15 21:07:38,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2022-10-15 21:07:38,330 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __create_pipeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2022-10-15 21:07:38,331 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2022-10-15 21:07:38,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2022-10-15 21:07:38,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2022-10-15 21:07:38,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2022-10-15 21:07:38,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2022-10-15 21:07:38,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2022-10-15 21:07:38,333 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2022-10-15 21:07:38,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2022-10-15 21:07:38,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2022-10-15 21:07:38,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2022-10-15 21:07:38,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2022-10-15 21:07:38,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:07:38,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:07:41,172 INFO L899 garLoopResultBuilder]: For program point L6655(line 6655) no Hoare annotation was computed. [2022-10-15 21:07:41,173 INFO L899 garLoopResultBuilder]: For program point L6653-1(lines 6653 6654) no Hoare annotation was computed. [2022-10-15 21:07:41,173 INFO L902 garLoopResultBuilder]: At program point L6653(lines 6653 6654) the Hoare annotation is: true [2022-10-15 21:07:41,173 INFO L899 garLoopResultBuilder]: For program point L6655-2(lines 6655 6659) no Hoare annotation was computed. [2022-10-15 21:07:41,173 INFO L899 garLoopResultBuilder]: For program point get_dma_opsEXIT(lines 6650 6661) no Hoare annotation was computed. [2022-10-15 21:07:41,173 INFO L902 garLoopResultBuilder]: At program point get_dma_opsENTRY(lines 6650 6661) the Hoare annotation is: true [2022-10-15 21:07:41,173 INFO L899 garLoopResultBuilder]: For program point get_dma_opsFINAL(lines 6650 6661) no Hoare annotation was computed. [2022-10-15 21:07:41,174 INFO L902 garLoopResultBuilder]: At program point flexcop_device_kfreeENTRY(lines 8049 8051) the Hoare annotation is: true [2022-10-15 21:07:41,174 INFO L899 garLoopResultBuilder]: For program point flexcop_device_kfreeFINAL(lines 8049 8051) no Hoare annotation was computed. [2022-10-15 21:07:41,174 INFO L899 garLoopResultBuilder]: For program point flexcop_device_kfreeEXIT(lines 8049 8051) no Hoare annotation was computed. [2022-10-15 21:07:41,174 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 6608 6614) the Hoare annotation is: true [2022-10-15 21:07:41,174 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 6608 6614) no Hoare annotation was computed. [2022-10-15 21:07:41,174 INFO L902 garLoopResultBuilder]: At program point L8040(lines 8039 8041) the Hoare annotation is: true [2022-10-15 21:07:41,174 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 6608 6614) no Hoare annotation was computed. [2022-10-15 21:07:41,174 INFO L902 garLoopResultBuilder]: At program point flexcop_device_exitENTRY(lines 8042 8044) the Hoare annotation is: true [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point flexcop_device_exitFINAL(lines 8042 8044) no Hoare annotation was computed. [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point flexcop_device_exitEXIT(lines 8042 8044) no Hoare annotation was computed. [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbFINAL(lines 8107 8109) no Hoare annotation was computed. [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point usb_submit_urbEXIT(lines 8107 8109) no Hoare annotation was computed. [2022-10-15 21:07:41,175 INFO L902 garLoopResultBuilder]: At program point usb_submit_urbENTRY(lines 8107 8109) the Hoare annotation is: true [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point L7232(line 7232) no Hoare annotation was computed. [2022-10-15 21:07:41,175 INFO L899 garLoopResultBuilder]: For program point L6555-1(lines 6555 6556) no Hoare annotation was computed. [2022-10-15 21:07:41,176 INFO L895 garLoopResultBuilder]: At program point L6555(lines 6555 6556) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,176 INFO L895 garLoopResultBuilder]: At program point L6749-2(lines 6727 6757) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,176 INFO L899 garLoopResultBuilder]: For program point L6749(lines 6749 6754) no Hoare annotation was computed. [2022-10-15 21:07:41,176 INFO L899 garLoopResultBuilder]: For program point L7224-2(lines 7224 7227) no Hoare annotation was computed. [2022-10-15 21:07:41,176 INFO L899 garLoopResultBuilder]: For program point L7224(lines 7224 7227) no Hoare annotation was computed. [2022-10-15 21:07:41,176 INFO L899 garLoopResultBuilder]: For program point L6741-1(line 6741) no Hoare annotation was computed. [2022-10-15 21:07:41,176 INFO L895 garLoopResultBuilder]: At program point L6741(line 6741) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,177 INFO L899 garLoopResultBuilder]: For program point flexcop_usb_transfer_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7232) no Hoare annotation was computed. [2022-10-15 21:07:41,177 INFO L895 garLoopResultBuilder]: At program point L6568(lines 6541 6570) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,177 INFO L895 garLoopResultBuilder]: At program point L7237(lines 7219 7246) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,177 INFO L895 garLoopResultBuilder]: At program point L8096(lines 8095 8097) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (= |flexcop_usb_transfer_exit_~i~3#1| 0) (and (<= |flexcop_usb_transfer_exit_~i~3#1| 3) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|))) [2022-10-15 21:07:41,177 INFO L902 garLoopResultBuilder]: At program point L6560(lines 6557 6562) the Hoare annotation is: true [2022-10-15 21:07:41,177 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,178 INFO L895 garLoopResultBuilder]: At program point L7233(lines 7219 7246) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (= |flexcop_usb_transfer_exit_~i~3#1| 0) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,178 INFO L895 garLoopResultBuilder]: At program point L8026(lines 8025 8027) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,178 INFO L899 garLoopResultBuilder]: For program point L6742(lines 6742 6746) no Hoare annotation was computed. [2022-10-15 21:07:41,178 INFO L899 garLoopResultBuilder]: For program point L6775(lines 6775 6779) no Hoare annotation was computed. [2022-10-15 21:07:41,178 INFO L899 garLoopResultBuilder]: For program point flexcop_usb_transfer_exitEXIT(lines 7217 7247) no Hoare annotation was computed. [2022-10-15 21:07:41,178 INFO L895 garLoopResultBuilder]: At program point L6742-2(lines 6742 6746) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,178 INFO L899 garLoopResultBuilder]: For program point L6775-2(lines 6775 6779) no Hoare annotation was computed. [2022-10-15 21:07:41,179 INFO L899 garLoopResultBuilder]: For program point L6747(line 6747) no Hoare annotation was computed. [2022-10-15 21:07:41,179 INFO L895 garLoopResultBuilder]: At program point L8093(lines 8092 8094) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (= |flexcop_usb_transfer_exit_~i~3#1| 0) (and (<= |flexcop_usb_transfer_exit_~i~3#1| 3) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|))) [2022-10-15 21:07:41,179 INFO L899 garLoopResultBuilder]: For program point L6557(lines 6557 6563) no Hoare annotation was computed. [2022-10-15 21:07:41,179 INFO L895 garLoopResultBuilder]: At program point L6574(lines 6571 6576) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,179 INFO L902 garLoopResultBuilder]: At program point flexcop_usb_transfer_exitENTRY(lines 7217 7247) the Hoare annotation is: true [2022-10-15 21:07:41,179 INFO L895 garLoopResultBuilder]: At program point L7235(lines 7219 7246) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (= |flexcop_usb_transfer_exit_~i~3#1| 0) (and (<= |flexcop_usb_transfer_exit_~i~3#1| 3) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|))) [2022-10-15 21:07:41,180 INFO L895 garLoopResultBuilder]: At program point L6781(lines 6771 6783) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,180 INFO L899 garLoopResultBuilder]: For program point L7223(lines 7223 7231) no Hoare annotation was computed. [2022-10-15 21:07:41,180 INFO L899 garLoopResultBuilder]: For program point L7223-2(lines 7223 7231) no Hoare annotation was computed. [2022-10-15 21:07:41,180 INFO L899 garLoopResultBuilder]: For program point L6736-1(line 6736) no Hoare annotation was computed. [2022-10-15 21:07:41,180 INFO L895 garLoopResultBuilder]: At program point L8111(lines 8110 8112) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,180 INFO L895 garLoopResultBuilder]: At program point L6736(line 6736) the Hoare annotation is: (or (not (= ~ldv_state_variable_1~0 2)) (not (= 0 ~debug~0)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_state_variable_0~0 3)) (not (<= ~ref_cnt~0 1)) (<= 1 |flexcop_usb_transfer_exit_~i~3#1|)) [2022-10-15 21:07:41,180 INFO L899 garLoopResultBuilder]: For program point L7240-2(lines 7217 7247) no Hoare annotation was computed. [2022-10-15 21:07:41,180 INFO L899 garLoopResultBuilder]: For program point flexcop_usb_transfer_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7232) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point L7240(lines 7240 7244) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L902 garLoopResultBuilder]: At program point __create_pipeENTRY(lines 6634 6639) the Hoare annotation is: true [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point __create_pipeFINAL(lines 6634 6639) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point L6637-1(line 6637) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point L6637(line 6637) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point __create_pipeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6637) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point __create_pipeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 6637) no Hoare annotation was computed. [2022-10-15 21:07:41,181 INFO L899 garLoopResultBuilder]: For program point __create_pipeEXIT(lines 6634 6639) no Hoare annotation was computed. [2022-10-15 21:07:41,182 INFO L899 garLoopResultBuilder]: For program point L8032(line 8032) no Hoare annotation was computed. [2022-10-15 21:07:41,182 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 8030 8034) the Hoare annotation is: (let ((.cse0 (not (= 0 ~debug~0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= ~ldv_state_variable_0~0 3)))) (and (or (not (= ~ldv_state_variable_1~0 2)) .cse0 (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 (not (<= ~ref_cnt~0 1))) (or .cse0 (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_state_variable_1~0 1)) .cse1 .cse2 (not (<= ~ref_cnt~0 0))))) [2022-10-15 21:07:41,182 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 8030 8034) no Hoare annotation was computed. [2022-10-15 21:07:41,182 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 8030 8034) no Hoare annotation was computed. [2022-10-15 21:07:41,182 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 7668 7673) no Hoare annotation was computed. [2022-10-15 21:07:41,182 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 7668 7673) the Hoare annotation is: true [2022-10-15 21:07:41,183 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 7668 7673) no Hoare annotation was computed. [2022-10-15 21:07:41,183 INFO L902 garLoopResultBuilder]: At program point flexcop_usb_exitENTRY(lines 7382 7388) the Hoare annotation is: true [2022-10-15 21:07:41,183 INFO L899 garLoopResultBuilder]: For program point flexcop_usb_exitEXIT(lines 7382 7388) no Hoare annotation was computed. [2022-10-15 21:07:41,183 INFO L899 garLoopResultBuilder]: For program point flexcop_usb_exitFINAL(lines 7382 7388) no Hoare annotation was computed. [2022-10-15 21:07:41,183 INFO L899 garLoopResultBuilder]: For program point L7385-1(line 7385) no Hoare annotation was computed. [2022-10-15 21:07:41,183 INFO L902 garLoopResultBuilder]: At program point L7385(line 7385) the Hoare annotation is: true [2022-10-15 21:07:41,183 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7285) no Hoare annotation was computed. [2022-10-15 21:07:41,183 INFO L895 garLoopResultBuilder]: At program point L6675(lines 6662 6677) the Hoare annotation is: false [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7341) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L7270(lines 7270 7273) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L7369(line 7369) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L895 garLoopResultBuilder]: At program point L8063(lines 8062 8064) the Hoare annotation is: false [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L6643(line 6643) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L895 garLoopResultBuilder]: At program point L6643-3(lines 6640 6645) the Hoare annotation is: false [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L6643-2(line 6643) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L7337-2(lines 7337 7340) no Hoare annotation was computed. [2022-10-15 21:07:41,184 INFO L899 garLoopResultBuilder]: For program point L7337(lines 7337 7340) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L7536(line 7536) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L895 garLoopResultBuilder]: At program point L7437(lines 7395 7443) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L7305-1(line 7305) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L895 garLoopResultBuilder]: At program point L7305(line 7305) the Hoare annotation is: false [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L6711(lines 6711 6714) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L7570(line 7570) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L7372-2(line 7372) no Hoare annotation was computed. [2022-10-15 21:07:41,185 INFO L899 garLoopResultBuilder]: For program point L7372(line 7372) no Hoare annotation was computed. [2022-10-15 21:07:41,186 INFO L895 garLoopResultBuilder]: At program point L8066(lines 8065 8067) the Hoare annotation is: false [2022-10-15 21:07:41,186 INFO L895 garLoopResultBuilder]: At program point L7439(lines 7395 7443) the Hoare annotation is: (let ((.cse0 (= 0 ~debug~0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2) (and .cse0 (<= ~ref_cnt~0 0) (<= (+ 19 |ULTIMATE.start_flexcop_usb_probe_~ret~2#1|) 0) (<= 0 ~ref_cnt~0) .cse1 .cse2 (<= (+ 19 |ULTIMATE.start_flexcop_usb_init_#res#1|) 0)))) [2022-10-15 21:07:41,186 INFO L899 garLoopResultBuilder]: For program point L7373(line 7373) no Hoare annotation was computed. [2022-10-15 21:07:41,186 INFO L895 garLoopResultBuilder]: At program point L8100(lines 8099 8101) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0)) [2022-10-15 21:07:41,186 INFO L895 garLoopResultBuilder]: At program point L8001(lines 7995 8003) the Hoare annotation is: (and (= 0 ~debug~0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-10-15 21:07:41,186 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7323) no Hoare annotation was computed. [2022-10-15 21:07:41,186 INFO L899 garLoopResultBuilder]: For program point L7341(line 7341) no Hoare annotation was computed. [2022-10-15 21:07:41,187 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7323) no Hoare annotation was computed. [2022-10-15 21:07:41,187 INFO L895 garLoopResultBuilder]: At program point L7342(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,187 INFO L899 garLoopResultBuilder]: For program point L7441(line 7441) no Hoare annotation was computed. [2022-10-15 21:07:41,187 INFO L895 garLoopResultBuilder]: At program point L8036-2(lines 8035 8037) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,187 INFO L899 garLoopResultBuilder]: For program point L8036-1(line 8036) no Hoare annotation was computed. [2022-10-15 21:07:41,187 INFO L895 garLoopResultBuilder]: At program point L8036(line 8036) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,187 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7285) no Hoare annotation was computed. [2022-10-15 21:07:41,188 INFO L899 garLoopResultBuilder]: For program point L6715(lines 6715 6720) no Hoare annotation was computed. [2022-10-15 21:07:41,188 INFO L895 garLoopResultBuilder]: At program point L7442(lines 7389 7444) the Hoare annotation is: (let ((.cse0 (= 0 ~debug~0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 .cse1 (= ~ref_cnt~0 0) (<= (+ |ULTIMATE.start_flexcop_usb_probe_#res#1| 12) 0) .cse2) (and .cse0 (<= ~ref_cnt~0 0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (<= 0 ~ref_cnt~0) .cse1 .cse2))) [2022-10-15 21:07:41,188 INFO L899 garLoopResultBuilder]: For program point L7310(line 7310) no Hoare annotation was computed. [2022-10-15 21:07:41,188 INFO L899 garLoopResultBuilder]: For program point L7310-1(line 7310) no Hoare annotation was computed. [2022-10-15 21:07:41,188 INFO L895 garLoopResultBuilder]: At program point L7344(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,188 INFO L895 garLoopResultBuilder]: At program point L7377(lines 7360 7380) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,188 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,188 INFO L895 garLoopResultBuilder]: At program point L8104(lines 8103 8105) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L6684-1(lines 6681 6693) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L6684(lines 6684 6687) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L7543(line 7543) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7522) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L895 garLoopResultBuilder]: At program point L7378(line 7378) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L7312-2(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L7312-1(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,189 INFO L899 garLoopResultBuilder]: For program point L7312(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L7378-1(line 7378) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L7312-3(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L895 garLoopResultBuilder]: At program point L6619(lines 6615 6621) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L6685-2(line 6685) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L6685(line 6685) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L6685-6(line 6685) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L7544(lines 7544 7575) no Hoare annotation was computed. [2022-10-15 21:07:41,190 INFO L899 garLoopResultBuilder]: For program point L6685-4(line 6685) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7522) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point L7577(line 7577) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L895 garLoopResultBuilder]: At program point L7346(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,191 INFO L895 garLoopResultBuilder]: At program point L7379(lines 7358 7381) the Hoare annotation is: (let ((.cse0 (= 0 ~debug~0)) (.cse1 (= ~ldv_state_variable_1~0 1)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) .cse1 .cse2 (<= (+ 19 |ULTIMATE.start_flexcop_usb_init_#res#1|) 0)) (and .cse0 (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) .cse1 (= ~ref_cnt~0 0) .cse2))) [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point L7280(lines 7280 7284) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point L8007(lines 8007 8010) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point L7512(lines 7512 7579) no Hoare annotation was computed. [2022-10-15 21:07:41,191 INFO L899 garLoopResultBuilder]: For program point L7546(lines 7546 7572) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point L7513(line 7513) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point L8009-1(lines 8006 8020) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L902 garLoopResultBuilder]: At program point L8009(line 8009) the Hoare annotation is: true [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point L6688(lines 6688 6691) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point L7514(lines 7514 7541) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7310) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L899 garLoopResultBuilder]: For program point L7547(line 7547) no Hoare annotation was computed. [2022-10-15 21:07:41,192 INFO L895 garLoopResultBuilder]: At program point L7580(lines 7505 7585) the Hoare annotation is: (let ((.cse0 (= 0 ~debug~0)) (.cse1 (= ~ldv_state_variable_0~0 3))) (or (and .cse0 (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse1) (and .cse0 (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) (and .cse0 (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse1 (<= ~ref_cnt~0 1)))) [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L7316-1(lines 7316 7319) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L6689-2(line 6689) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L6689(line 6689) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L6689-6(line 6689) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7310) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L7548(lines 7548 7553) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L6689-4(line 6689) no Hoare annotation was computed. [2022-10-15 21:07:41,193 INFO L899 garLoopResultBuilder]: For program point L7516(lines 7516 7538) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L899 garLoopResultBuilder]: For program point L7285-1(line 7285) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L899 garLoopResultBuilder]: For program point L7285(line 7285) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7341) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L895 garLoopResultBuilder]: At program point L6724(lines 6695 6726) the Hoare annotation is: false [2022-10-15 21:07:41,194 INFO L899 garLoopResultBuilder]: For program point L7451-1(line 7451) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L895 garLoopResultBuilder]: At program point L7451(line 7451) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,194 INFO L899 garLoopResultBuilder]: For program point L7517(line 7517) no Hoare annotation was computed. [2022-10-15 21:07:41,194 INFO L895 garLoopResultBuilder]: At program point L7286(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,195 INFO L899 garLoopResultBuilder]: For program point L8013-1(lines 8006 8020) no Hoare annotation was computed. [2022-10-15 21:07:41,195 INFO L902 garLoopResultBuilder]: At program point L8013(line 8013) the Hoare annotation is: true [2022-10-15 21:07:41,195 INFO L895 garLoopResultBuilder]: At program point L6692(lines 6678 6694) the Hoare annotation is: false [2022-10-15 21:07:41,195 INFO L899 garLoopResultBuilder]: For program point L7518(lines 7518 7526) no Hoare annotation was computed. [2022-10-15 21:07:41,195 INFO L902 garLoopResultBuilder]: At program point L7584(lines 7501 7586) the Hoare annotation is: true [2022-10-15 21:07:41,195 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,195 INFO L899 garLoopResultBuilder]: For program point L7452-1(line 7452) no Hoare annotation was computed. [2022-10-15 21:07:41,195 INFO L895 garLoopResultBuilder]: At program point L7452(line 7452) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,196 INFO L895 garLoopResultBuilder]: At program point L7485(lines 7481 7487) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1)) [2022-10-15 21:07:41,196 INFO L895 garLoopResultBuilder]: At program point L8047(lines 8046 8048) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= |ULTIMATE.start_flexcop_usb_probe_~ret~2#1| 0) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,196 INFO L899 garLoopResultBuilder]: For program point L7354(line 7354) no Hoare annotation was computed. [2022-10-15 21:07:41,196 INFO L899 garLoopResultBuilder]: For program point L7420(lines 7420 7423) no Hoare annotation was computed. [2022-10-15 21:07:41,196 INFO L899 garLoopResultBuilder]: For program point L7453-1(line 7453) no Hoare annotation was computed. [2022-10-15 21:07:41,196 INFO L895 garLoopResultBuilder]: At program point L7453(line 7453) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,197 INFO L895 garLoopResultBuilder]: At program point L7288(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,197 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,197 INFO L895 garLoopResultBuilder]: At program point L7454(line 7454) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,197 INFO L899 garLoopResultBuilder]: For program point L7520(lines 7520 7524) no Hoare annotation was computed. [2022-10-15 21:07:41,197 INFO L899 garLoopResultBuilder]: For program point L7322(line 7322) no Hoare annotation was computed. [2022-10-15 21:07:41,197 INFO L895 garLoopResultBuilder]: At program point L7355(lines 7248 7357) the Hoare annotation is: false [2022-10-15 21:07:41,197 INFO L899 garLoopResultBuilder]: For program point L7454-1(line 7454) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7532) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point L7322-1(line 7322) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L895 garLoopResultBuilder]: At program point L7290(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point L7323-1(line 7323) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point L7323(line 7323) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7532) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L899 garLoopResultBuilder]: For program point L8083-1(line 8083) no Hoare annotation was computed. [2022-10-15 21:07:41,198 INFO L895 garLoopResultBuilder]: At program point L8083(line 8083) the Hoare annotation is: false [2022-10-15 21:07:41,198 INFO L902 garLoopResultBuilder]: At program point L8017-1(lines 8004 8021) the Hoare annotation is: true [2022-10-15 21:07:41,199 INFO L895 garLoopResultBuilder]: At program point L8083-2(lines 8082 8084) the Hoare annotation is: false [2022-10-15 21:07:41,199 INFO L902 garLoopResultBuilder]: At program point L8017(line 8017) the Hoare annotation is: true [2022-10-15 21:07:41,199 INFO L899 garLoopResultBuilder]: For program point L6762(lines 6762 6766) no Hoare annotation was computed. [2022-10-15 21:07:41,199 INFO L899 garLoopResultBuilder]: For program point L6762-2(lines 6762 6766) no Hoare annotation was computed. [2022-10-15 21:07:41,199 INFO L899 garLoopResultBuilder]: For program point L7522(line 7522) no Hoare annotation was computed. [2022-10-15 21:07:41,199 INFO L899 garLoopResultBuilder]: For program point L7555(line 7555) no Hoare annotation was computed. [2022-10-15 21:07:41,199 INFO L895 garLoopResultBuilder]: At program point L7456(lines 7445 7458) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,199 INFO L899 garLoopResultBuilder]: For program point L7522-1(line 7522) no Hoare annotation was computed. [2022-10-15 21:07:41,200 INFO L895 garLoopResultBuilder]: At program point L7324(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,200 INFO L899 garLoopResultBuilder]: For program point L7556(lines 7556 7568) no Hoare annotation was computed. [2022-10-15 21:07:41,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,200 INFO L895 garLoopResultBuilder]: At program point L7656(lines 7647 7658) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1)) [2022-10-15 21:07:41,200 INFO L895 garLoopResultBuilder]: At program point L7326(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,200 INFO L899 garLoopResultBuilder]: For program point L7425(lines 7425 7428) no Hoare annotation was computed. [2022-10-15 21:07:41,200 INFO L895 garLoopResultBuilder]: At program point L8053-2(lines 8052 8054) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,200 INFO L899 garLoopResultBuilder]: For program point L8053-1(line 8053) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L895 garLoopResultBuilder]: At program point L8053(line 8053) the Hoare annotation is: (and (= 0 ~debug~0) (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7312) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L7558(lines 7558 7561) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L895 garLoopResultBuilder]: At program point L7492(lines 7488 7494) the Hoare annotation is: (= ~ldv_state_variable_1~0 0) [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L7558-2(lines 7556 7567) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L7261-1(line 7261) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L7261(line 7261) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L6667-1(lines 6667 6674) no Hoare annotation was computed. [2022-10-15 21:07:41,201 INFO L899 garLoopResultBuilder]: For program point L6667(lines 6667 6674) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7261) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L895 garLoopResultBuilder]: At program point L7328(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point L6668(lines 6668 6672) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point L7362(lines 7362 7376) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7261) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point L7263(lines 7263 7267) no Hoare annotation was computed. [2022-10-15 21:07:41,202 INFO L899 garLoopResultBuilder]: For program point L7263-2(lines 7263 7267) no Hoare annotation was computed. [2022-10-15 21:07:41,203 INFO L895 garLoopResultBuilder]: At program point L8023(lines 8022 8024) the Hoare annotation is: false [2022-10-15 21:07:41,203 INFO L895 garLoopResultBuilder]: At program point L6768(lines 6758 6770) the Hoare annotation is: false [2022-10-15 21:07:41,203 INFO L899 garLoopResultBuilder]: For program point L7528(line 7528) no Hoare annotation was computed. [2022-10-15 21:07:41,203 INFO L899 garLoopResultBuilder]: For program point L7363(line 7363) no Hoare annotation was computed. [2022-10-15 21:07:41,203 INFO L902 garLoopResultBuilder]: At program point L8090(lines 8089 8091) the Hoare annotation is: true [2022-10-15 21:07:41,203 INFO L899 garLoopResultBuilder]: For program point L6703-1(line 6703) no Hoare annotation was computed. [2022-10-15 21:07:41,203 INFO L895 garLoopResultBuilder]: At program point L6703(line 6703) the Hoare annotation is: (and (= 0 ~debug~0) (= 32 |ULTIMATE.start_dma_alloc_attrs_~gfp#1|) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= |ULTIMATE.start_flexcop_usb_probe_~ret~2#1| 0) (= ~ldv_state_variable_1~0 1)) [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7322) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point L7430(lines 7430 7433) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point L7529(lines 7529 7534) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point L7298(lines 7298 7301) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point L7331-1(line 7331) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L895 garLoopResultBuilder]: At program point L7331(line 7331) the Hoare annotation is: false [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point L7298-2(lines 7298 7301) no Hoare annotation was computed. [2022-10-15 21:07:41,204 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 7322) no Hoare annotation was computed. [2022-10-15 21:07:41,205 INFO L895 garLoopResultBuilder]: At program point L6605(lines 6601 6607) the Hoare annotation is: (and (= 0 ~debug~0) (= |ULTIMATE.start_flexcop_usb_init_#res#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:07:41,205 INFO L895 garLoopResultBuilder]: At program point L7431(lines 7395 7443) the Hoare annotation is: false [2022-10-15 21:07:41,205 INFO L899 garLoopResultBuilder]: For program point L7332(lines 7332 7336) no Hoare annotation was computed. [2022-10-15 21:07:41,205 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,205 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,205 INFO L895 garLoopResultBuilder]: At program point L-1-3(line -1) the Hoare annotation is: false [2022-10-15 21:07:41,205 INFO L895 garLoopResultBuilder]: At program point L8059(lines 8058 8060) the Hoare annotation is: false [2022-10-15 21:07:41,205 INFO L899 garLoopResultBuilder]: For program point L-1-4(line -1) no Hoare annotation was computed. [2022-10-15 21:07:41,205 INFO L899 garLoopResultBuilder]: For program point L6705-2(line 6705) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L6705(line 6705) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L6705-6(line 6705) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L902 garLoopResultBuilder]: At program point L7564(lines 7505 7585) the Hoare annotation is: true [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L6705-4(line 6705) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L7366(line 7366) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L6705-8(lines 6702 6725) no Hoare annotation was computed. [2022-10-15 21:07:41,206 INFO L895 garLoopResultBuilder]: At program point L7664(lines 7659 7666) the Hoare annotation is: (= ~ldv_state_variable_1~0 0) [2022-10-15 21:07:41,206 INFO L899 garLoopResultBuilder]: For program point L6706-1(lines 6706 6709) no Hoare annotation was computed. [2022-10-15 21:07:41,207 INFO L899 garLoopResultBuilder]: For program point L7532-1(line 7532) no Hoare annotation was computed. [2022-10-15 21:07:41,207 INFO L899 garLoopResultBuilder]: For program point L7532(line 7532) no Hoare annotation was computed. [2022-10-15 21:07:41,207 INFO L895 garLoopResultBuilder]: At program point L7334(lines 7259 7356) the Hoare annotation is: false [2022-10-15 21:07:41,207 INFO L899 garLoopResultBuilder]: For program point L7401(lines 7401 7405) no Hoare annotation was computed. [2022-10-15 21:07:41,207 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 7675 7680) no Hoare annotation was computed. [2022-10-15 21:07:41,207 INFO L902 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 7675 7680) the Hoare annotation is: true [2022-10-15 21:07:41,207 INFO L899 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 7675 7680) no Hoare annotation was computed. [2022-10-15 21:07:41,211 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:41,214 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:07:41,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:07:41 BoogieIcfgContainer [2022-10-15 21:07:41,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:07:41,248 INFO L158 Benchmark]: Toolchain (without parser) took 37139.67ms. Allocated memory was 162.5MB in the beginning and 483.4MB in the end (delta: 320.9MB). Free memory was 127.4MB in the beginning and 371.2MB in the end (delta: -243.8MB). Peak memory consumption was 307.8MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,249 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 162.5MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:07:41,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3092.43ms. Allocated memory was 162.5MB in the beginning and 248.5MB in the end (delta: 86.0MB). Free memory was 127.2MB in the beginning and 181.9MB in the end (delta: -54.7MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 194.69ms. Allocated memory is still 248.5MB. Free memory was 181.9MB in the beginning and 173.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,250 INFO L158 Benchmark]: Boogie Preprocessor took 230.92ms. Allocated memory is still 248.5MB. Free memory was 173.5MB in the beginning and 165.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,250 INFO L158 Benchmark]: RCFGBuilder took 3864.17ms. Allocated memory is still 248.5MB. Free memory was 165.7MB in the beginning and 172.0MB in the end (delta: -6.3MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,251 INFO L158 Benchmark]: TraceAbstraction took 29737.44ms. Allocated memory was 248.5MB in the beginning and 483.4MB in the end (delta: 234.9MB). Free memory was 171.4MB in the beginning and 371.2MB in the end (delta: -199.8MB). Peak memory consumption was 264.2MB. Max. memory is 8.0GB. [2022-10-15 21:07:41,253 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.34ms. Allocated memory is still 162.5MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 136.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3092.43ms. Allocated memory was 162.5MB in the beginning and 248.5MB in the end (delta: 86.0MB). Free memory was 127.2MB in the beginning and 181.9MB in the end (delta: -54.7MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 194.69ms. Allocated memory is still 248.5MB. Free memory was 181.9MB in the beginning and 173.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 230.92ms. Allocated memory is still 248.5MB. Free memory was 173.5MB in the beginning and 165.7MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 3864.17ms. Allocated memory is still 248.5MB. Free memory was 165.7MB in the beginning and 172.0MB in the end (delta: -6.3MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 29737.44ms. Allocated memory was 248.5MB in the beginning and 483.4MB in the end (delta: 234.9MB). Free memory was 171.4MB in the beginning and 371.2MB in the end (delta: -199.8MB). Peak memory consumption was 264.2MB. 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 - PositiveResult [Line: 7232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7232]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 6637]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7261]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7285]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7310]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7310]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7312]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7312]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7312]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7312]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7322]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7322]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7323]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7323]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7341]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7341]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7522]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7522]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7532]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7532]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 268 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 29.6s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 4734 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4588 mSDsluCounter, 12211 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7415 mSDsCounter, 707 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2260 IncrementalHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 707 mSolverCounterUnsat, 4796 mSDtfsCounter, 2260 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 688 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 90 LocationsWithAnnotation, 1212 PreInvPairs, 1278 NumberOfFragments, 1004 HoareAnnotationTreeSize, 1212 FomulaSimplifications, 1929 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 90 FomulaSimplificationsInter, 5991 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 1704 NumberOfCodeBlocks, 1704 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1795 ConstructedInterpolants, 0 QuantifiedInterpolants, 3020 SizeOfPredicates, 3 NumberOfNonLiveVariables, 4437 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 766/815 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 - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold - InvariantResult [Line: 8052]: Loop Invariant Derived loop invariant: (((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 8062]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6615]: Loop Invariant Derived loop invariant: (((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 8103]: Loop Invariant Derived loop invariant: (((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 8039]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7395]: Loop Invariant Derived loop invariant: (((0 == debug && \result == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8099]: Loop Invariant Derived loop invariant: (0 == debug && ref_cnt <= 0) && 0 <= ref_cnt - InvariantResult [Line: 7219]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7647]: Loop Invariant Derived loop invariant: ((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1 - InvariantResult [Line: 6727]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7659]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 - InvariantResult [Line: 8004]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6695]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8089]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8110]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7395]: Loop Invariant Derived loop invariant: ((((0 == debug && \result == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || ((((((0 == debug && ref_cnt <= 0) && 19 + ret <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) && 19 + \result <= 0) - InvariantResult [Line: 6557]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8065]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6571]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7219]: Loop Invariant Derived loop invariant: (((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || i == 0) || (i <= 3 && 1 <= i) - InvariantResult [Line: 6541]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7995]: Loop Invariant Derived loop invariant: (0 == debug && ldv_state_variable_1 == 0) && ref_cnt == 0 - InvariantResult [Line: 6640]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8035]: Loop Invariant Derived loop invariant: ((((0 == debug && \result == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 7501]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6758]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7395]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8092]: Loop Invariant Derived loop invariant: (((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || i == 0) || (i <= 3 && 1 <= i) - InvariantResult [Line: 8025]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 6678]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7360]: Loop Invariant Derived loop invariant: (((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 7488]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 - InvariantResult [Line: 8022]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7358]: Loop Invariant Derived loop invariant: (((((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) && 19 + \result <= 0) || ((((0 == debug && \result == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 7445]: Loop Invariant Derived loop invariant: ((((0 == debug && \result == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 7505]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8095]: Loop Invariant Derived loop invariant: (((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || i == 0) || (i <= 3 && 1 <= i) - InvariantResult [Line: 8058]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8082]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6662]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 8046]: Loop Invariant Derived loop invariant: ((((0 == debug && \result == 0) && ret == 0) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 6771]: Loop Invariant Derived loop invariant: ((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || 1 <= i - InvariantResult [Line: 7505]: Loop Invariant Derived loop invariant: (((((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || ((0 == debug && ldv_state_variable_1 == 0) && ref_cnt == 0)) || (((((0 == debug && \result == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) - InvariantResult [Line: 7248]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7481]: Loop Invariant Derived loop invariant: ((0 == debug && ref_cnt <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1 - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 6601]: Loop Invariant Derived loop invariant: ((((0 == debug && \result == 0) && ldv_state_variable_1 == 2) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 7219]: Loop Invariant Derived loop invariant: (((((!(ldv_state_variable_1 == 2) || !(0 == debug)) || !(1 <= ref_cnt)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) || i == 0) || 1 <= i - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7389]: Loop Invariant Derived loop invariant: ((((0 == debug && ldv_state_variable_1 == 1) && ref_cnt == 0) && \result + 12 <= 0) && ldv_state_variable_0 == 3) || (((((0 == debug && ref_cnt <= 0) && \result == 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 7259]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-10-15 21:07:41,326 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...