./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fcb8e130 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 22:49:00,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 22:49:00,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 22:49:00,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 22:49:00,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 22:49:00,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 22:49:00,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 22:49:00,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 22:49:00,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 22:49:00,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 22:49:00,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 22:49:00,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 22:49:00,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 22:49:00,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 22:49:00,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 22:49:00,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 22:49:00,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 22:49:00,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 22:49:00,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 22:49:00,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 22:49:00,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 22:49:00,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 22:49:00,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 22:49:00,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 22:49:00,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 22:49:00,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 22:49:00,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 22:49:00,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 22:49:00,203 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 22:49:00,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 22:49:00,204 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 22:49:00,204 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 22:49:00,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 22:49:00,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 22:49:00,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 22:49:00,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 22:49:00,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 22:49:00,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 22:49:00,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 22:49:00,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 22:49:00,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 22:49:00,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-22 22:49:00,242 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 22:49:00,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 22:49:00,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 22:49:00,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 22:49:00,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 22:49:00,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 22:49:00,245 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 22:49:00,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 22:49:00,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 22:49:00,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 22:49:00,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 22:49:00,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 22:49:00,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 22:49:00,247 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 22:49:00,247 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 22:49:00,247 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 22:49:00,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 22:49:00,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 22:49:00,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 22:49:00,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 22:49:00,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 22:49:00,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 22:49:00,249 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 22:49:00,249 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 22:49:00,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 22:49:00,250 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 22:49:00,250 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 22:49:00,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 22:49:00,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 22:49:00,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-22 22:49:00,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 22:49:00,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 22:49:00,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 22:49:00,501 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 22:49:00,507 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 22:49:00,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:00,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0280de372/6bba4284ad6b492f88f0444921d292b6/FLAGb661cb4e6 [2021-11-22 22:49:01,227 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 22:49:01,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:01,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0280de372/6bba4284ad6b492f88f0444921d292b6/FLAGb661cb4e6 [2021-11-22 22:49:01,421 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0280de372/6bba4284ad6b492f88f0444921d292b6 [2021-11-22 22:49:01,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 22:49:01,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 22:49:01,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 22:49:01,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 22:49:01,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 22:49:01,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:01" (1/1) ... [2021-11-22 22:49:01,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb40804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:01, skipping insertion in model container [2021-11-22 22:49:01,430 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:01" (1/1) ... [2021-11-22 22:49:01,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 22:49:01,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 22:49:02,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-22 22:49:02,466 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 22:49:02,485 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 22:49:02,555 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-22 22:49:02,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 22:49:02,693 INFO L208 MainTranslator]: Completed translation [2021-11-22 22:49:02,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02 WrapperNode [2021-11-22 22:49:02,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 22:49:02,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 22:49:02,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 22:49:02,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 22:49:02,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,858 INFO L137 Inliner]: procedures = 114, calls = 1187, calls flagged for inlining = 178, calls inlined = 150, statements flattened = 2723 [2021-11-22 22:49:02,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 22:49:02,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 22:49:02,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 22:49:02,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 22:49:02,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 22:49:02,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 22:49:02,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 22:49:02,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 22:49:02,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (1/1) ... [2021-11-22 22:49:02,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 22:49:02,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 22:49:03,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 22:49:03,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 22:49:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-22 22:49:03,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 22:49:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 22:49:03,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 22:49:03,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 22:49:03,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 22:49:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 22:49:03,461 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 22:49:03,466 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 22:49:05,118 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 22:49:05,127 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 22:49:05,127 INFO L301 CfgBuilder]: Removed 21 assume(true) statements. [2021-11-22 22:49:05,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:05 BoogieIcfgContainer [2021-11-22 22:49:05,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 22:49:05,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 22:49:05,131 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 22:49:05,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 22:49:05,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:49:01" (1/3) ... [2021-11-22 22:49:05,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a46e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:05, skipping insertion in model container [2021-11-22 22:49:05,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:02" (2/3) ... [2021-11-22 22:49:05,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a46e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:05, skipping insertion in model container [2021-11-22 22:49:05,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:05" (3/3) ... [2021-11-22 22:49:05,136 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:05,140 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 22:49:05,140 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 22:49:05,181 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 22:49:05,187 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 22:49:05,187 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 22:49:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 402 states, 396 states have (on average 1.4848484848484849) internal successors, (588), 401 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-22 22:49:05,212 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:05,212 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:05,213 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:05,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash 706937879, now seen corresponding path program 1 times [2021-11-22 22:49:05,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:05,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966169496] [2021-11-22 22:49:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:05,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:05,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:05,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:05,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966169496] [2021-11-22 22:49:05,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966169496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:05,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:05,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 22:49:05,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876809925] [2021-11-22 22:49:05,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:05,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:05,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:05,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:05,690 INFO L87 Difference]: Start difference. First operand has 402 states, 396 states have (on average 1.4848484848484849) internal successors, (588), 401 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:05,874 INFO L93 Difference]: Finished difference Result 1150 states and 1697 transitions. [2021-11-22 22:49:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:05,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-22 22:49:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:05,897 INFO L225 Difference]: With dead ends: 1150 [2021-11-22 22:49:05,900 INFO L226 Difference]: Without dead ends: 741 [2021-11-22 22:49:05,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:05,913 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 506 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:05,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 1071 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2021-11-22 22:49:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 741. [2021-11-22 22:49:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 736 states have (on average 1.3967391304347827) internal successors, (1028), 740 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1028 transitions. [2021-11-22 22:49:06,010 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1028 transitions. Word has length 17 [2021-11-22 22:49:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:06,013 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1028 transitions. [2021-11-22 22:49:06,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1028 transitions. [2021-11-22 22:49:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 22:49:06,014 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:06,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:06,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 22:49:06,015 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -751906786, now seen corresponding path program 1 times [2021-11-22 22:49:06,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:06,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893716882] [2021-11-22 22:49:06,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:06,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:06,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:06,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893716882] [2021-11-22 22:49:06,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893716882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:06,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:06,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 22:49:06,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277677475] [2021-11-22 22:49:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:06,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:06,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:06,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:06,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,125 INFO L87 Difference]: Start difference. First operand 741 states and 1028 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:06,198 INFO L93 Difference]: Finished difference Result 773 states and 1058 transitions. [2021-11-22 22:49:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:06,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-22 22:49:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:06,202 INFO L225 Difference]: With dead ends: 773 [2021-11-22 22:49:06,203 INFO L226 Difference]: Without dead ends: 757 [2021-11-22 22:49:06,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,209 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 530 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:06,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 564 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-11-22 22:49:06,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 741. [2021-11-22 22:49:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 736 states have (on average 1.3953804347826086) internal successors, (1027), 740 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1027 transitions. [2021-11-22 22:49:06,249 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1027 transitions. Word has length 23 [2021-11-22 22:49:06,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:06,250 INFO L470 AbstractCegarLoop]: Abstraction has 741 states and 1027 transitions. [2021-11-22 22:49:06,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1027 transitions. [2021-11-22 22:49:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 22:49:06,255 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:06,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:06,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 22:49:06,257 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -750059744, now seen corresponding path program 1 times [2021-11-22 22:49:06,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:06,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620600438] [2021-11-22 22:49:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:06,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:06,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:06,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620600438] [2021-11-22 22:49:06,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620600438] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:06,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:06,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 22:49:06,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893612030] [2021-11-22 22:49:06,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:06,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:06,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,402 INFO L87 Difference]: Start difference. First operand 741 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:06,475 INFO L93 Difference]: Finished difference Result 2205 states and 3062 transitions. [2021-11-22 22:49:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:06,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-22 22:49:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:06,482 INFO L225 Difference]: With dead ends: 2205 [2021-11-22 22:49:06,482 INFO L226 Difference]: Without dead ends: 1472 [2021-11-22 22:49:06,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,486 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 509 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:06,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 1045 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2021-11-22 22:49:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1460. [2021-11-22 22:49:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1455 states have (on average 1.3938144329896907) internal successors, (2028), 1459 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2028 transitions. [2021-11-22 22:49:06,540 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2028 transitions. Word has length 23 [2021-11-22 22:49:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:06,541 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 2028 transitions. [2021-11-22 22:49:06,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2028 transitions. [2021-11-22 22:49:06,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 22:49:06,546 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:06,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:06,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-22 22:49:06,546 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1777015848, now seen corresponding path program 1 times [2021-11-22 22:49:06,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:06,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489182215] [2021-11-22 22:49:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:06,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:06,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:06,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489182215] [2021-11-22 22:49:06,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489182215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:06,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:06,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 22:49:06,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474191394] [2021-11-22 22:49:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:06,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:06,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:06,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,684 INFO L87 Difference]: Start difference. First operand 1460 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:06,792 INFO L93 Difference]: Finished difference Result 4358 states and 6057 transitions. [2021-11-22 22:49:06,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-22 22:49:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:06,806 INFO L225 Difference]: With dead ends: 4358 [2021-11-22 22:49:06,807 INFO L226 Difference]: Without dead ends: 2906 [2021-11-22 22:49:06,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:06,812 INFO L933 BasicCegarLoop]: 943 mSDtfsCounter, 507 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:06,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [507 Valid, 1461 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2906 states. [2021-11-22 22:49:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2906 to 2895. [2021-11-22 22:49:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2890 states have (on average 1.3923875432525952) internal successors, (4024), 2894 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4024 transitions. [2021-11-22 22:49:06,909 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4024 transitions. Word has length 24 [2021-11-22 22:49:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:06,909 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 4024 transitions. [2021-11-22 22:49:06,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4024 transitions. [2021-11-22 22:49:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 22:49:06,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:06,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:06,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-22 22:49:06,913 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:06,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 747083307, now seen corresponding path program 1 times [2021-11-22 22:49:06,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:06,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084053518] [2021-11-22 22:49:06,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:06,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:07,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:07,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084053518] [2021-11-22 22:49:07,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084053518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:07,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:07,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 22:49:07,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023611847] [2021-11-22 22:49:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:07,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:07,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,027 INFO L87 Difference]: Start difference. First operand 2895 states and 4024 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:07,099 INFO L93 Difference]: Finished difference Result 2900 states and 4028 transitions. [2021-11-22 22:49:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-22 22:49:07,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:07,111 INFO L225 Difference]: With dead ends: 2900 [2021-11-22 22:49:07,111 INFO L226 Difference]: Without dead ends: 2898 [2021-11-22 22:49:07,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,113 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 504 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:07,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 1461 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2021-11-22 22:49:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2896. [2021-11-22 22:49:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 2891 states have (on average 1.3922518159806296) internal successors, (4025), 2895 states have internal predecessors, (4025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 4025 transitions. [2021-11-22 22:49:07,207 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 4025 transitions. Word has length 25 [2021-11-22 22:49:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:07,207 INFO L470 AbstractCegarLoop]: Abstraction has 2896 states and 4025 transitions. [2021-11-22 22:49:07,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 4025 transitions. [2021-11-22 22:49:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 22:49:07,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:07,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:07,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-22 22:49:07,209 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:07,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1684745795, now seen corresponding path program 1 times [2021-11-22 22:49:07,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:07,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813367261] [2021-11-22 22:49:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:07,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:07,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:07,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813367261] [2021-11-22 22:49:07,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813367261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:07,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:07,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 22:49:07,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055980628] [2021-11-22 22:49:07,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:07,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:07,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:07,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:07,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,281 INFO L87 Difference]: Start difference. First operand 2896 states and 4025 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:07,347 INFO L93 Difference]: Finished difference Result 2896 states and 4025 transitions. [2021-11-22 22:49:07,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:07,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-22 22:49:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:07,359 INFO L225 Difference]: With dead ends: 2896 [2021-11-22 22:49:07,360 INFO L226 Difference]: Without dead ends: 2894 [2021-11-22 22:49:07,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,362 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 509 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:07,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 532 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2021-11-22 22:49:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2894. [2021-11-22 22:49:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2890 states have (on average 1.3920415224913494) internal successors, (4023), 2893 states have internal predecessors, (4023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 4023 transitions. [2021-11-22 22:49:07,497 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 4023 transitions. Word has length 26 [2021-11-22 22:49:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:07,498 INFO L470 AbstractCegarLoop]: Abstraction has 2894 states and 4023 transitions. [2021-11-22 22:49:07,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 4023 transitions. [2021-11-22 22:49:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-22 22:49:07,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:07,499 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:07,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-22 22:49:07,499 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:07,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 687511862, now seen corresponding path program 1 times [2021-11-22 22:49:07,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:07,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492118499] [2021-11-22 22:49:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:07,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:07,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:07,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492118499] [2021-11-22 22:49:07,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492118499] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:07,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:07,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 22:49:07,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550421428] [2021-11-22 22:49:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:07,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:07,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,586 INFO L87 Difference]: Start difference. First operand 2894 states and 4023 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:07,653 INFO L93 Difference]: Finished difference Result 2894 states and 4023 transitions. [2021-11-22 22:49:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:07,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-22 22:49:07,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:07,664 INFO L225 Difference]: With dead ends: 2894 [2021-11-22 22:49:07,665 INFO L226 Difference]: Without dead ends: 2883 [2021-11-22 22:49:07,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,667 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 506 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:07,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2021-11-22 22:49:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2883. [2021-11-22 22:49:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2880 states have (on average 1.3920138888888889) internal successors, (4009), 2882 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 4009 transitions. [2021-11-22 22:49:07,768 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 4009 transitions. Word has length 27 [2021-11-22 22:49:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:07,768 INFO L470 AbstractCegarLoop]: Abstraction has 2883 states and 4009 transitions. [2021-11-22 22:49:07,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 4009 transitions. [2021-11-22 22:49:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 22:49:07,770 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:07,771 INFO L514 BasicCegarLoop]: 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] [2021-11-22 22:49:07,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-22 22:49:07,771 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1483099283, now seen corresponding path program 1 times [2021-11-22 22:49:07,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:07,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773341000] [2021-11-22 22:49:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:07,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:07,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:07,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773341000] [2021-11-22 22:49:07,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773341000] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:07,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:07,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-22 22:49:07,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623719496] [2021-11-22 22:49:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:07,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:07,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:07,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:07,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:07,882 INFO L87 Difference]: Start difference. First operand 2883 states and 4009 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:08,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:08,029 INFO L93 Difference]: Finished difference Result 5883 states and 8184 transitions. [2021-11-22 22:49:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 22:49:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:08,041 INFO L225 Difference]: With dead ends: 5883 [2021-11-22 22:49:08,042 INFO L226 Difference]: Without dead ends: 3008 [2021-11-22 22:49:08,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:08,048 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 36 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:08,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1040 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2021-11-22 22:49:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2983. [2021-11-22 22:49:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2980 states have (on average 1.3932885906040269) internal successors, (4152), 2982 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4152 transitions. [2021-11-22 22:49:08,146 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4152 transitions. Word has length 62 [2021-11-22 22:49:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:08,146 INFO L470 AbstractCegarLoop]: Abstraction has 2983 states and 4152 transitions. [2021-11-22 22:49:08,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4152 transitions. [2021-11-22 22:49:08,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 22:49:08,148 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:08,148 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:08,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-22 22:49:08,149 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash 609201411, now seen corresponding path program 1 times [2021-11-22 22:49:08,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:08,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322987928] [2021-11-22 22:49:08,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:08,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:08,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:08,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322987928] [2021-11-22 22:49:08,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322987928] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-22 22:49:08,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420404063] [2021-11-22 22:49:08,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:08,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 22:49:08,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 22:49:08,312 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 22:49:08,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 22:49:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:08,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 2166 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 22:49:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:08,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 22:49:08,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420404063] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:08,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-22 22:49:08,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-22 22:49:08,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565896191] [2021-11-22 22:49:08,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:08,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-22 22:49:08,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:08,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-22 22:49:08,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 22:49:08,994 INFO L87 Difference]: Start difference. First operand 2983 states and 4152 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:09,327 INFO L93 Difference]: Finished difference Result 9093 states and 12606 transitions. [2021-11-22 22:49:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 22:49:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 22:49:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:09,353 INFO L225 Difference]: With dead ends: 9093 [2021-11-22 22:49:09,353 INFO L226 Difference]: Without dead ends: 6118 [2021-11-22 22:49:09,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-11-22 22:49:09,362 INFO L933 BasicCegarLoop]: 1034 mSDtfsCounter, 675 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 3491 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:09,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [675 Valid, 3491 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6118 states. [2021-11-22 22:49:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6118 to 3071. [2021-11-22 22:49:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 3068 states have (on average 1.3833116036505868) internal successors, (4244), 3070 states have internal predecessors, (4244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4244 transitions. [2021-11-22 22:49:09,510 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4244 transitions. Word has length 71 [2021-11-22 22:49:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:09,512 INFO L470 AbstractCegarLoop]: Abstraction has 3071 states and 4244 transitions. [2021-11-22 22:49:09,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:09,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4244 transitions. [2021-11-22 22:49:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 22:49:09,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:09,514 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:09,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:09,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 22:49:09,728 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash -401915839, now seen corresponding path program 1 times [2021-11-22 22:49:09,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:09,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638493163] [2021-11-22 22:49:09,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:09,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:09,969 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638493163] [2021-11-22 22:49:09,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638493163] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:09,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:09,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-22 22:49:09,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061264053] [2021-11-22 22:49:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:09,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 22:49:09,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 22:49:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-22 22:49:09,971 INFO L87 Difference]: Start difference. First operand 3071 states and 4244 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:10,681 INFO L93 Difference]: Finished difference Result 12369 states and 16774 transitions. [2021-11-22 22:49:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 22:49:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 22:49:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:10,709 INFO L225 Difference]: With dead ends: 12369 [2021-11-22 22:49:10,709 INFO L226 Difference]: Without dead ends: 9306 [2021-11-22 22:49:10,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-11-22 22:49:10,719 INFO L933 BasicCegarLoop]: 582 mSDtfsCounter, 3065 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3065 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:10,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3065 Valid, 3684 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 22:49:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9306 states. [2021-11-22 22:49:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9306 to 3175. [2021-11-22 22:49:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3172 states have (on average 1.373266078184111) internal successors, (4356), 3174 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:10,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4356 transitions. [2021-11-22 22:49:10,970 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4356 transitions. Word has length 71 [2021-11-22 22:49:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:10,971 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 4356 transitions. [2021-11-22 22:49:10,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4356 transitions. [2021-11-22 22:49:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 22:49:10,973 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:10,973 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:10,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-22 22:49:10,973 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1529721277, now seen corresponding path program 1 times [2021-11-22 22:49:10,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:10,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284977315] [2021-11-22 22:49:10,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:10,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:11,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:11,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284977315] [2021-11-22 22:49:11,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284977315] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:11,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:11,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-22 22:49:11,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653865839] [2021-11-22 22:49:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:11,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 22:49:11,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 22:49:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-22 22:49:11,171 INFO L87 Difference]: Start difference. First operand 3175 states and 4356 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:11,889 INFO L93 Difference]: Finished difference Result 11214 states and 15207 transitions. [2021-11-22 22:49:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 22:49:11,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 22:49:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:11,909 INFO L225 Difference]: With dead ends: 11214 [2021-11-22 22:49:11,909 INFO L226 Difference]: Without dead ends: 8047 [2021-11-22 22:49:11,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-11-22 22:49:11,917 INFO L933 BasicCegarLoop]: 593 mSDtfsCounter, 2540 mSDsluCounter, 3626 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2540 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:11,917 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2540 Valid, 4219 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 22:49:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8047 states. [2021-11-22 22:49:12,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8047 to 3175. [2021-11-22 22:49:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3172 states have (on average 1.373266078184111) internal successors, (4356), 3174 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4356 transitions. [2021-11-22 22:49:12,221 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4356 transitions. Word has length 73 [2021-11-22 22:49:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:12,222 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 4356 transitions. [2021-11-22 22:49:12,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4356 transitions. [2021-11-22 22:49:12,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 22:49:12,224 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:12,224 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:12,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-22 22:49:12,225 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash -834695935, now seen corresponding path program 1 times [2021-11-22 22:49:12,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:12,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126831222] [2021-11-22 22:49:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:12,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:12,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 22:49:12,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126831222] [2021-11-22 22:49:12,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126831222] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:12,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:12,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-22 22:49:12,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203214301] [2021-11-22 22:49:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:12,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 22:49:12,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 22:49:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 22:49:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:12,391 INFO L87 Difference]: Start difference. First operand 3175 states and 4356 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:12,772 INFO L93 Difference]: Finished difference Result 9129 states and 12582 transitions. [2021-11-22 22:49:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 22:49:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-22 22:49:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:12,783 INFO L225 Difference]: With dead ends: 9129 [2021-11-22 22:49:12,784 INFO L226 Difference]: Without dead ends: 5946 [2021-11-22 22:49:12,789 INFO L932 BasicCegarLoop]: 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 [2021-11-22 22:49:12,790 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 472 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:12,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1654 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2021-11-22 22:49:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 3175. [2021-11-22 22:49:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 3172 states have (on average 1.3707440100882724) internal successors, (4348), 3174 states have internal predecessors, (4348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4348 transitions. [2021-11-22 22:49:12,987 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4348 transitions. Word has length 75 [2021-11-22 22:49:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:12,987 INFO L470 AbstractCegarLoop]: Abstraction has 3175 states and 4348 transitions. [2021-11-22 22:49:12,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4348 transitions. [2021-11-22 22:49:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 22:49:12,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:12,991 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:12,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-22 22:49:12,991 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:12,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1908098019, now seen corresponding path program 1 times [2021-11-22 22:49:12,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 22:49:12,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377671747] [2021-11-22 22:49:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:12,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 22:49:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 22:49:13,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 22:49:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 22:49:13,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 22:49:13,463 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 22:49:13,464 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 22:49:13,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 22:49:13,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 22:49:13,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 22:49:13,466 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 22:49:13,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-22 22:49:13,469 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:13,471 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 22:49:13,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:49:13 BoogieIcfgContainer [2021-11-22 22:49:13,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 22:49:13,648 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 22:49:13,648 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 22:49:13,648 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 22:49:13,649 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:05" (3/4) ... [2021-11-22 22:49:13,651 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 22:49:13,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 22:49:13,652 INFO L158 Benchmark]: Toolchain (without parser) took 12227.43ms. Allocated memory was 88.1MB in the beginning and 591.4MB in the end (delta: 503.3MB). Free memory was 49.5MB in the beginning and 244.3MB in the end (delta: -194.8MB). Peak memory consumption was 308.4MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,652 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 88.1MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 22:49:13,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1269.54ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 49.4MB in the beginning and 57.0MB in the end (delta: -7.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.69ms. Allocated memory is still 132.1MB. Free memory was 57.0MB in the beginning and 78.3MB in the end (delta: -21.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,653 INFO L158 Benchmark]: Boogie Preprocessor took 112.79ms. Allocated memory is still 132.1MB. Free memory was 78.3MB in the beginning and 65.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,654 INFO L158 Benchmark]: RCFGBuilder took 2156.55ms. Allocated memory was 132.1MB in the beginning and 203.4MB in the end (delta: 71.3MB). Free memory was 65.0MB in the beginning and 99.8MB in the end (delta: -34.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,654 INFO L158 Benchmark]: TraceAbstraction took 8516.60ms. Allocated memory was 203.4MB in the beginning and 591.4MB in the end (delta: 388.0MB). Free memory was 99.8MB in the beginning and 245.3MB in the end (delta: -145.6MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,654 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 591.4MB. Free memory was 245.3MB in the beginning and 244.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 22:49:13,656 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 88.1MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1269.54ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 49.4MB in the beginning and 57.0MB in the end (delta: -7.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.69ms. Allocated memory is still 132.1MB. Free memory was 57.0MB in the beginning and 78.3MB in the end (delta: -21.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.79ms. Allocated memory is still 132.1MB. Free memory was 78.3MB in the beginning and 65.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2156.55ms. Allocated memory was 132.1MB in the beginning and 203.4MB in the end (delta: 71.3MB). Free memory was 65.0MB in the beginning and 99.8MB in the end (delta: -34.8MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8516.60ms. Allocated memory was 203.4MB in the beginning and 591.4MB in the end (delta: 388.0MB). Free memory was 99.8MB in the beginning and 245.3MB in the end (delta: -145.6MB). Peak memory consumption was 241.4MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 591.4MB. Free memory was 245.3MB in the beginning and 244.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 3766. Possible FailurePath: [L3758] int ldv_state_variable_1 ; [L3759] int LDV_IN_INTERRUPT = 1; [L3760] int usb_counter ; [L3761] struct usb_interface *gtco_driverinfo_table_group1 ; [L3762] int ref_cnt ; [L3763] int ldv_state_variable_0 ; [L3830-L3844] static struct usb_device_id const gtco_usbid_table[6U] = { {3U, 1932U, 1024U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 1025U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4096U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4097U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4098U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L3845] struct usb_device_id const __mod_usb_device_table ; [L4829-L4834] static struct usb_driver gtco_driverinfo_table = {"gtco", & gtco_probe, & gtco_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& gtco_usbid_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4850] int ldv_retval_0 ; [L4851] int ldv_retval_1 ; [L5064] int INTERF_STATE = 0; [L5065] int SERIAL_STATE = 0; [L5066] void *usb_intfdata = 0; [L5067] struct urb *usb_urb = 0; [L5068] struct usb_device *usb_dev = 0; [L5069] int dev_counter = 0; [L5070] int completeFnIntCounter = 0; [L5071] int completeFnBulkCounter = 0; [L5072] void (*completeFnInt)(struct urb * ) ; [L5073] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4865] struct usb_device_id *ldvarg0 ; [L4866] void *tmp ; [L4867] int tmp___0 ; [L4868] int tmp___1 ; [L4869] int tmp___2 ; [L4871] CALL, EXPR ldv_zalloc(32UL) [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] RET, EXPR ldv_zalloc(32UL) [L4871] tmp = ldv_zalloc(32UL) [L4872] ldvarg0 = (struct usb_device_id *)tmp [L4873] FCALL ldv_initialize() [L4874] ldv_state_variable_1 = 0 [L4875] ref_cnt = 0 [L4876] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: [L4922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4923] COND TRUE ldv_state_variable_0 == 1 [L4924] CALL, EXPR gtco_driverinfo_table_init() [L4837] int tmp ; [L4839] CALL, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L5036] ldv_func_ret_type ldv_func_res ; [L5037] int tmp ; [L5039] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5370] return __VERIFIER_nondet_int(); [L5039] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5039] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5040] ldv_func_res = tmp [L5041] ldv_state_variable_1 = 1 [L5042] usb_counter = 0 [L5043] CALL ldv_usb_driver_1() [L4856] void *tmp ; [L4858] CALL, EXPR ldv_zalloc(1520UL) [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1520, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] RET, EXPR ldv_zalloc(1520UL) [L4858] tmp = ldv_zalloc(1520UL) [L4859] gtco_driverinfo_table_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5043] RET ldv_usb_driver_1() [L5044] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={167:0}, ldv_func_arg1={167:0}, ldv_func_arg2={4107:4105}, ldv_func_arg2={4107:4105}, ldv_func_arg3={165:0}, ldv_func_arg3={165:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4839] RET, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4839] tmp = ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4840] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4924] RET, EXPR gtco_driverinfo_table_init() [L4924] ldv_retval_1 = gtco_driverinfo_table_init() [L4925] COND TRUE ldv_retval_1 == 0 [L4926] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4929] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4881] COND TRUE ldv_state_variable_1 != 0 [L4882] tmp___1 = __VERIFIER_nondet_int() [L4884] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4885] COND TRUE ldv_state_variable_1 == 1 [L4886] CALL, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4569] struct gtco *gtco ; [L4570] struct input_dev *input_dev ; [L4571] struct hid_descriptor *hid_desc ; [L4572] char *report ; [L4573] int result ; [L4574] int retry ; [L4575] int error ; [L4576] struct usb_endpoint_descriptor *endpoint ; [L4577] void *tmp ; [L4578] struct usb_device *tmp___0 ; [L4579] void *tmp___1 ; [L4580] struct _ddebug descriptor ; [L4581] long tmp___2 ; [L4582] struct _ddebug descriptor___0 ; [L4583] long tmp___3 ; [L4584] struct _ddebug descriptor___1 ; [L4585] long tmp___4 ; [L4586] struct _ddebug descriptor___2 ; [L4587] long tmp___5 ; [L4588] struct _ddebug descriptor___3 ; [L4589] long tmp___6 ; [L4590] int tmp___7 ; [L4591] struct _ddebug descriptor___4 ; [L4592] long tmp___8 ; [L4593] int tmp___9 ; [L4594] struct _ddebug descriptor___5 ; [L4595] long tmp___10 ; [L4596] void *tmp___11 ; [L4597] unsigned int tmp___12 ; [L4598] struct _ddebug descriptor___6 ; [L4599] long tmp___13 ; [L4600] unsigned int tmp___14 ; [L4602] result = 0 [L4603] CALL, EXPR kzalloc(152UL, 208U) [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=152, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={-18446744073709551617:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=4102, \old(size)=152, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=4102, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=152, tmp___2={-18446744073709551617:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=152, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={-18446744073709551617:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4603] RET, EXPR kzalloc(152UL, 208U) [L4603] tmp = kzalloc(152UL, 208U) [L4604] gtco = (struct gtco *)tmp [L4605] CALL, EXPR input_allocate_device() [L3766] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=2144, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103231:0}, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={-36893488147419103231:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=4100, \old(size)=2144, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=4100, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp___2={-36893488147419103231:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=4104, \old(size)=2144, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=4104, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={-36893488147419103231:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) [L3766] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L4605] RET, EXPR input_allocate_device() [L4605] input_dev = input_allocate_device() [L4606] COND FALSE !((unsigned long )gtco == (unsigned long )((struct gtco *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L4612] gtco->inputdevice = input_dev [L4613] CALL, EXPR interface_to_usbdev(usbinterface) [L4956] struct usb_device *tmp ; [L4958] CALL, EXPR ldv_interface_to_usbdev() [L5177] void *result ; [L5178] void *tmp ; [L5180] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=1889, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, ref_cnt=0, SERIAL_STATE=0, size=1889, tmp={-18446744073709551615:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] RET, EXPR ldv_malloc(sizeof(struct usb_device)) [L5180] tmp = ldv_malloc(sizeof(struct usb_device)) [L5181] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-18446744073709551615:0}, SERIAL_STATE=0, tmp={-18446744073709551615:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5182] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-18446744073709551615:0}, SERIAL_STATE=0, tmp={-18446744073709551615:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5186] return (result); VAL [={0:0}, ={0:0}, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={-18446744073709551615:0}, SERIAL_STATE=0, tmp={-18446744073709551615:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4958] RET, EXPR ldv_interface_to_usbdev() [L4958] tmp = ldv_interface_to_usbdev() [L4959] return (tmp); VAL [={0:0}, ={0:0}, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551615:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4613] RET, EXPR interface_to_usbdev(usbinterface) [L4613] tmp___0 = interface_to_usbdev(usbinterface) [L4614] CALL, EXPR ldv_usb_get_dev_4(tmp___0) [L4980] struct usb_device *tmp ; [L4982] CALL, EXPR ldv_get_dev(ldv_func_arg1) [L5191] int tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-18446744073709551615:0}, data={-18446744073709551615:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5193] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)0) [L5194] CALL, EXPR ldv_undef_int() [L3717] int tmp ; [L3719] tmp = __VERIFIER_nondet_int() [L3720] return (tmp); VAL [={0:0}, ={0:0}, \result=178, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=178, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] RET, EXPR ldv_undef_int() [L5194] tmp = ldv_undef_int() [L5195] COND TRUE \read(tmp) [L5196] dev_counter = dev_counter + 1 [L5197] usb_dev = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-18446744073709551615:0}, data={-18446744073709551615:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=178, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5205] return (usb_dev); VAL [={0:0}, ={0:0}, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, data={-18446744073709551615:0}, data={-18446744073709551615:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=178, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4982] RET, EXPR ldv_get_dev(ldv_func_arg1) [L4982] tmp = ldv_get_dev(ldv_func_arg1) [L4983] return (tmp); VAL [={0:0}, ={0:0}, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={-18446744073709551615:0}, ldv_func_arg1={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551615:0}, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4614] RET, EXPR ldv_usb_get_dev_4(tmp___0) [L4614] gtco->usbdev = ldv_usb_get_dev_4(tmp___0) [L4615] gtco->intf = usbinterface [L4616] EXPR gtco->usbdev [L4616] CALL, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L5353] CALL, EXPR ldv_malloc(0UL) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND TRUE tmp___0 != 0 [L3689] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=0, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=0, tmp___0=1, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] RET, EXPR ldv_malloc(0UL) [L5353] return ldv_malloc(0UL); [L4616] RET, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4616] tmp___1 = usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4617] gtco->buffer = (unsigned char *)tmp___1 [L4618] EXPR gtco->buffer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={174:0}, descriptor___0={176:0}, descriptor___1={170:0}, descriptor___2={171:0}, descriptor___3={169:0}, descriptor___4={173:0}, descriptor___5={175:0}, descriptor___6={168:0}, dev_counter=1, gtco={-18446744073709551617:0}, gtco->buffer={0:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={177:0}, id={0:0}, id={0:0}, input_dev={-36893488147419103231:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0={-18446744073709551615:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4618] COND TRUE (unsigned long )gtco->buffer == (unsigned long )((unsigned char *)0U) [L4620] error = -12 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={174:0}, descriptor___0={176:0}, descriptor___1={170:0}, descriptor___2={171:0}, descriptor___3={169:0}, descriptor___4={173:0}, descriptor___5={175:0}, descriptor___6={168:0}, dev_counter=1, error=-12, gtco={-18446744073709551617:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={177:0}, id={0:0}, id={0:0}, input_dev={-36893488147419103231:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0={-18446744073709551615:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4805] FCALL input_free_device(input_dev) [L4806] CALL kfree((void const *)gtco) [L4806] RET kfree((void const *)gtco) [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, error=-12, gtco={-18446744073709551617:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, id={0:0}, id={0:0}, input_dev={-36893488147419103231:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0={-18446744073709551615:0}, tmp___1={0:0}, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4886] RET, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4886] ldv_retval_0 = gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4887] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4915] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L4916] CALL gtco_driverinfo_table_exit() [L4846] CALL ldv_usb_deregister_12(& gtco_driverinfo_table) [L5050] FCALL usb_deregister(arg) [L5051] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, arg={167:0}, arg={167:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4846] RET ldv_usb_deregister_12(& gtco_driverinfo_table) [L4916] RET gtco_driverinfo_table_exit() [L4917] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4950] CALL ldv_check_final_state() [L5283] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5287] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)0)) [L5289] CALL ldv_error() [L3735] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4107:4105}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=-12, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={-18446744073709551615:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 402 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10359 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10359 mSDsluCounter, 20753 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12860 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 7893 mSDtfsCounter, 423 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3175occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 16887 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 1249 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2166 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 40/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-22 22:49:13,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-fcb8e13 [2021-11-22 22:49:15,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 22:49:15,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 22:49:15,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 22:49:15,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 22:49:15,681 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 22:49:15,682 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 22:49:15,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 22:49:15,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 22:49:15,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 22:49:15,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 22:49:15,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 22:49:15,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 22:49:15,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 22:49:15,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 22:49:15,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 22:49:15,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 22:49:15,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 22:49:15,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 22:49:15,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 22:49:15,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 22:49:15,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 22:49:15,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 22:49:15,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 22:49:15,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 22:49:15,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 22:49:15,723 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 22:49:15,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 22:49:15,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 22:49:15,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 22:49:15,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 22:49:15,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 22:49:15,728 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 22:49:15,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 22:49:15,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 22:49:15,730 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 22:49:15,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 22:49:15,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 22:49:15,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 22:49:15,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 22:49:15,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 22:49:15,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-22 22:49:15,768 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 22:49:15,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 22:49:15,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 22:49:15,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 22:49:15,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 22:49:15,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 22:49:15,772 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 22:49:15,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 22:49:15,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 22:49:15,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 22:49:15,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 22:49:15,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 22:49:15,774 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 22:49:15,774 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 22:49:15,774 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 22:49:15,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 22:49:15,774 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 22:49:15,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 22:49:15,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 22:49:15,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 22:49:15,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 22:49:15,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 22:49:15,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 22:49:15,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 22:49:15,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 22:49:15,792 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 22:49:15,792 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 22:49:15,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 22:49:15,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 22:49:15,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 22:49:15,793 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 22:49:15,793 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 22:49:15,793 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 63b56e314339d219b900d45eff744f2905a6b0e7256894e9da7286284d3b0c99 [2021-11-22 22:49:16,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 22:49:16,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 22:49:16,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 22:49:16,138 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 22:49:16,138 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 22:49:16,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:16,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1fca89/f033ce795dc64f0eb2bce458e7998b1c/FLAGae0443e2c [2021-11-22 22:49:16,855 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 22:49:16,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:16,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1fca89/f033ce795dc64f0eb2bce458e7998b1c/FLAGae0443e2c [2021-11-22 22:49:17,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde1fca89/f033ce795dc64f0eb2bce458e7998b1c [2021-11-22 22:49:17,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 22:49:17,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 22:49:17,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 22:49:17,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 22:49:17,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 22:49:17,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:17" (1/1) ... [2021-11-22 22:49:17,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141e59d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:17, skipping insertion in model container [2021-11-22 22:49:17,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:49:17" (1/1) ... [2021-11-22 22:49:17,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 22:49:17,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 22:49:17,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-22 22:49:18,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 22:49:18,199 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-11-22 22:49:18,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 22:49:18,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-22 22:49:18,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 22:49:18,465 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 22:49:18,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i[104745,104758] [2021-11-22 22:49:18,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 22:49:18,790 INFO L208 MainTranslator]: Completed translation [2021-11-22 22:49:18,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18 WrapperNode [2021-11-22 22:49:18,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 22:49:18,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 22:49:18,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 22:49:18,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 22:49:18,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:18,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:18,975 INFO L137 Inliner]: procedures = 126, calls = 1187, calls flagged for inlining = 178, calls inlined = 150, statements flattened = 2667 [2021-11-22 22:49:18,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 22:49:18,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 22:49:18,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 22:49:18,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 22:49:18,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:18,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:18,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:18,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:19,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:19,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:19,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:19,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 22:49:19,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 22:49:19,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 22:49:19,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 22:49:19,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (1/1) ... [2021-11-22 22:49:19,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 22:49:19,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-22 22:49:19,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 22:49:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 22:49:19,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-22 22:49:19,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 22:49:19,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-22 22:49:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 22:49:19,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 22:49:19,601 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 22:49:19,602 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 22:49:30,239 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 22:49:30,248 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 22:49:30,248 INFO L301 CfgBuilder]: Removed 21 assume(true) statements. [2021-11-22 22:49:30,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:30 BoogieIcfgContainer [2021-11-22 22:49:30,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 22:49:30,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 22:49:30,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 22:49:30,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 22:49:30,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:49:17" (1/3) ... [2021-11-22 22:49:30,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e75194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:30, skipping insertion in model container [2021-11-22 22:49:30,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:49:18" (2/3) ... [2021-11-22 22:49:30,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e75194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:49:30, skipping insertion in model container [2021-11-22 22:49:30,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:30" (3/3) ... [2021-11-22 22:49:30,273 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--input--tablet--gtco.ko-entry_point.cil.out.i [2021-11-22 22:49:30,278 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 22:49:30,279 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-22 22:49:30,320 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 22:49:30,324 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 22:49:30,325 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-22 22:49:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 402 states, 396 states have (on average 1.4848484848484849) internal successors, (588), 401 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-22 22:49:30,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:30,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:30,348 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 706937879, now seen corresponding path program 1 times [2021-11-22 22:49:30,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:30,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952846976] [2021-11-22 22:49:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:30,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:30,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:30,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 22:49:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:30,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 844 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:30,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:30,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:31,010 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:31,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952846976] [2021-11-22 22:49:31,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952846976] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:31,011 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:31,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-22 22:49:31,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211421182] [2021-11-22 22:49:31,013 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:31,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 22:49:31,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 22:49:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:31,039 INFO L87 Difference]: Start difference. First operand has 402 states, 396 states have (on average 1.4848484848484849) internal successors, (588), 401 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:31,343 INFO L93 Difference]: Finished difference Result 1505 states and 2228 transitions. [2021-11-22 22:49:31,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 22:49:31,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-22 22:49:31,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:31,370 INFO L225 Difference]: With dead ends: 1505 [2021-11-22 22:49:31,371 INFO L226 Difference]: Without dead ends: 1092 [2021-11-22 22:49:31,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:31,384 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 1532 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:31,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 1567 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-22 22:49:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2021-11-22 22:49:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1092. [2021-11-22 22:49:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1087 states have (on average 1.3992640294388226) internal successors, (1521), 1091 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1521 transitions. [2021-11-22 22:49:31,472 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1521 transitions. Word has length 17 [2021-11-22 22:49:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:31,472 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1521 transitions. [2021-11-22 22:49:31,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1521 transitions. [2021-11-22 22:49:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 22:49:31,474 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:31,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:31,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:31,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:31,676 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -751906786, now seen corresponding path program 1 times [2021-11-22 22:49:31,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637212054] [2021-11-22 22:49:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:31,679 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:31,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:31,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 22:49:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:32,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:32,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:32,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:32,179 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:32,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637212054] [2021-11-22 22:49:32,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637212054] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:32,179 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:32,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 22:49:32,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252942486] [2021-11-22 22:49:32,181 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:32,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:32,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:32,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:32,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:32,189 INFO L87 Difference]: Start difference. First operand 1092 states and 1521 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:32,304 INFO L93 Difference]: Finished difference Result 1124 states and 1551 transitions. [2021-11-22 22:49:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-22 22:49:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:32,310 INFO L225 Difference]: With dead ends: 1124 [2021-11-22 22:49:32,310 INFO L226 Difference]: Without dead ends: 1108 [2021-11-22 22:49:32,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:32,312 INFO L933 BasicCegarLoop]: 549 mSDtfsCounter, 530 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:32,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 564 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2021-11-22 22:49:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1092. [2021-11-22 22:49:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1087 states have (on average 1.3983440662373505) internal successors, (1520), 1091 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1520 transitions. [2021-11-22 22:49:32,389 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1520 transitions. Word has length 23 [2021-11-22 22:49:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:32,389 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1520 transitions. [2021-11-22 22:49:32,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1520 transitions. [2021-11-22 22:49:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-22 22:49:32,390 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:32,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:32,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:32,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:32,592 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:32,592 INFO L85 PathProgramCache]: Analyzing trace with hash -750059744, now seen corresponding path program 1 times [2021-11-22 22:49:32,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621600516] [2021-11-22 22:49:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:32,594 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:32,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:32,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 22:49:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:32,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 22:49:32,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:33,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:33,281 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:33,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621600516] [2021-11-22 22:49:33,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621600516] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:33,281 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:33,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-22 22:49:33,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040252660] [2021-11-22 22:49:33,281 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:33,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 22:49:33,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 22:49:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:33,282 INFO L87 Difference]: Start difference. First operand 1092 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:33,433 INFO L93 Difference]: Finished difference Result 3258 states and 4541 transitions. [2021-11-22 22:49:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 22:49:33,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-22 22:49:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:33,443 INFO L225 Difference]: With dead ends: 3258 [2021-11-22 22:49:33,443 INFO L226 Difference]: Without dead ends: 2174 [2021-11-22 22:49:33,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:33,446 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 1029 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:33,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 1045 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2021-11-22 22:49:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2162. [2021-11-22 22:49:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 2157 states have (on average 1.3963838664812238) internal successors, (3012), 2161 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 3012 transitions. [2021-11-22 22:49:33,517 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 3012 transitions. Word has length 23 [2021-11-22 22:49:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:33,517 INFO L470 AbstractCegarLoop]: Abstraction has 2162 states and 3012 transitions. [2021-11-22 22:49:33,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 3012 transitions. [2021-11-22 22:49:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-22 22:49:33,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:33,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:33,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:33,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:33,734 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1777015848, now seen corresponding path program 1 times [2021-11-22 22:49:33,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146250124] [2021-11-22 22:49:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:33,736 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:33,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:33,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:33,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 22:49:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:34,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 22:49:34,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:34,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:34,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:34,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146250124] [2021-11-22 22:49:34,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146250124] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:34,460 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:34,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-22 22:49:34,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465728279] [2021-11-22 22:49:34,461 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:34,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 22:49:34,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 22:49:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:34,462 INFO L87 Difference]: Start difference. First operand 2162 states and 3012 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:34,709 INFO L93 Difference]: Finished difference Result 8587 states and 11969 transitions. [2021-11-22 22:49:34,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 22:49:34,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-11-22 22:49:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:34,735 INFO L225 Difference]: With dead ends: 8587 [2021-11-22 22:49:34,735 INFO L226 Difference]: Without dead ends: 6433 [2021-11-22 22:49:34,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 22:49:34,741 INFO L933 BasicCegarLoop]: 943 mSDtfsCounter, 1515 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:34,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 1968 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6433 states. [2021-11-22 22:49:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6433 to 4285. [2021-11-22 22:49:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4285 states, 4280 states have (on average 1.394392523364486) internal successors, (5968), 4284 states have internal predecessors, (5968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4285 states to 4285 states and 5968 transitions. [2021-11-22 22:49:34,957 INFO L78 Accepts]: Start accepts. Automaton has 4285 states and 5968 transitions. Word has length 24 [2021-11-22 22:49:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 4285 states and 5968 transitions. [2021-11-22 22:49:34,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4285 states and 5968 transitions. [2021-11-22 22:49:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-22 22:49:34,963 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:34,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:34,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:35,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:35,178 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash 747083307, now seen corresponding path program 1 times [2021-11-22 22:49:35,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:35,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104360818] [2021-11-22 22:49:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:35,180 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:35,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:35,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:35,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 22:49:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:35,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:35,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:35,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:35,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104360818] [2021-11-22 22:49:35,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104360818] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:35,695 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:35,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 22:49:35,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687087151] [2021-11-22 22:49:35,695 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:35,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:35,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:35,696 INFO L87 Difference]: Start difference. First operand 4285 states and 5968 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:35,919 INFO L93 Difference]: Finished difference Result 6425 states and 8946 transitions. [2021-11-22 22:49:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-22 22:49:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:35,943 INFO L225 Difference]: With dead ends: 6425 [2021-11-22 22:49:35,944 INFO L226 Difference]: Without dead ends: 6423 [2021-11-22 22:49:35,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:35,946 INFO L933 BasicCegarLoop]: 944 mSDtfsCounter, 504 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:35,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [504 Valid, 1461 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6423 states. [2021-11-22 22:49:36,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6423 to 6421. [2021-11-22 22:49:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 6416 states have (on average 1.3938591022443891) internal successors, (8943), 6420 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 8943 transitions. [2021-11-22 22:49:36,227 INFO L78 Accepts]: Start accepts. Automaton has 6421 states and 8943 transitions. Word has length 25 [2021-11-22 22:49:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:36,228 INFO L470 AbstractCegarLoop]: Abstraction has 6421 states and 8943 transitions. [2021-11-22 22:49:36,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6421 states and 8943 transitions. [2021-11-22 22:49:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-22 22:49:36,230 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:36,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:36,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:36,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:36,445 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1684745795, now seen corresponding path program 1 times [2021-11-22 22:49:36,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:36,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615265614] [2021-11-22 22:49:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:36,447 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:36,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:36,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-22 22:49:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:36,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:36,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:36,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:36,912 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:36,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615265614] [2021-11-22 22:49:36,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615265614] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:36,912 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:36,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 22:49:36,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945800070] [2021-11-22 22:49:36,912 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:36,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:36,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:36,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:36,914 INFO L87 Difference]: Start difference. First operand 6421 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:37,094 INFO L93 Difference]: Finished difference Result 6421 states and 8943 transitions. [2021-11-22 22:49:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:37,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-22 22:49:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:37,118 INFO L225 Difference]: With dead ends: 6421 [2021-11-22 22:49:37,118 INFO L226 Difference]: Without dead ends: 6419 [2021-11-22 22:49:37,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:37,122 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 509 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:37,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 532 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:37,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2021-11-22 22:49:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 6419. [2021-11-22 22:49:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6419 states, 6415 states have (on average 1.3937646141855027) internal successors, (8941), 6418 states have internal predecessors, (8941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6419 states to 6419 states and 8941 transitions. [2021-11-22 22:49:37,395 INFO L78 Accepts]: Start accepts. Automaton has 6419 states and 8941 transitions. Word has length 26 [2021-11-22 22:49:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:37,397 INFO L470 AbstractCegarLoop]: Abstraction has 6419 states and 8941 transitions. [2021-11-22 22:49:37,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 6419 states and 8941 transitions. [2021-11-22 22:49:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-22 22:49:37,399 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:37,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:49:37,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-22 22:49:37,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:37,607 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash 687511862, now seen corresponding path program 1 times [2021-11-22 22:49:37,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:37,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252034543] [2021-11-22 22:49:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:37,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:37,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:37,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-22 22:49:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:37,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:37,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:37,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:38,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:38,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:38,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252034543] [2021-11-22 22:49:38,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252034543] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:38,047 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:38,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 22:49:38,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604290987] [2021-11-22 22:49:38,047 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:38,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:38,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:38,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:38,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:38,048 INFO L87 Difference]: Start difference. First operand 6419 states and 8941 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:38,244 INFO L93 Difference]: Finished difference Result 6419 states and 8941 transitions. [2021-11-22 22:49:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-22 22:49:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:38,266 INFO L225 Difference]: With dead ends: 6419 [2021-11-22 22:49:38,266 INFO L226 Difference]: Without dead ends: 6408 [2021-11-22 22:49:38,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:38,269 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 506 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:38,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [506 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 22:49:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6408 states. [2021-11-22 22:49:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6408 to 6408. [2021-11-22 22:49:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6408 states, 6405 states have (on average 1.3937548790007805) internal successors, (8927), 6407 states have internal predecessors, (8927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6408 states to 6408 states and 8927 transitions. [2021-11-22 22:49:38,580 INFO L78 Accepts]: Start accepts. Automaton has 6408 states and 8927 transitions. Word has length 27 [2021-11-22 22:49:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:38,580 INFO L470 AbstractCegarLoop]: Abstraction has 6408 states and 8927 transitions. [2021-11-22 22:49:38,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6408 states and 8927 transitions. [2021-11-22 22:49:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-22 22:49:38,583 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:38,584 INFO L514 BasicCegarLoop]: 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] [2021-11-22 22:49:38,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:38,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:38,799 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:38,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1483099283, now seen corresponding path program 1 times [2021-11-22 22:49:38,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:38,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911794582] [2021-11-22 22:49:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:38,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:38,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:38,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-22 22:49:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:39,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 1179 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-22 22:49:39,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:39,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 22:49:39,447 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:39,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911794582] [2021-11-22 22:49:39,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911794582] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:39,447 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:39,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-22 22:49:39,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342681186] [2021-11-22 22:49:39,447 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:39,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-22 22:49:39,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:39,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-22 22:49:39,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:39,448 INFO L87 Difference]: Start difference. First operand 6408 states and 8927 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:39,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:39,818 INFO L93 Difference]: Finished difference Result 13072 states and 18228 transitions. [2021-11-22 22:49:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 22:49:39,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-22 22:49:39,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:39,833 INFO L225 Difference]: With dead ends: 13072 [2021-11-22 22:49:39,833 INFO L226 Difference]: Without dead ends: 6672 [2021-11-22 22:49:39,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-22 22:49:39,844 INFO L933 BasicCegarLoop]: 532 mSDtfsCounter, 36 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:39,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1040 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-22 22:49:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6672 states. [2021-11-22 22:49:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6672 to 6623. [2021-11-22 22:49:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6623 states, 6620 states have (on average 1.3953172205438067) internal successors, (9237), 6622 states have internal predecessors, (9237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6623 states to 6623 states and 9237 transitions. [2021-11-22 22:49:40,129 INFO L78 Accepts]: Start accepts. Automaton has 6623 states and 9237 transitions. Word has length 62 [2021-11-22 22:49:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:40,130 INFO L470 AbstractCegarLoop]: Abstraction has 6623 states and 9237 transitions. [2021-11-22 22:49:40,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 6623 states and 9237 transitions. [2021-11-22 22:49:40,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-22 22:49:40,133 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:40,133 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:40,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:40,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:40,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash 609201411, now seen corresponding path program 1 times [2021-11-22 22:49:40,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:40,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541929661] [2021-11-22 22:49:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:40,355 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:40,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:40,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:40,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-22 22:49:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:40,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 22:49:40,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:41,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:41,459 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:41,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541929661] [2021-11-22 22:49:41,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541929661] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:41,459 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:41,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2021-11-22 22:49:41,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91730361] [2021-11-22 22:49:41,459 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:41,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-22 22:49:41,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-22 22:49:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-11-22 22:49:41,461 INFO L87 Difference]: Start difference. First operand 6623 states and 9237 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:44,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:46,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:48,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:48,483 INFO L93 Difference]: Finished difference Result 23570 states and 32454 transitions. [2021-11-22 22:49:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-22 22:49:48,484 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-22 22:49:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:48,524 INFO L225 Difference]: With dead ends: 23570 [2021-11-22 22:49:48,525 INFO L226 Difference]: Without dead ends: 16955 [2021-11-22 22:49:48,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-11-22 22:49:48,540 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 4447 mSDsluCounter, 4868 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 5460 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:48,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4447 Valid, 5460 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 218 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2021-11-22 22:49:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16955 states. [2021-11-22 22:49:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16955 to 6731. [2021-11-22 22:49:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6731 states, 6728 states have (on average 1.3889714625445897) internal successors, (9345), 6730 states have internal predecessors, (9345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 9345 transitions. [2021-11-22 22:49:49,066 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 9345 transitions. Word has length 71 [2021-11-22 22:49:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:49,067 INFO L470 AbstractCegarLoop]: Abstraction has 6731 states and 9345 transitions. [2021-11-22 22:49:49,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 9345 transitions. [2021-11-22 22:49:49,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-22 22:49:49,070 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:49,070 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:49,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:49,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:49,303 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -700975289, now seen corresponding path program 1 times [2021-11-22 22:49:49,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:49,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942855105] [2021-11-22 22:49:49,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:49,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:49,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:49,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:49,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-22 22:49:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:49:49,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-22 22:49:49,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:49:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:50,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:49:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:49:50,320 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:49:50,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942855105] [2021-11-22 22:49:50,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942855105] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:49:50,320 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:49:50,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-11-22 22:49:50,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655980114] [2021-11-22 22:49:50,321 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:49:50,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-22 22:49:50,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:49:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 22:49:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-11-22 22:49:50,321 INFO L87 Difference]: Start difference. First operand 6731 states and 9345 transitions. Second operand has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:54,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:56,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:58,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 22:49:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:49:58,687 INFO L93 Difference]: Finished difference Result 24719 states and 33951 transitions. [2021-11-22 22:49:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 22:49:58,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-11-22 22:49:58,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:49:58,748 INFO L225 Difference]: With dead ends: 24719 [2021-11-22 22:49:58,748 INFO L226 Difference]: Without dead ends: 17996 [2021-11-22 22:49:58,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-11-22 22:49:58,764 INFO L933 BasicCegarLoop]: 589 mSDtfsCounter, 4620 mSDsluCounter, 3790 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 4379 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2021-11-22 22:49:58,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4620 Valid, 4379 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 155 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2021-11-22 22:49:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17996 states. [2021-11-22 22:49:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17996 to 6857. [2021-11-22 22:49:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6857 states, 6854 states have (on average 1.3844470382258536) internal successors, (9489), 6856 states have internal predecessors, (9489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 9489 transitions. [2021-11-22 22:49:59,280 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 9489 transitions. Word has length 73 [2021-11-22 22:49:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:49:59,280 INFO L470 AbstractCegarLoop]: Abstraction has 6857 states and 9489 transitions. [2021-11-22 22:49:59,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.166666666666667) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:49:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 9489 transitions. [2021-11-22 22:49:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-22 22:49:59,282 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:49:59,283 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:49:59,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-22 22:49:59,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:49:59,505 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:49:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:49:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash 176421315, now seen corresponding path program 1 times [2021-11-22 22:49:59,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:49:59,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663805490] [2021-11-22 22:49:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:49:59,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:49:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:49:59,508 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:49:59,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-22 22:50:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:50:00,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 1227 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-22 22:50:00,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:50:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:50:00,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:50:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:50:00,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:50:00,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663805490] [2021-11-22 22:50:00,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663805490] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:50:00,322 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:50:00,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-22 22:50:00,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847640813] [2021-11-22 22:50:00,323 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:50:00,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-22 22:50:00,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:50:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 22:50:00,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-22 22:50:00,324 INFO L87 Difference]: Start difference. First operand 6857 states and 9489 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:50:01,165 INFO L93 Difference]: Finished difference Result 19715 states and 27423 transitions. [2021-11-22 22:50:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-22 22:50:01,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-22 22:50:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:50:01,194 INFO L225 Difference]: With dead ends: 19715 [2021-11-22 22:50:01,194 INFO L226 Difference]: Without dead ends: 12830 [2021-11-22 22:50:01,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-22 22:50:01,210 INFO L933 BasicCegarLoop]: 578 mSDtfsCounter, 472 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 22:50:01,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 2155 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 22:50:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12830 states. [2021-11-22 22:50:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12830 to 6857. [2021-11-22 22:50:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6857 states, 6854 states have (on average 1.3818208345491683) internal successors, (9471), 6856 states have internal predecessors, (9471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 9471 transitions. [2021-11-22 22:50:01,762 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 9471 transitions. Word has length 75 [2021-11-22 22:50:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:50:01,764 INFO L470 AbstractCegarLoop]: Abstraction has 6857 states and 9471 transitions. [2021-11-22 22:50:01,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 9471 transitions. [2021-11-22 22:50:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 22:50:01,766 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:50:01,766 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:50:01,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-22 22:50:01,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:50:01,988 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:50:01,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:50:01,989 INFO L85 PathProgramCache]: Analyzing trace with hash -896980769, now seen corresponding path program 1 times [2021-11-22 22:50:01,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:50:01,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220831259] [2021-11-22 22:50:01,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:50:01,990 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:50:01,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:50:01,991 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:50:01,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-22 22:50:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 22:50:02,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-22 22:50:02,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 22:50:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:50:02,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 22:50:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-22 22:50:02,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 22:50:02,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220831259] [2021-11-22 22:50:02,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220831259] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 22:50:02,813 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 22:50:02,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-22 22:50:02,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273864960] [2021-11-22 22:50:02,813 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 22:50:02,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-22 22:50:02,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 22:50:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-22 22:50:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-22 22:50:02,814 INFO L87 Difference]: Start difference. First operand 6857 states and 9471 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 22:50:04,210 INFO L93 Difference]: Finished difference Result 28877 states and 39687 transitions. [2021-11-22 22:50:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-22 22:50:04,211 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-22 22:50:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 22:50:04,242 INFO L225 Difference]: With dead ends: 28877 [2021-11-22 22:50:04,242 INFO L226 Difference]: Without dead ends: 22028 [2021-11-22 22:50:04,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-11-22 22:50:04,257 INFO L933 BasicCegarLoop]: 1032 mSDtfsCounter, 1566 mSDsluCounter, 3762 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 4794 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-22 22:50:04,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1566 Valid, 4794 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-22 22:50:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22028 states. [2021-11-22 22:50:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22028 to 6893. [2021-11-22 22:50:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6893 states, 6890 states have (on average 1.3798258345428156) internal successors, (9507), 6892 states have internal predecessors, (9507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6893 states to 6893 states and 9507 transitions. [2021-11-22 22:50:04,846 INFO L78 Accepts]: Start accepts. Automaton has 6893 states and 9507 transitions. Word has length 77 [2021-11-22 22:50:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 22:50:04,847 INFO L470 AbstractCegarLoop]: Abstraction has 6893 states and 9507 transitions. [2021-11-22 22:50:04,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 22:50:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6893 states and 9507 transitions. [2021-11-22 22:50:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-22 22:50:04,849 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 22:50:04,849 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2021-11-22 22:50:04,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-22 22:50:05,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:50:05,073 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-22 22:50:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 22:50:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1908098019, now seen corresponding path program 1 times [2021-11-22 22:50:05,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 22:50:05,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209554994] [2021-11-22 22:50:05,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 22:50:05,075 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 22:50:05,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-22 22:50:05,076 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 22:50:05,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-22 22:50:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 22:50:14,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 22:50:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 22:50:23,541 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-22 22:50:23,541 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 22:50:23,542 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-22 22:50:23,543 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-22 22:50:23,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-22 22:50:23,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-22 22:50:23,544 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-22 22:50:23,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-22 22:50:23,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-22 22:50:23,748 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 22:50:23,751 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 22:50:23,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:50:23 BoogieIcfgContainer [2021-11-22 22:50:23,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 22:50:23,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 22:50:23,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 22:50:23,944 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 22:50:23,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:49:30" (3/4) ... [2021-11-22 22:50:23,947 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-22 22:50:24,113 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-11-22 22:50:24,114 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 22:50:24,114 INFO L158 Benchmark]: Toolchain (without parser) took 66883.62ms. Allocated memory was 56.6MB in the beginning and 1.0GB in the end (delta: 979.4MB). Free memory was 28.4MB in the beginning and 837.9MB in the end (delta: -809.6MB). Peak memory consumption was 170.2MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,114 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 22:50:24,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1557.89ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 28.2MB in the beginning and 48.4MB in the end (delta: -20.1MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 183.63ms. Allocated memory is still 111.1MB. Free memory was 48.4MB in the beginning and 59.3MB in the end (delta: -10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,116 INFO L158 Benchmark]: Boogie Preprocessor took 141.92ms. Allocated memory is still 111.1MB. Free memory was 59.3MB in the beginning and 45.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,116 INFO L158 Benchmark]: RCFGBuilder took 11131.40ms. Allocated memory was 111.1MB in the beginning and 207.6MB in the end (delta: 96.5MB). Free memory was 45.1MB in the beginning and 67.0MB in the end (delta: -21.9MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,117 INFO L158 Benchmark]: TraceAbstraction took 53691.70ms. Allocated memory was 207.6MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 67.0MB in the beginning and 880.9MB in the end (delta: -813.9MB). Peak memory consumption was 580.7MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,117 INFO L158 Benchmark]: Witness Printer took 169.96ms. Allocated memory is still 1.0GB. Free memory was 879.9MB in the beginning and 837.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-11-22 22:50:24,121 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.19ms. Allocated memory is still 56.6MB. Free memory was 38.5MB in the beginning and 38.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1557.89ms. Allocated memory was 56.6MB in the beginning and 111.1MB in the end (delta: 54.5MB). Free memory was 28.2MB in the beginning and 48.4MB in the end (delta: -20.1MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 183.63ms. Allocated memory is still 111.1MB. Free memory was 48.4MB in the beginning and 59.3MB in the end (delta: -10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.92ms. Allocated memory is still 111.1MB. Free memory was 59.3MB in the beginning and 45.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * RCFGBuilder took 11131.40ms. Allocated memory was 111.1MB in the beginning and 207.6MB in the end (delta: 96.5MB). Free memory was 45.1MB in the beginning and 67.0MB in the end (delta: -21.9MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53691.70ms. Allocated memory was 207.6MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 67.0MB in the beginning and 880.9MB in the end (delta: -813.9MB). Peak memory consumption was 580.7MB. Max. memory is 16.1GB. * Witness Printer took 169.96ms. Allocated memory is still 1.0GB. Free memory was 879.9MB in the beginning and 837.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 3735]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3758] int ldv_state_variable_1 ; [L3759] int LDV_IN_INTERRUPT = 1; [L3760] int usb_counter ; [L3761] struct usb_interface *gtco_driverinfo_table_group1 ; [L3762] int ref_cnt ; [L3763] int ldv_state_variable_0 ; [L3830-L3844] static struct usb_device_id const gtco_usbid_table[6U] = { {3U, 1932U, 1024U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 1025U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4096U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4097U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {3U, 1932U, 4098U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L3845] struct usb_device_id const __mod_usb_device_table ; [L4829-L4834] static struct usb_driver gtco_driverinfo_table = {"gtco", & gtco_probe, & gtco_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& gtco_usbid_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0}; [L4850] int ldv_retval_0 ; [L4851] int ldv_retval_1 ; [L5064] int INTERF_STATE = 0; [L5065] int SERIAL_STATE = 0; [L5066] void *usb_intfdata = 0; [L5067] struct urb *usb_urb = 0; [L5068] struct usb_device *usb_dev = 0; [L5069] int dev_counter = 0; [L5070] int completeFnIntCounter = 0; [L5071] int completeFnBulkCounter = 0; [L5072] void (*completeFnInt)(struct urb * ) ; [L5073] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4865] struct usb_device_id *ldvarg0 ; [L4866] void *tmp ; [L4867] int tmp___0 ; [L4868] int tmp___1 ; [L4869] int tmp___2 ; [L4871] CALL, EXPR ldv_zalloc(32UL) [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=2, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4871] RET, EXPR ldv_zalloc(32UL) [L4871] tmp = ldv_zalloc(32UL) [L4872] ldvarg0 = (struct usb_device_id *)tmp [L4873] FCALL ldv_initialize() [L4874] ldv_state_variable_1 = 0 [L4875] ref_cnt = 0 [L4876] ldv_state_variable_0 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: [L4922] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4923] COND TRUE ldv_state_variable_0 == 1 [L4924] CALL, EXPR gtco_driverinfo_table_init() [L4837] int tmp ; [L4839] CALL, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L5036] ldv_func_ret_type ldv_func_res ; [L5037] int tmp ; [L5039] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5370] return __VERIFIER_nondet_int(); [L5039] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5039] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L5040] ldv_func_res = tmp [L5041] ldv_state_variable_1 = 1 [L5042] usb_counter = 0 [L5043] CALL ldv_usb_driver_1() [L4856] void *tmp ; [L4858] CALL, EXPR ldv_zalloc(1520UL) [L3700] void *p ; [L3701] void *tmp ; [L3702] int tmp___0 ; [L3704] tmp___0 = __VERIFIER_nondet_int() [L3705] COND TRUE tmp___0 != 0 [L3706] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=1520, tmp___0=2, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4858] RET, EXPR ldv_zalloc(1520UL) [L4858] tmp = ldv_zalloc(1520UL) [L4859] gtco_driverinfo_table_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5043] RET ldv_usb_driver_1() [L5044] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={167:0}, ldv_func_arg1={167:0}, ldv_func_arg2={168:169}, ldv_func_arg2={168:169}, ldv_func_arg3={165:0}, ldv_func_arg3={165:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4839] RET, EXPR ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4839] tmp = ldv_usb_register_driver_11(& gtco_driverinfo_table, & __this_module, "gtco") [L4840] return (tmp); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4924] RET, EXPR gtco_driverinfo_table_init() [L4924] ldv_retval_1 = gtco_driverinfo_table_init() [L4925] COND TRUE ldv_retval_1 == 0 [L4926] ldv_state_variable_0 = 3 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4929] COND FALSE !(ldv_retval_1 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4881] COND TRUE ldv_state_variable_1 != 0 [L4882] tmp___1 = __VERIFIER_nondet_int() [L4884] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4885] COND TRUE ldv_state_variable_1 == 1 [L4886] CALL, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4569] struct gtco *gtco ; [L4570] struct input_dev *input_dev ; [L4571] struct hid_descriptor *hid_desc ; [L4572] char *report ; [L4573] int result ; [L4574] int retry ; [L4575] int error ; [L4576] struct usb_endpoint_descriptor *endpoint ; [L4577] void *tmp ; [L4578] struct usb_device *tmp___0 ; [L4579] void *tmp___1 ; [L4580] struct _ddebug descriptor ; [L4581] long tmp___2 ; [L4582] struct _ddebug descriptor___0 ; [L4583] long tmp___3 ; [L4584] struct _ddebug descriptor___1 ; [L4585] long tmp___4 ; [L4586] struct _ddebug descriptor___2 ; [L4587] long tmp___5 ; [L4588] struct _ddebug descriptor___3 ; [L4589] long tmp___6 ; [L4590] int tmp___7 ; [L4591] struct _ddebug descriptor___4 ; [L4592] long tmp___8 ; [L4593] int tmp___9 ; [L4594] struct _ddebug descriptor___5 ; [L4595] long tmp___10 ; [L4596] void *tmp___11 ; [L4597] unsigned int tmp___12 ; [L4598] struct _ddebug descriptor___6 ; [L4599] long tmp___13 ; [L4600] unsigned int tmp___14 ; [L4602] result = 0 [L4603] CALL, EXPR kzalloc(152UL, 208U) [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=152, \result={215:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={215:0}, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={215:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=32976, \old(size)=152, \result={215:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32976, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=152, tmp___2={215:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=152, \result={215:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=152, tmp={215:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4603] RET, EXPR kzalloc(152UL, 208U) [L4603] tmp = kzalloc(152UL, 208U) [L4604] gtco = (struct gtco *)tmp [L4605] CALL, EXPR input_allocate_device() [L3766] CALL, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) [L3667] void *tmp ; [L3669] CALL, EXPR kmalloc(size, flags | 32768U) [L3658] void *tmp___2 ; [L3660] CALL, EXPR __kmalloc(size, flags) [L3653] CALL, EXPR ldv_malloc(size) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=2144, \result={213:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={213:0}, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={213:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3653] RET, EXPR ldv_malloc(size) [L3653] return ldv_malloc(size); [L3660] RET, EXPR __kmalloc(size, flags) [L3660] tmp___2 = __kmalloc(size, flags) [L3661] return (tmp___2); VAL [={0:0}, ={0:0}, \old(flags)=32976, \old(size)=2144, \result={213:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=32976, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp___2={213:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3669] RET, EXPR kmalloc(size, flags | 32768U) [L3669] tmp = kmalloc(size, flags | 32768U) [L3670] return (tmp); VAL [={0:0}, ={0:0}, \old(flags)=208, \old(size)=2144, \result={213:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, flags=208, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=2144, tmp={213:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3766] RET, EXPR kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u) [L3766] return kzalloc(sizeof(struct input_dev), 0x10u | 0x40u | 0x80u); [L4605] RET, EXPR input_allocate_device() [L4605] input_dev = input_allocate_device() [L4606] COND FALSE !((unsigned long )gtco == (unsigned long )((struct gtco *)0) || (unsigned long )input_dev == (unsigned long )((struct input_dev *)0)) [L4612] gtco->inputdevice = input_dev [L4613] CALL, EXPR interface_to_usbdev(usbinterface) [L4956] struct usb_device *tmp ; [L4958] CALL, EXPR ldv_interface_to_usbdev() [L5177] void *result ; [L5178] void *tmp ; [L5180] CALL, EXPR ldv_malloc(sizeof(struct usb_device)) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND FALSE !(tmp___0 != 0) [L3691] tmp = malloc(size) [L3692] p = tmp [L3693] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3679] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L3693] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L3694] return (p); VAL [={0:0}, ={0:0}, \old(size)=1889, \result={223:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, p={223:0}, ref_cnt=0, SERIAL_STATE=0, size=1889, tmp={223:0}, tmp___0=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5180] RET, EXPR ldv_malloc(sizeof(struct usb_device)) [L5180] tmp = ldv_malloc(sizeof(struct usb_device)) [L5181] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={223:0}, SERIAL_STATE=0, tmp={223:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5182] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={223:0}, SERIAL_STATE=0, tmp={223:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5186] return (result); VAL [={0:0}, ={0:0}, \result={223:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result={223:0}, SERIAL_STATE=0, tmp={223:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4958] RET, EXPR ldv_interface_to_usbdev() [L4958] tmp = ldv_interface_to_usbdev() [L4959] return (tmp); VAL [={0:0}, ={0:0}, \result={223:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, intf={0:0}, intf={0:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={223:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4613] RET, EXPR interface_to_usbdev(usbinterface) [L4613] tmp___0 = interface_to_usbdev(usbinterface) [L4614] CALL, EXPR ldv_usb_get_dev_4(tmp___0) [L4980] struct usb_device *tmp ; [L4982] CALL, EXPR ldv_get_dev(ldv_func_arg1) [L5191] int tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={223:0}, data={223:0}, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5193] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)0) [L5194] CALL, EXPR ldv_undef_int() [L3717] int tmp ; [L3719] tmp = __VERIFIER_nondet_int() [L3720] return (tmp); VAL [={0:0}, ={0:0}, \result=-2139095036, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=2155872260, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5194] RET, EXPR ldv_undef_int() [L5194] tmp = ldv_undef_int() [L5195] COND TRUE \read(tmp) [L5196] dev_counter = dev_counter + 1 [L5197] usb_dev = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={223:0}, data={223:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=2155872260, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5205] return (usb_dev); VAL [={0:0}, ={0:0}, \result={223:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, data={223:0}, data={223:0}, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp=2155872260, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4982] RET, EXPR ldv_get_dev(ldv_func_arg1) [L4982] tmp = ldv_get_dev(ldv_func_arg1) [L4983] return (tmp); VAL [={0:0}, ={0:0}, \result={223:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, ldv_func_arg1={223:0}, ldv_func_arg1={223:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, tmp={223:0}, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4614] RET, EXPR ldv_usb_get_dev_4(tmp___0) [L4614] gtco->usbdev = ldv_usb_get_dev_4(tmp___0) [L4615] gtco->intf = usbinterface [L4616] EXPR gtco->usbdev [L4616] CALL, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L5353] CALL, EXPR ldv_malloc(0UL) [L3683] void *p ; [L3684] void *tmp ; [L3685] int tmp___0 ; [L3687] tmp___0 = __VERIFIER_nondet_int() [L3688] COND TRUE tmp___0 != 0 [L3689] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=0, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, SERIAL_STATE=0, size=0, tmp___0=2, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5353] RET, EXPR ldv_malloc(0UL) [L5353] return ldv_malloc(0UL); [L4616] RET, EXPR usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4616] tmp___1 = usb_alloc_coherent(gtco->usbdev, 10UL, 208U, & gtco->buf_dma) [L4617] gtco->buffer = (unsigned char *)tmp___1 [L4618] EXPR gtco->buffer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775561:0}, descriptor___0={293:0}, descriptor___1={-9223372036854775707:0}, descriptor___2={1152921504606847077:0}, descriptor___3={342:0}, descriptor___4={356:0}, descriptor___5={-9223372036854775708:0}, descriptor___6={4611686018427388005:0}, dev_counter=1, gtco={215:0}, gtco->buffer={0:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={67108965:0}, id={0:0}, id={0:0}, input_dev={213:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={215:0}, tmp___0={223:0}, tmp___1={0:0}, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4618] COND TRUE (unsigned long )gtco->buffer == (unsigned long )((unsigned char *)0U) [L4620] error = -12 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={-9223372036854775561:0}, descriptor___0={293:0}, descriptor___1={-9223372036854775707:0}, descriptor___2={1152921504606847077:0}, descriptor___3={342:0}, descriptor___4={356:0}, descriptor___5={-9223372036854775708:0}, descriptor___6={4611686018427388005:0}, dev_counter=1, error=4294967284, gtco={215:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, hid_desc={67108965:0}, id={0:0}, id={0:0}, input_dev={213:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={215:0}, tmp___0={223:0}, tmp___1={0:0}, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4805] FCALL input_free_device(input_dev) [L4806] CALL kfree((void const *)gtco) [L4806] RET kfree((void const *)gtco) [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); [L4807] return (error); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, error=4294967284, gtco={215:0}, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, id={0:0}, id={0:0}, input_dev={213:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ref_cnt=0, result=0, SERIAL_STATE=0, tmp={215:0}, tmp___0={223:0}, tmp___1={0:0}, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}, usbinterface={0:0}, usbinterface={0:0}] [L4886] RET, EXPR gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4886] ldv_retval_0 = gtco_probe(gtco_driverinfo_table_group1, (struct usb_device_id const *)ldvarg0) [L4887] COND FALSE !(ldv_retval_0 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=0, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4878] tmp___0 = __VERIFIER_nondet_int() [L4880] case 0: [L4910] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=1, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4911] COND TRUE ldv_state_variable_0 != 0 [L4912] tmp___2 = __VERIFIER_nondet_int() [L4914] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4915] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L4916] CALL gtco_driverinfo_table_exit() [L4846] CALL ldv_usb_deregister_12(& gtco_driverinfo_table) [L5050] FCALL usb_deregister(arg) [L5051] ldv_state_variable_1 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, arg={167:0}, arg={167:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4846] RET ldv_usb_deregister_12(& gtco_driverinfo_table) [L4916] RET gtco_driverinfo_table_exit() [L4917] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ldvarg0={0:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0=1, tmp___1=0, tmp___2=0, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L4950] CALL ldv_check_final_state() [L5283] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5287] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)0)) [L5289] CALL ldv_error() [L3735] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={168:169}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, gtco_driverinfo_table={167:0}, gtco_driverinfo_table_group1={0:0}, gtco_usbid_table={166:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=4294967284, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=0, ref_cnt=0, SERIAL_STATE=0, usb_counter=0, usb_dev={223:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3735]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 402 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 53.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 17266 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17266 mSDsluCounter, 25496 SdHoareTripleChecker+Invalid, 14.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17599 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 545 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 7897 mSDtfsCounter, 545 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1061 GetRequests, 990 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6893occurred in iteration=12, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 44698 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 12.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 600 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1022 ConstructedInterpolants, 0 QuantifiedInterpolants, 2031 SizeOfPredicates, 42 NumberOfNonLiveVariables, 12184 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 76/76 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-22 22:50:24,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE