./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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.0/usb_urb-drivers-net-usb-catc.ko.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:01:22,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:01:22,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:01:22,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:01:22,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:01:22,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:01:22,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:01:22,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:01:22,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:01:22,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:01:22,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:01:22,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:01:22,747 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:01:22,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:01:22,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:01:22,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:01:22,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:01:22,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:01:22,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:01:22,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:01:22,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:01:22,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:01:22,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:01:22,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:01:22,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:01:22,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:01:22,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:01:22,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:01:22,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:01:22,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:01:22,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:01:22,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:01:22,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:01:22,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:01:22,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:01:22,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:01:22,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:01:22,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:01:22,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:01:22,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:01:22,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:01:22,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 12:01:22,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:01:22,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:01:22,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:01:22,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:01:22,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:01:22,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:01:22,805 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:01:22,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:01:22,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 12:01:22,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:01:22,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:01:22,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:01:22,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:01:22,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:01:22,807 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:01:22,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:01:22,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:01:22,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:01:22,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:01:22,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:22,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:01:22,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:01:22,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:01:22,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 12:01:22,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 12:01:22,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:01:22,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:01:22,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:01:22,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:01:22,809 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-06 12:01:22,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:01:23,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:01:23,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:01:23,023 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:01:23,025 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:01:23,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:01:23,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c77d7f8/31a40b22c9044d0bba801d731e0ef72a/FLAG76b2a5d5f [2021-11-06 12:01:23,725 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:01:23,726 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:01:23,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c77d7f8/31a40b22c9044d0bba801d731e0ef72a/FLAG76b2a5d5f [2021-11-06 12:01:24,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69c77d7f8/31a40b22c9044d0bba801d731e0ef72a [2021-11-06 12:01:24,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:01:24,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:01:24,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:24,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:01:24,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:01:24,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:24" (1/1) ... [2021-11-06 12:01:24,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1696f8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:24, skipping insertion in model container [2021-11-06 12:01:24,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:01:24" (1/1) ... [2021-11-06 12:01:24,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:01:24,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:01:25,179 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-06 12:01:25,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:25,268 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:01:25,468 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-06 12:01:25,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:01:25,847 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:01:25,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25 WrapperNode [2021-11-06 12:01:25,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:01:25,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:25,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:01:25,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:01:25,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:25,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:01:26,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:01:26,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:01:26,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:01:26,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:01:26,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:01:26,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:01:26,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:01:26,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (1/1) ... [2021-11-06 12:01:26,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:01:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:01:26,252 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-06 12:01:26,292 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-06 12:01:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 12:01:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:01:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:01:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 12:01:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:01:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 12:01:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 12:01:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 12:01:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:01:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:01:26,733 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:26,782 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:01:30,142 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-06 12:01:30,142 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-06 12:01:30,142 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-06 12:01:30,143 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-06 12:01:30,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:01:30,159 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-06 12:01:30,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:30 BoogieIcfgContainer [2021-11-06 12:01:30,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:01:30,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:01:30,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:01:30,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:01:30,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:01:24" (1/3) ... [2021-11-06 12:01:30,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268f4501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:01:30, skipping insertion in model container [2021-11-06 12:01:30,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:01:25" (2/3) ... [2021-11-06 12:01:30,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268f4501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:01:30, skipping insertion in model container [2021-11-06 12:01:30,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:30" (3/3) ... [2021-11-06 12:01:30,170 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:01:30,174 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:01:30,174 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-06 12:01:30,212 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:01:30,217 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-06 12:01:30,218 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-06 12:01:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-06 12:01:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:01:30,244 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:30,244 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:30,245 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-06 12:01:30,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:30,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058976767] [2021-11-06 12:01:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:30,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:30,654 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-06 12:01:30,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:30,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058976767] [2021-11-06 12:01:30,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058976767] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:30,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:30,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:01:30,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772747509] [2021-11-06 12:01:30,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:30,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:30,676 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-06 12:01:30,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:30,833 INFO L93 Difference]: Finished difference Result 2020 states and 2970 transitions. [2021-11-06 12:01:30,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:30,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-06 12:01:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:30,850 INFO L225 Difference]: With dead ends: 2020 [2021-11-06 12:01:30,850 INFO L226 Difference]: Without dead ends: 1312 [2021-11-06 12:01:30,855 INFO L786 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-06 12:01:30,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2021-11-06 12:01:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1288. [2021-11-06 12:01:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1274 states have (on average 1.2896389324960753) internal successors, (1643), 1287 states have internal predecessors, (1643), 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-06 12:01:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1643 transitions. [2021-11-06 12:01:30,945 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1643 transitions. Word has length 11 [2021-11-06 12:01:30,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:30,945 INFO L470 AbstractCegarLoop]: Abstraction has 1288 states and 1643 transitions. [2021-11-06 12:01:30,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-06 12:01:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1643 transitions. [2021-11-06 12:01:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 12:01:30,947 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:30,947 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:30,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 12:01:30,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:30,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 45356904, now seen corresponding path program 1 times [2021-11-06 12:01:30,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:30,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619429706] [2021-11-06 12:01:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:30,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:31,069 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-06 12:01:31,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:31,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619429706] [2021-11-06 12:01:31,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619429706] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:31,071 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:31,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 12:01:31,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017103976] [2021-11-06 12:01:31,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:31,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:31,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:31,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:31,076 INFO L87 Difference]: Start difference. First operand 1288 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-06 12:01:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:31,105 INFO L93 Difference]: Finished difference Result 1288 states and 1643 transitions. [2021-11-06 12:01:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-06 12:01:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:31,110 INFO L225 Difference]: With dead ends: 1288 [2021-11-06 12:01:31,110 INFO L226 Difference]: Without dead ends: 1283 [2021-11-06 12:01:31,112 INFO L786 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-06 12:01:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2021-11-06 12:01:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2021-11-06 12:01:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1270 states have (on average 1.2858267716535432) internal successors, (1633), 1282 states have internal predecessors, (1633), 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-06 12:01:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-06 12:01:31,154 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-06 12:01:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:31,155 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-06 12:01:31,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-06 12:01:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-06 12:01:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 12:01:31,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:31,160 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:31,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 12:01:31,161 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-06 12:01:31,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:31,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116561345] [2021-11-06 12:01:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:31,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:31,303 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-06 12:01:31,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:31,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116561345] [2021-11-06 12:01:31,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116561345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:31,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:31,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:31,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906072225] [2021-11-06 12:01:31,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:01:31,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:31,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:01:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:01:31,307 INFO L87 Difference]: Start difference. First operand 1283 states and 1633 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-06 12:01:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:31,370 INFO L93 Difference]: Finished difference Result 3119 states and 4010 transitions. [2021-11-06 12:01:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:01:31,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-11-06 12:01:31,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:31,377 INFO L225 Difference]: With dead ends: 3119 [2021-11-06 12:01:31,377 INFO L226 Difference]: Without dead ends: 1844 [2021-11-06 12:01:31,379 INFO L786 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-06 12:01:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2021-11-06 12:01:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1840. [2021-11-06 12:01:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1827 states have (on average 1.30103995621237) internal successors, (2377), 1839 states have internal predecessors, (2377), 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-06 12:01:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2377 transitions. [2021-11-06 12:01:31,447 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2377 transitions. Word has length 35 [2021-11-06 12:01:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:31,448 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2377 transitions. [2021-11-06 12:01:31,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-06 12:01:31,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2377 transitions. [2021-11-06 12:01:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:01:31,458 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:31,458 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:31,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 12:01:31,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:31,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-06 12:01:31,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:31,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036081211] [2021-11-06 12:01:31,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:31,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:01:31,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:31,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036081211] [2021-11-06 12:01:31,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036081211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:31,575 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:31,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:31,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695427105] [2021-11-06 12:01:31,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:31,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:31,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:31,578 INFO L87 Difference]: Start difference. First operand 1840 states and 2377 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 12:01:31,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:31,820 INFO L93 Difference]: Finished difference Result 3679 states and 4752 transitions. [2021-11-06 12:01:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:31,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-06 12:01:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:31,828 INFO L225 Difference]: With dead ends: 3679 [2021-11-06 12:01:31,828 INFO L226 Difference]: Without dead ends: 1842 [2021-11-06 12:01:31,831 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2021-11-06 12:01:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1838. [2021-11-06 12:01:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1825 states have (on average 1.2991780821917809) internal successors, (2371), 1837 states have internal predecessors, (2371), 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-06 12:01:31,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2371 transitions. [2021-11-06 12:01:31,879 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2371 transitions. Word has length 53 [2021-11-06 12:01:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:31,880 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 2371 transitions. [2021-11-06 12:01:31,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06 12:01:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2371 transitions. [2021-11-06 12:01:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:01:31,882 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:31,882 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:31,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 12:01:31,882 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-06 12:01:31,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:31,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619320369] [2021-11-06 12:01:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:31,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:32,022 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-06 12:01:32,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:32,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619320369] [2021-11-06 12:01:32,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619320369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:32,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:32,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:32,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824984379] [2021-11-06 12:01:32,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:32,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:32,025 INFO L87 Difference]: Start difference. First operand 1838 states and 2371 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:32,232 INFO L93 Difference]: Finished difference Result 5464 states and 7047 transitions. [2021-11-06 12:01:32,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:01:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-06 12:01:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:32,246 INFO L225 Difference]: With dead ends: 5464 [2021-11-06 12:01:32,246 INFO L226 Difference]: Without dead ends: 3632 [2021-11-06 12:01:32,249 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2021-11-06 12:01:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 1841. [2021-11-06 12:01:32,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1828 states have (on average 1.298140043763676) internal successors, (2373), 1840 states have internal predecessors, (2373), 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-06 12:01:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2373 transitions. [2021-11-06 12:01:32,320 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2373 transitions. Word has length 78 [2021-11-06 12:01:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:32,320 INFO L470 AbstractCegarLoop]: Abstraction has 1841 states and 2373 transitions. [2021-11-06 12:01:32,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2373 transitions. [2021-11-06 12:01:32,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:01:32,322 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:32,322 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:32,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 12:01:32,323 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-06 12:01:32,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:32,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954284984] [2021-11-06 12:01:32,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:32,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:32,435 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-06 12:01:32,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:32,436 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954284984] [2021-11-06 12:01:32,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954284984] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:32,436 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:32,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:32,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410326443] [2021-11-06 12:01:32,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:32,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:32,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:32,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:32,438 INFO L87 Difference]: Start difference. First operand 1841 states and 2373 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:32,683 INFO L93 Difference]: Finished difference Result 5587 states and 7218 transitions. [2021-11-06 12:01:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:01:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-06 12:01:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:32,696 INFO L225 Difference]: With dead ends: 5587 [2021-11-06 12:01:32,696 INFO L226 Difference]: Without dead ends: 3755 [2021-11-06 12:01:32,699 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:01:32,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2021-11-06 12:01:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 1853. [2021-11-06 12:01:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.296195652173913) internal successors, (2385), 1852 states have internal predecessors, (2385), 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-06 12:01:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2385 transitions. [2021-11-06 12:01:32,777 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2385 transitions. Word has length 78 [2021-11-06 12:01:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:32,778 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2385 transitions. [2021-11-06 12:01:32,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2385 transitions. [2021-11-06 12:01:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:01:32,779 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:32,780 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:32,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 12:01:32,780 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:32,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-06 12:01:32,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:32,781 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177197675] [2021-11-06 12:01:32,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:32,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:32,893 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-06 12:01:32,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:32,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177197675] [2021-11-06 12:01:32,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177197675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:32,894 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:32,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:32,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898408189] [2021-11-06 12:01:32,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:32,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:32,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:32,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:32,896 INFO L87 Difference]: Start difference. First operand 1853 states and 2385 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:38,248 INFO L93 Difference]: Finished difference Result 3616 states and 4663 transitions. [2021-11-06 12:01:38,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-06 12:01:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:38,261 INFO L225 Difference]: With dead ends: 3616 [2021-11-06 12:01:38,261 INFO L226 Difference]: Without dead ends: 3554 [2021-11-06 12:01:38,262 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2021-11-06 12:01:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 1853. [2021-11-06 12:01:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1840 states have (on average 1.295108695652174) internal successors, (2383), 1852 states have internal predecessors, (2383), 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-06 12:01:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2383 transitions. [2021-11-06 12:01:38,349 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2383 transitions. Word has length 78 [2021-11-06 12:01:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:38,350 INFO L470 AbstractCegarLoop]: Abstraction has 1853 states and 2383 transitions. [2021-11-06 12:01:38,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:01:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2383 transitions. [2021-11-06 12:01:38,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:01:38,351 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:38,352 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:38,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 12:01:38,352 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:38,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:38,353 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-06 12:01:38,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:38,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740415339] [2021-11-06 12:01:38,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:38,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:38,509 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-06 12:01:38,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:38,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740415339] [2021-11-06 12:01:38,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740415339] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:38,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:38,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:01:38,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134679050] [2021-11-06 12:01:38,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:01:38,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:38,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:01:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:38,514 INFO L87 Difference]: Start difference. First operand 1853 states and 2383 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-06 12:01:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:38,916 INFO L93 Difference]: Finished difference Result 2830 states and 3618 transitions. [2021-11-06 12:01:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:01:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2021-11-06 12:01:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:38,928 INFO L225 Difference]: With dead ends: 2830 [2021-11-06 12:01:38,928 INFO L226 Difference]: Without dead ends: 2806 [2021-11-06 12:01:38,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:01:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2021-11-06 12:01:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2756. [2021-11-06 12:01:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2743 states have (on average 1.2967553773240976) internal successors, (3557), 2755 states have internal predecessors, (3557), 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-06 12:01:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3557 transitions. [2021-11-06 12:01:39,052 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3557 transitions. Word has length 79 [2021-11-06 12:01:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:39,053 INFO L470 AbstractCegarLoop]: Abstraction has 2756 states and 3557 transitions. [2021-11-06 12:01:39,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-06 12:01:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3557 transitions. [2021-11-06 12:01:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:01:39,055 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:39,055 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:39,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 12:01:39,056 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-06 12:01:39,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:39,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648978182] [2021-11-06 12:01:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:39,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:39,274 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-06 12:01:39,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:39,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648978182] [2021-11-06 12:01:39,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648978182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:39,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:39,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:39,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436063699] [2021-11-06 12:01:39,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:39,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:39,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:39,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:39,280 INFO L87 Difference]: Start difference. First operand 2756 states and 3557 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:01:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:42,068 INFO L93 Difference]: Finished difference Result 6794 states and 8773 transitions. [2021-11-06 12:01:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2021-11-06 12:01:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:42,084 INFO L225 Difference]: With dead ends: 6794 [2021-11-06 12:01:42,084 INFO L226 Difference]: Without dead ends: 3952 [2021-11-06 12:01:42,093 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:01:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2021-11-06 12:01:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2144. [2021-11-06 12:01:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2131 states have (on average 1.302674800563116) internal successors, (2776), 2143 states have internal predecessors, (2776), 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-06 12:01:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2776 transitions. [2021-11-06 12:01:42,201 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2776 transitions. Word has length 79 [2021-11-06 12:01:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:42,201 INFO L470 AbstractCegarLoop]: Abstraction has 2144 states and 2776 transitions. [2021-11-06 12:01:42,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:01:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2776 transitions. [2021-11-06 12:01:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 12:01:42,203 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:42,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:42,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 12:01:42,204 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:42,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-06 12:01:42,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:42,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779341760] [2021-11-06 12:01:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:42,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:42,344 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-06 12:01:42,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:42,345 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779341760] [2021-11-06 12:01:42,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779341760] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:42,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:42,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:42,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332094312] [2021-11-06 12:01:42,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:42,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:42,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:42,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:42,347 INFO L87 Difference]: Start difference. First operand 2144 states and 2776 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-06 12:01:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:46,803 INFO L93 Difference]: Finished difference Result 3914 states and 5068 transitions. [2021-11-06 12:01:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2021-11-06 12:01:46,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:46,829 INFO L225 Difference]: With dead ends: 3914 [2021-11-06 12:01:46,830 INFO L226 Difference]: Without dead ends: 3859 [2021-11-06 12:01:46,832 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2021-11-06 12:01:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 2149. [2021-11-06 12:01:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 2136 states have (on average 1.301498127340824) internal successors, (2780), 2148 states have internal predecessors, (2780), 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-06 12:01:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 2780 transitions. [2021-11-06 12:01:46,948 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 2780 transitions. Word has length 85 [2021-11-06 12:01:46,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:46,949 INFO L470 AbstractCegarLoop]: Abstraction has 2149 states and 2780 transitions. [2021-11-06 12:01:46,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-06 12:01:46,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 2780 transitions. [2021-11-06 12:01:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 12:01:46,950 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:46,950 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:46,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 12:01:46,951 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-06 12:01:46,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:46,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083193325] [2021-11-06 12:01:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:46,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:47,194 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-06 12:01:47,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:47,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083193325] [2021-11-06 12:01:47,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083193325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:47,196 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:47,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:47,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965273961] [2021-11-06 12:01:47,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:47,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:47,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:47,199 INFO L87 Difference]: Start difference. First operand 2149 states and 2780 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:01:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:49,484 INFO L93 Difference]: Finished difference Result 5857 states and 7558 transitions. [2021-11-06 12:01:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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 86 [2021-11-06 12:01:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:49,494 INFO L225 Difference]: With dead ends: 5857 [2021-11-06 12:01:49,494 INFO L226 Difference]: Without dead ends: 3975 [2021-11-06 12:01:49,498 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:01:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2021-11-06 12:01:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 2169. [2021-11-06 12:01:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.3000927643784788) internal successors, (2803), 2168 states have internal predecessors, (2803), 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-06 12:01:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2803 transitions. [2021-11-06 12:01:49,623 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2803 transitions. Word has length 86 [2021-11-06 12:01:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:49,623 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2803 transitions. [2021-11-06 12:01:49,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:01:49,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2803 transitions. [2021-11-06 12:01:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 12:01:49,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:49,625 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:49,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 12:01:49,626 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:49,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1782949196, now seen corresponding path program 1 times [2021-11-06 12:01:49,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:49,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135218596] [2021-11-06 12:01:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:49,628 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:49,773 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-06 12:01:49,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:49,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135218596] [2021-11-06 12:01:49,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135218596] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:49,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:49,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:49,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191816183] [2021-11-06 12:01:49,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:49,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:49,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:49,776 INFO L87 Difference]: Start difference. First operand 2169 states and 2803 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:01:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:50,145 INFO L93 Difference]: Finished difference Result 7126 states and 9227 transitions. [2021-11-06 12:01:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:50,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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 86 [2021-11-06 12:01:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:50,154 INFO L225 Difference]: With dead ends: 7126 [2021-11-06 12:01:50,154 INFO L226 Difference]: Without dead ends: 5242 [2021-11-06 12:01:50,157 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:01:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-11-06 12:01:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 2169. [2021-11-06 12:01:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2156 states have (on average 1.2954545454545454) internal successors, (2793), 2168 states have internal predecessors, (2793), 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-06 12:01:50,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2793 transitions. [2021-11-06 12:01:50,327 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2793 transitions. Word has length 86 [2021-11-06 12:01:50,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:50,327 INFO L470 AbstractCegarLoop]: Abstraction has 2169 states and 2793 transitions. [2021-11-06 12:01:50,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:01:50,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2793 transitions. [2021-11-06 12:01:50,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 12:01:50,329 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:50,329 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:50,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 12:01:50,329 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:50,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:50,330 INFO L85 PathProgramCache]: Analyzing trace with hash 268034802, now seen corresponding path program 1 times [2021-11-06 12:01:50,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:50,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713092823] [2021-11-06 12:01:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:50,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:50,464 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-06 12:01:50,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:50,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713092823] [2021-11-06 12:01:50,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713092823] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:50,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:50,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:01:50,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559376592] [2021-11-06 12:01:50,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:50,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:50,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:50,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:50,468 INFO L87 Difference]: Start difference. First operand 2169 states and 2793 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 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-06 12:01:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:51,083 INFO L93 Difference]: Finished difference Result 3541 states and 4547 transitions. [2021-11-06 12:01:51,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:01:51,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 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 86 [2021-11-06 12:01:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:51,090 INFO L225 Difference]: With dead ends: 3541 [2021-11-06 12:01:51,090 INFO L226 Difference]: Without dead ends: 3486 [2021-11-06 12:01:51,091 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2021-11-06 12:01:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 2214. [2021-11-06 12:01:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2201 states have (on average 1.2925942753293957) internal successors, (2845), 2213 states have internal predecessors, (2845), 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-06 12:01:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 2845 transitions. [2021-11-06 12:01:51,271 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 2845 transitions. Word has length 86 [2021-11-06 12:01:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:51,272 INFO L470 AbstractCegarLoop]: Abstraction has 2214 states and 2845 transitions. [2021-11-06 12:01:51,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 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-06 12:01:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 2845 transitions. [2021-11-06 12:01:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 12:01:51,274 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:51,274 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:51,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 12:01:51,275 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-06 12:01:51,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:51,275 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110638556] [2021-11-06 12:01:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:51,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:51,393 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-06 12:01:51,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:51,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110638556] [2021-11-06 12:01:51,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110638556] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:51,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:51,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:51,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603115004] [2021-11-06 12:01:51,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:51,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:51,396 INFO L87 Difference]: Start difference. First operand 2214 states and 2845 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-06 12:01:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:56,575 INFO L93 Difference]: Finished difference Result 4028 states and 5175 transitions. [2021-11-06 12:01:56,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 92 [2021-11-06 12:01:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:56,582 INFO L225 Difference]: With dead ends: 4028 [2021-11-06 12:01:56,582 INFO L226 Difference]: Without dead ends: 3967 [2021-11-06 12:01:56,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:01:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2021-11-06 12:01:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 2225. [2021-11-06 12:01:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2212 states have (on average 1.2915913200723328) internal successors, (2857), 2224 states have internal predecessors, (2857), 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-06 12:01:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2857 transitions. [2021-11-06 12:01:56,755 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2857 transitions. Word has length 92 [2021-11-06 12:01:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:56,755 INFO L470 AbstractCegarLoop]: Abstraction has 2225 states and 2857 transitions. [2021-11-06 12:01:56,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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-06 12:01:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2857 transitions. [2021-11-06 12:01:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 12:01:56,757 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:56,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:56,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 12:01:56,758 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:56,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-06 12:01:56,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:56,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079705277] [2021-11-06 12:01:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:56,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:56,897 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-06 12:01:56,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:56,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079705277] [2021-11-06 12:01:56,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079705277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:56,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:56,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:56,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36008438] [2021-11-06 12:01:56,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:01:56,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:01:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:01:56,900 INFO L87 Difference]: Start difference. First operand 2225 states and 2857 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:01:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:01:59,493 INFO L93 Difference]: Finished difference Result 6090 states and 7800 transitions. [2021-11-06 12:01:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:01:59,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-06 12:01:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:01:59,501 INFO L225 Difference]: With dead ends: 6090 [2021-11-06 12:01:59,502 INFO L226 Difference]: Without dead ends: 4138 [2021-11-06 12:01:59,505 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:01:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4138 states. [2021-11-06 12:01:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4138 to 2236. [2021-11-06 12:01:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2223 states have (on average 1.2905982905982907) internal successors, (2869), 2235 states have internal predecessors, (2869), 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-06 12:01:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 2869 transitions. [2021-11-06 12:01:59,667 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 2869 transitions. Word has length 93 [2021-11-06 12:01:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:01:59,667 INFO L470 AbstractCegarLoop]: Abstraction has 2236 states and 2869 transitions. [2021-11-06 12:01:59,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:01:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 2869 transitions. [2021-11-06 12:01:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 12:01:59,669 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:01:59,669 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:01:59,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 12:01:59,669 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:01:59,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:01:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash 607900007, now seen corresponding path program 1 times [2021-11-06 12:01:59,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:01:59,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957077839] [2021-11-06 12:01:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:01:59,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:01:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:01:59,805 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-06 12:01:59,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:01:59,806 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957077839] [2021-11-06 12:01:59,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957077839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:01:59,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:01:59,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:01:59,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513523967] [2021-11-06 12:01:59,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:01:59,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:01:59,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:01:59,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:01:59,809 INFO L87 Difference]: Start difference. First operand 2236 states and 2869 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:02:00,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:00,376 INFO L93 Difference]: Finished difference Result 4362 states and 5593 transitions. [2021-11-06 12:02:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:02:00,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-06 12:02:00,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:00,385 INFO L225 Difference]: With dead ends: 4362 [2021-11-06 12:02:00,385 INFO L226 Difference]: Without dead ends: 4243 [2021-11-06 12:02:00,386 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:02:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4243 states. [2021-11-06 12:02:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4243 to 2245. [2021-11-06 12:02:00,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2245 states, 2232 states have (on average 1.2898745519713262) internal successors, (2879), 2244 states have internal predecessors, (2879), 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-06 12:02:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 2879 transitions. [2021-11-06 12:02:00,558 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 2879 transitions. Word has length 93 [2021-11-06 12:02:00,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:00,558 INFO L470 AbstractCegarLoop]: Abstraction has 2245 states and 2879 transitions. [2021-11-06 12:02:00,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:02:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 2879 transitions. [2021-11-06 12:02:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 12:02:00,560 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:00,560 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:00,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 12:02:00,561 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:00,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-06 12:02:00,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:00,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508877409] [2021-11-06 12:02:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:00,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:00,672 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-06 12:02:00,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:00,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508877409] [2021-11-06 12:02:00,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508877409] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:00,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:00,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:00,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618840488] [2021-11-06 12:02:00,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:00,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:00,674 INFO L87 Difference]: Start difference. First operand 2245 states and 2879 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-06 12:02:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:00,973 INFO L93 Difference]: Finished difference Result 4141 states and 5304 transitions. [2021-11-06 12:02:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2021-11-06 12:02:00,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:00,978 INFO L225 Difference]: With dead ends: 4141 [2021-11-06 12:02:00,978 INFO L226 Difference]: Without dead ends: 2190 [2021-11-06 12:02:00,981 INFO L786 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-06 12:02:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-11-06 12:02:01,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2180. [2021-11-06 12:02:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 2167 states have (on average 1.2833410244577756) internal successors, (2781), 2179 states have internal predecessors, (2781), 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-06 12:02:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2781 transitions. [2021-11-06 12:02:01,180 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 2781 transitions. Word has length 98 [2021-11-06 12:02:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:01,180 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 2781 transitions. [2021-11-06 12:02:01,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-06 12:02:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 2781 transitions. [2021-11-06 12:02:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 12:02:01,182 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:01,182 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:01,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 12:02:01,182 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-06 12:02:01,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:01,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000095987] [2021-11-06 12:02:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:01,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:01,293 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-06 12:02:01,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:01,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000095987] [2021-11-06 12:02:01,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000095987] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:01,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:01,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:02:01,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342214464] [2021-11-06 12:02:01,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:01,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:01,296 INFO L87 Difference]: Start difference. First operand 2180 states and 2781 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-06 12:02:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:04,040 INFO L93 Difference]: Finished difference Result 2190 states and 2788 transitions. [2021-11-06 12:02:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:02:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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 99 [2021-11-06 12:02:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:04,044 INFO L225 Difference]: With dead ends: 2190 [2021-11-06 12:02:04,044 INFO L226 Difference]: Without dead ends: 2156 [2021-11-06 12:02:04,045 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:02:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-06 12:02:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-06 12:02:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2855140186915888) internal successors, (2751), 2151 states have internal predecessors, (2751), 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-06 12:02:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2751 transitions. [2021-11-06 12:02:04,214 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2751 transitions. Word has length 99 [2021-11-06 12:02:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:04,214 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2751 transitions. [2021-11-06 12:02:04,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-06 12:02:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2751 transitions. [2021-11-06 12:02:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-06 12:02:04,216 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:04,216 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:04,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 12:02:04,217 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-06 12:02:04,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:04,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801058084] [2021-11-06 12:02:04,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:04,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:04,333 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-06 12:02:04,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:04,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801058084] [2021-11-06 12:02:04,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801058084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:04,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:04,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 12:02:04,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592941254] [2021-11-06 12:02:04,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:04,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:04,336 INFO L87 Difference]: Start difference. First operand 2152 states and 2751 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-06 12:02:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:04,536 INFO L93 Difference]: Finished difference Result 2160 states and 2757 transitions. [2021-11-06 12:02:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2021-11-06 12:02:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:04,539 INFO L225 Difference]: With dead ends: 2160 [2021-11-06 12:02:04,539 INFO L226 Difference]: Without dead ends: 2156 [2021-11-06 12:02:04,540 INFO L786 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-06 12:02:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-11-06 12:02:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2152. [2021-11-06 12:02:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 2140 states have (on average 1.2845794392523364) internal successors, (2749), 2151 states have internal predecessors, (2749), 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-06 12:02:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 2749 transitions. [2021-11-06 12:02:04,715 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 2749 transitions. Word has length 126 [2021-11-06 12:02:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 2152 states and 2749 transitions. [2021-11-06 12:02:04,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-06 12:02:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 2749 transitions. [2021-11-06 12:02:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-06 12:02:04,718 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:04,718 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:04,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 12:02:04,718 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:04,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:04,719 INFO L85 PathProgramCache]: Analyzing trace with hash 451476494, now seen corresponding path program 1 times [2021-11-06 12:02:04,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:04,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256872560] [2021-11-06 12:02:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:04,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:04,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:04,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:04,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256872560] [2021-11-06 12:02:04,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256872560] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:04,833 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:04,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 12:02:04,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170318813] [2021-11-06 12:02:04,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:04,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:04,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:04,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:04,835 INFO L87 Difference]: Start difference. First operand 2152 states and 2749 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-06 12:02:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:06,344 INFO L93 Difference]: Finished difference Result 4067 states and 5172 transitions. [2021-11-06 12:02:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:02:06,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 131 [2021-11-06 12:02:06,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:06,348 INFO L225 Difference]: With dead ends: 4067 [2021-11-06 12:02:06,348 INFO L226 Difference]: Without dead ends: 2201 [2021-11-06 12:02:06,350 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2021-11-06 12:02:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 2154. [2021-11-06 12:02:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.284780578898226) internal successors, (2752), 2153 states have internal predecessors, (2752), 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-06 12:02:06,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2752 transitions. [2021-11-06 12:02:06,551 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2752 transitions. Word has length 131 [2021-11-06 12:02:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:06,551 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2752 transitions. [2021-11-06 12:02:06,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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-06 12:02:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2752 transitions. [2021-11-06 12:02:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-06 12:02:06,553 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:06,553 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:06,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 12:02:06,553 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash -555431090, now seen corresponding path program 1 times [2021-11-06 12:02:06,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:06,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464293494] [2021-11-06 12:02:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:06,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:06,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:06,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464293494] [2021-11-06 12:02:06,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464293494] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 12:02:06,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850450674] [2021-11-06 12:02:06,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:06,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 12:02:06,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:02:06,695 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-06 12:02:06,724 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-06 12:02:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:07,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 2217 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:02:07,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:07,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:07,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850450674] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:07,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-06 12:02:07,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-06 12:02:07,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051851251] [2021-11-06 12:02:07,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:07,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:07,630 INFO L87 Difference]: Start difference. First operand 2154 states and 2752 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-06 12:02:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:07,829 INFO L93 Difference]: Finished difference Result 4018 states and 5120 transitions. [2021-11-06 12:02:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:07,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 131 [2021-11-06 12:02:07,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:07,833 INFO L225 Difference]: With dead ends: 4018 [2021-11-06 12:02:07,833 INFO L226 Difference]: Without dead ends: 2158 [2021-11-06 12:02:07,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-06 12:02:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2021-11-06 12:02:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2154. [2021-11-06 12:02:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2142 states have (on average 1.2829131652661065) internal successors, (2748), 2153 states have internal predecessors, (2748), 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-06 12:02:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2748 transitions. [2021-11-06 12:02:08,045 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2748 transitions. Word has length 131 [2021-11-06 12:02:08,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:08,045 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2748 transitions. [2021-11-06 12:02:08,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-06 12:02:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2748 transitions. [2021-11-06 12:02:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 12:02:08,047 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:08,047 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:08,075 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-06 12:02:08,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-06 12:02:08,264 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1591853852, now seen corresponding path program 1 times [2021-11-06 12:02:08,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:08,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462666281] [2021-11-06 12:02:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:08,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:08,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 12:02:08,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462666281] [2021-11-06 12:02:08,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462666281] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:08,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:08,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 12:02:08,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148482554] [2021-11-06 12:02:08,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:08,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 12:02:08,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:08,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:08,397 INFO L87 Difference]: Start difference. First operand 2154 states and 2748 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-06 12:02:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:08,645 INFO L93 Difference]: Finished difference Result 4077 states and 5182 transitions. [2021-11-06 12:02:08,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:08,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2021-11-06 12:02:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:08,652 INFO L225 Difference]: With dead ends: 4077 [2021-11-06 12:02:08,652 INFO L226 Difference]: Without dead ends: 2217 [2021-11-06 12:02:08,655 INFO L786 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-06 12:02:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2021-11-06 12:02:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2124. [2021-11-06 12:02:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2124 states, 2112 states have (on average 1.2727272727272727) internal successors, (2688), 2123 states have internal predecessors, (2688), 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-06 12:02:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2124 states to 2124 states and 2688 transitions. [2021-11-06 12:02:08,866 INFO L78 Accepts]: Start accepts. Automaton has 2124 states and 2688 transitions. Word has length 139 [2021-11-06 12:02:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:08,866 INFO L470 AbstractCegarLoop]: Abstraction has 2124 states and 2688 transitions. [2021-11-06 12:02:08,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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-06 12:02:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2124 states and 2688 transitions. [2021-11-06 12:02:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 12:02:08,868 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:08,868 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:08,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 12:02:08,869 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:08,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-06 12:02:08,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 12:02:08,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540409551] [2021-11-06 12:02:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:08,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 12:02:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:02:09,481 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 12:02:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:02:10,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-06 12:02:10,244 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 12:02:10,245 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,249 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,250 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:02:10,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 12:02:10,254 INFO L731 BasicCegarLoop]: Path program 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-06 12:02:10,256 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:02:10,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:02:10 BoogieIcfgContainer [2021-11-06 12:02:10,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:02:10,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:02:10,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:02:10,585 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:02:10,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:01:30" (3/4) ... [2021-11-06 12:02:10,588 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 12:02:10,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:02:10,589 INFO L168 Benchmark]: Toolchain (without parser) took 46475.00 ms. Allocated memory was 113.2 MB in the beginning and 799.0 MB in the end (delta: 685.8 MB). Free memory was 74.8 MB in the beginning and 370.6 MB in the end (delta: -295.8 MB). Peak memory consumption was 389.2 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,590 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 88.1 MB. Free memory was 45.1 MB in the beginning and 45.1 MB in the end (delta: 17.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:02:10,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1735.01 ms. Allocated memory was 113.2 MB in the beginning and 140.5 MB in the end (delta: 27.3 MB). Free memory was 74.5 MB in the beginning and 86.5 MB in the end (delta: -12.0 MB). Peak memory consumption was 59.6 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.16 ms. Allocated memory is still 140.5 MB. Free memory was 86.5 MB in the beginning and 63.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,591 INFO L168 Benchmark]: Boogie Preprocessor took 188.97 ms. Allocated memory is still 140.5 MB. Free memory was 63.4 MB in the beginning and 41.4 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,591 INFO L168 Benchmark]: RCFGBuilder took 3936.94 ms. Allocated memory was 140.5 MB in the beginning and 339.7 MB in the end (delta: 199.2 MB). Free memory was 41.4 MB in the beginning and 264.1 MB in the end (delta: -222.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,591 INFO L168 Benchmark]: TraceAbstraction took 40419.08 ms. Allocated memory was 339.7 MB in the beginning and 799.0 MB in the end (delta: 459.3 MB). Free memory was 263.0 MB in the beginning and 371.7 MB in the end (delta: -108.6 MB). Peak memory consumption was 397.7 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,592 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 799.0 MB. Free memory was 371.7 MB in the beginning and 370.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-06 12:02:10,593 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.37 ms. Allocated memory is still 88.1 MB. Free memory was 45.1 MB in the beginning and 45.1 MB in the end (delta: 17.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1735.01 ms. Allocated memory was 113.2 MB in the beginning and 140.5 MB in the end (delta: 27.3 MB). Free memory was 74.5 MB in the beginning and 86.5 MB in the end (delta: -12.0 MB). Peak memory consumption was 59.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 184.16 ms. Allocated memory is still 140.5 MB. Free memory was 86.5 MB in the beginning and 63.4 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 188.97 ms. Allocated memory is still 140.5 MB. Free memory was 63.4 MB in the beginning and 41.4 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3936.94 ms. Allocated memory was 140.5 MB in the beginning and 339.7 MB in the end (delta: 199.2 MB). Free memory was 41.4 MB in the beginning and 264.1 MB in the end (delta: -222.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40419.08 ms. Allocated memory was 339.7 MB in the beginning and 799.0 MB in the end (delta: 459.3 MB). Free memory was 263.0 MB in the beginning and 371.7 MB in the end (delta: -108.6 MB). Peak memory consumption was 397.7 MB. Max. memory is 16.1 GB. * Witness Printer took 3.58 ms. Allocated memory is still 799.0 MB. Free memory was 371.7 MB in the beginning and 370.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * 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: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L5088] int tmp___7 ; [L7209] return __VERIFIER_nondet_int(); [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6320] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6326] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6343] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6349] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] catc->ctrl_urb [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] catc->tx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] catc->rx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] catc->irq_urb [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5148] urb->start_frame = -1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] EXPR catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6608] netdev->dev_addr [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6612] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6627] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] catc->is_f5u011 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L7138] return __VERIFIER_nondet_int(); [L6643] netdev->dev.parent = & intf->dev [L7187] return __VERIFIER_nondet_int(); [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb [L7217] return __VERIFIER_nondet_int(); [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6854] res_catc_open_15 = catc_open(var_group1) [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={94:0}, __key___11={102:0}, __key___9={127:0}, __this_module={18446744073709551687:18446744073709551648}, catc_driver={98:0}, catc_id_table={119:0}, catc_netdev_ops={103:0}, driver_name={113:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={57:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - UnprovableResult [Line: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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, 689 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 40.0s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 26688 SDtfs, 26255 SDslu, 45548 SDs, 0 SdLazy, 5258 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2756occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 20949 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2118 NumberOfCodeBlocks, 2118 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1956 ConstructedInterpolants, 0 QuantifiedInterpolants, 4857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2217 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 25/28 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-06 12:02:10,641 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.0/usb_urb-drivers-net-usb-catc.ko.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 12:02:12,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 12:02:12,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 12:02:12,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 12:02:12,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 12:02:12,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 12:02:12,414 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 12:02:12,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 12:02:12,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 12:02:12,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 12:02:12,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 12:02:12,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 12:02:12,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 12:02:12,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 12:02:12,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 12:02:12,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 12:02:12,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 12:02:12,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 12:02:12,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 12:02:12,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 12:02:12,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 12:02:12,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 12:02:12,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 12:02:12,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 12:02:12,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 12:02:12,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 12:02:12,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 12:02:12,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 12:02:12,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 12:02:12,465 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 12:02:12,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 12:02:12,466 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 12:02:12,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 12:02:12,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 12:02:12,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 12:02:12,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 12:02:12,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 12:02:12,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 12:02:12,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 12:02:12,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 12:02:12,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 12:02:12,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-06 12:02:12,506 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 12:02:12,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 12:02:12,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 12:02:12,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 12:02:12,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 12:02:12,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 12:02:12,510 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 12:02:12,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 12:02:12,510 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 12:02:12,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 12:02:12,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 12:02:12,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 12:02:12,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-06 12:02:12,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-06 12:02:12,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 12:02:12,512 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 12:02:12,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 12:02:12,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 12:02:12,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 12:02:12,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 12:02:12,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:02:12,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 12:02:12,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 12:02:12,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 12:02:12,514 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 12:02:12,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-06 12:02:12,516 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2021-11-06 12:02:12,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 12:02:12,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 12:02:12,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 12:02:12,849 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 12:02:12,855 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 12:02:12,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:02:12,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1784864f/648cf62ab5c84a3a9891b3f96c0dffa5/FLAG81d62f9a0 [2021-11-06 12:02:13,612 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 12:02:13,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:02:13,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1784864f/648cf62ab5c84a3a9891b3f96c0dffa5/FLAG81d62f9a0 [2021-11-06 12:02:13,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1784864f/648cf62ab5c84a3a9891b3f96c0dffa5 [2021-11-06 12:02:13,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 12:02:13,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 12:02:13,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 12:02:13,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 12:02:13,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 12:02:13,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:13" (1/1) ... [2021-11-06 12:02:13,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41727c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:13, skipping insertion in model container [2021-11-06 12:02:13,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 12:02:13" (1/1) ... [2021-11-06 12:02:13,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 12:02:13,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 12:02:14,887 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-06 12:02:14,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:02:14,996 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 12:02:15,171 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2021-11-06 12:02:15,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 12:02:15,456 INFO L208 MainTranslator]: Completed translation [2021-11-06 12:02:15,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15 WrapperNode [2021-11-06 12:02:15,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 12:02:15,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 12:02:15,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 12:02:15,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 12:02:15,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 12:02:15,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 12:02:15,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 12:02:15,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 12:02:15,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,876 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 12:02:15,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 12:02:15,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 12:02:15,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 12:02:15,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (1/1) ... [2021-11-06 12:02:15,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 12:02:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 12:02:15,904 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-06 12:02:15,913 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-06 12:02:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-06 12:02:15,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-06 12:02:15,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-06 12:02:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 12:02:15,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 12:02:15,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 12:02:15,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 12:02:16,472 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:02:16,508 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-06 12:02:40,774 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##522: assume !false; [2021-11-06 12:02:40,774 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##521: assume false; [2021-11-06 12:02:40,774 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##41: assume !false; [2021-11-06 12:02:40,774 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume false; [2021-11-06 12:02:40,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 12:02:40,784 INFO L299 CfgBuilder]: Removed 647 assume(true) statements. [2021-11-06 12:02:40,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:40 BoogieIcfgContainer [2021-11-06 12:02:40,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 12:02:40,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 12:02:40,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 12:02:40,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 12:02:40,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 12:02:13" (1/3) ... [2021-11-06 12:02:40,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30336253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:40, skipping insertion in model container [2021-11-06 12:02:40,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 12:02:15" (2/3) ... [2021-11-06 12:02:40,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30336253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 12:02:40, skipping insertion in model container [2021-11-06 12:02:40,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:40" (3/3) ... [2021-11-06 12:02:40,793 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-11-06 12:02:40,797 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 12:02:40,797 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2021-11-06 12:02:40,835 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 12:02:40,840 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-06 12:02:40,840 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-11-06 12:02:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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-06 12:02:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:02:40,864 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:40,864 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:40,865 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1802578412, now seen corresponding path program 1 times [2021-11-06 12:02:40,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:40,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053692535] [2021-11-06 12:02:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:40,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:40,889 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-06 12:02:40,932 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-06 12:02:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:41,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-06 12:02:41,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:41,601 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-06 12:02:41,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:41,669 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-06 12:02:41,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:41,670 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053692535] [2021-11-06 12:02:41,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053692535] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:41,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:41,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:02:41,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922794185] [2021-11-06 12:02:41,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:41,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:41,694 INFO L87 Difference]: Start difference. First operand has 689 states, 674 states have (on average 1.4940652818991098) internal successors, (1007), 688 states have internal predecessors, (1007), 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 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 12:02:41,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:41,930 INFO L93 Difference]: Finished difference Result 2054 states and 3006 transitions. [2021-11-06 12:02:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:02:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2021-11-06 12:02:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:41,952 INFO L225 Difference]: With dead ends: 2054 [2021-11-06 12:02:41,952 INFO L226 Difference]: Without dead ends: 1338 [2021-11-06 12:02:41,959 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2021-11-06 12:02:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 672. [2021-11-06 12:02:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 658 states have (on average 1.2917933130699089) internal successors, (850), 671 states have internal predecessors, (850), 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-06 12:02:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 850 transitions. [2021-11-06 12:02:42,084 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 850 transitions. Word has length 11 [2021-11-06 12:02:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:42,085 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 850 transitions. [2021-11-06 12:02:42,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-06 12:02:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 850 transitions. [2021-11-06 12:02:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-06 12:02:42,086 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:42,086 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:42,113 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-06 12:02:42,300 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-06 12:02:42,301 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1859836714, now seen corresponding path program 1 times [2021-11-06 12:02:42,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:42,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143539283] [2021-11-06 12:02:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:42,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:42,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:42,309 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-06 12:02:42,311 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-06 12:02:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:42,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:42,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:42,902 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-06 12:02:42,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:42,958 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-06 12:02:42,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:42,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143539283] [2021-11-06 12:02:42,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143539283] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:42,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:42,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 12:02:42,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273563782] [2021-11-06 12:02:42,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:42,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:42,961 INFO L87 Difference]: Start difference. First operand 672 states and 850 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-06 12:02:43,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:43,169 INFO L93 Difference]: Finished difference Result 1975 states and 2507 transitions. [2021-11-06 12:02:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-06 12:02:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:43,174 INFO L225 Difference]: With dead ends: 1975 [2021-11-06 12:02:43,175 INFO L226 Difference]: Without dead ends: 1315 [2021-11-06 12:02:43,176 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-06 12:02:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-11-06 12:02:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1291. [2021-11-06 12:02:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1277 states have (on average 1.2889584964761158) internal successors, (1646), 1290 states have internal predecessors, (1646), 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-06 12:02:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1646 transitions. [2021-11-06 12:02:43,233 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1646 transitions. Word has length 11 [2021-11-06 12:02:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:43,233 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 1646 transitions. [2021-11-06 12:02:43,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-06 12:02:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1646 transitions. [2021-11-06 12:02:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-06 12:02:43,234 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:43,234 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:43,260 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-06 12:02:43,455 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-06 12:02:43,456 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1820364266, now seen corresponding path program 1 times [2021-11-06 12:02:43,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:43,458 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257724230] [2021-11-06 12:02:43,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:43,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:43,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:43,459 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-06 12:02:43,477 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-06 12:02:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:43,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:43,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:43,997 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-06 12:02:43,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:44,049 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-06 12:02:44,049 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:44,049 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257724230] [2021-11-06 12:02:44,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257724230] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:44,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:44,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-06 12:02:44,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36652523] [2021-11-06 12:02:44,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:02:44,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:02:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:02:44,051 INFO L87 Difference]: Start difference. First operand 1291 states and 1646 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-06 12:02:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:44,104 INFO L93 Difference]: Finished difference Result 1291 states and 1646 transitions. [2021-11-06 12:02:44,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:02:44,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-11-06 12:02:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:44,109 INFO L225 Difference]: With dead ends: 1291 [2021-11-06 12:02:44,109 INFO L226 Difference]: Without dead ends: 1286 [2021-11-06 12:02:44,110 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-06 12:02:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-11-06 12:02:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1283. [2021-11-06 12:02:44,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1270 states have (on average 1.2858267716535432) internal successors, (1633), 1282 states have internal predecessors, (1633), 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-06 12:02:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1633 transitions. [2021-11-06 12:02:44,169 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1633 transitions. Word has length 12 [2021-11-06 12:02:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:44,169 INFO L470 AbstractCegarLoop]: Abstraction has 1283 states and 1633 transitions. [2021-11-06 12:02:44,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-06 12:02:44,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1633 transitions. [2021-11-06 12:02:44,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 12:02:44,171 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:44,172 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:44,194 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-06 12:02:44,391 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-06 12:02:44,392 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -965110428, now seen corresponding path program 1 times [2021-11-06 12:02:44,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:44,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196761486] [2021-11-06 12:02:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:44,394 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:44,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:44,395 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-06 12:02:44,397 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-06 12:02:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:44,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-06 12:02:44,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:45,029 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-06 12:02:45,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:45,155 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-06 12:02:45,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:45,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196761486] [2021-11-06 12:02:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196761486] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:45,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:45,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-06 12:02:45,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362083097] [2021-11-06 12:02:45,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:02:45,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:45,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:02:45,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:02:45,158 INFO L87 Difference]: Start difference. First operand 1283 states and 1633 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06 12:02:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:45,347 INFO L93 Difference]: Finished difference Result 3681 states and 4764 transitions. [2021-11-06 12:02:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:02:45,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 35 [2021-11-06 12:02:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:45,356 INFO L225 Difference]: With dead ends: 3681 [2021-11-06 12:02:45,356 INFO L226 Difference]: Without dead ends: 2406 [2021-11-06 12:02:45,358 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 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-06 12:02:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2406 states. [2021-11-06 12:02:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2406 to 2398. [2021-11-06 12:02:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2385 states have (on average 1.310691823899371) internal successors, (3126), 2397 states have internal predecessors, (3126), 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-06 12:02:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3126 transitions. [2021-11-06 12:02:45,488 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3126 transitions. Word has length 35 [2021-11-06 12:02:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:45,489 INFO L470 AbstractCegarLoop]: Abstraction has 2398 states and 3126 transitions. [2021-11-06 12:02:45,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-06 12:02:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3126 transitions. [2021-11-06 12:02:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 12:02:45,493 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:45,493 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:45,516 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-06 12:02:45,713 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-06 12:02:45,713 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:45,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2056089327, now seen corresponding path program 1 times [2021-11-06 12:02:45,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:45,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124100533] [2021-11-06 12:02:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:45,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:45,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:45,717 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-06 12:02:45,718 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-06 12:02:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:46,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:02:46,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:46,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:46,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:02:46,568 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:46,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124100533] [2021-11-06 12:02:46,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124100533] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:46,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:46,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-06 12:02:46,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489917566] [2021-11-06 12:02:46,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:02:46,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:46,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:02:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:02:46,570 INFO L87 Difference]: Start difference. First operand 2398 states and 3126 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-06 12:02:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:48,884 INFO L93 Difference]: Finished difference Result 4807 states and 6261 transitions. [2021-11-06 12:02:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:02:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 53 [2021-11-06 12:02:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:48,894 INFO L225 Difference]: With dead ends: 4807 [2021-11-06 12:02:48,894 INFO L226 Difference]: Without dead ends: 2410 [2021-11-06 12:02:48,898 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:02:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-11-06 12:02:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2396. [2021-11-06 12:02:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2383 states have (on average 1.3092740243390684) internal successors, (3120), 2395 states have internal predecessors, (3120), 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-06 12:02:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3120 transitions. [2021-11-06 12:02:49,009 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3120 transitions. Word has length 53 [2021-11-06 12:02:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:49,009 INFO L470 AbstractCegarLoop]: Abstraction has 2396 states and 3120 transitions. [2021-11-06 12:02:49,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-06 12:02:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3120 transitions. [2021-11-06 12:02:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:02:49,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:49,015 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:49,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-06 12:02:49,235 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-06 12:02:49,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1050619864, now seen corresponding path program 1 times [2021-11-06 12:02:49,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:49,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446154086] [2021-11-06 12:02:49,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:49,238 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:49,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:49,241 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-06 12:02:49,244 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-06 12:02:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:49,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:02:49,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:50,148 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-06 12:02:50,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:50,381 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-06 12:02:50,381 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:50,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446154086] [2021-11-06 12:02:50,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446154086] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:50,382 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:50,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:02:50,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149794292] [2021-11-06 12:02:50,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:50,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:50,383 INFO L87 Difference]: Start difference. First operand 2396 states and 3120 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:02:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:50,997 INFO L93 Difference]: Finished difference Result 7138 states and 9294 transitions. [2021-11-06 12:02:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:02:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-06 12:02:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:51,018 INFO L225 Difference]: With dead ends: 7138 [2021-11-06 12:02:51,018 INFO L226 Difference]: Without dead ends: 4748 [2021-11-06 12:02:51,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:02:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2021-11-06 12:02:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 2399. [2021-11-06 12:02:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2386 states have (on average 1.308466051969824) internal successors, (3122), 2398 states have internal predecessors, (3122), 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-06 12:02:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 3122 transitions. [2021-11-06 12:02:51,200 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 3122 transitions. Word has length 78 [2021-11-06 12:02:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:51,201 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 3122 transitions. [2021-11-06 12:02:51,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:02:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 3122 transitions. [2021-11-06 12:02:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:02:51,202 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:51,203 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:51,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-06 12:02:51,420 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-06 12:02:51,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1494520538, now seen corresponding path program 1 times [2021-11-06 12:02:51,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:51,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864828513] [2021-11-06 12:02:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:51,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:51,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:51,423 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-06 12:02:51,423 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-06 12:02:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:52,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-06 12:02:52,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:52,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-06 12:02:52,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:52,428 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-06 12:02:52,428 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:52,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864828513] [2021-11-06 12:02:52,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864828513] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:52,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:52,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:02:52,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913360738] [2021-11-06 12:02:52,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:02:52,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:02:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:02:52,431 INFO L87 Difference]: Start difference. First operand 2399 states and 3122 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:02:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:02:52,968 INFO L93 Difference]: Finished difference Result 6982 states and 9092 transitions. [2021-11-06 12:02:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 12:02:52,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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 78 [2021-11-06 12:02:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:02:52,984 INFO L225 Difference]: With dead ends: 6982 [2021-11-06 12:02:52,984 INFO L226 Difference]: Without dead ends: 4592 [2021-11-06 12:02:52,988 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:02:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2021-11-06 12:02:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2411. [2021-11-06 12:02:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2398 states have (on average 1.3069224353628024) internal successors, (3134), 2410 states have internal predecessors, (3134), 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-06 12:02:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3134 transitions. [2021-11-06 12:02:53,171 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3134 transitions. Word has length 78 [2021-11-06 12:02:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:02:53,172 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 3134 transitions. [2021-11-06 12:02:53,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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-06 12:02:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3134 transitions. [2021-11-06 12:02:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-11-06 12:02:53,173 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:02:53,174 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:02:53,201 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-06 12:02:53,395 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-06 12:02:53,396 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:02:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:02:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152792, now seen corresponding path program 1 times [2021-11-06 12:02:53,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:02:53,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656681967] [2021-11-06 12:02:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:02:53,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:02:53,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:02:53,398 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-06 12:02:53,399 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-06 12:02:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:02:54,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:02:54,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:02:54,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:02:54,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:02:54,367 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-06 12:02:54,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:02:54,652 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-06 12:02:54,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:02:54,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656681967] [2021-11-06 12:02:54,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656681967] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:02:54,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:02:54,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:02:54,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188629326] [2021-11-06 12:02:54,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:02:54,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:02:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:02:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:02:54,654 INFO L87 Difference]: Start difference. First operand 2411 states and 3134 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06 12:04:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:23,049 INFO L93 Difference]: Finished difference Result 4732 states and 6161 transitions. [2021-11-06 12:04:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:04:23,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 78 [2021-11-06 12:04:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:23,066 INFO L225 Difference]: With dead ends: 4732 [2021-11-06 12:04:23,066 INFO L226 Difference]: Without dead ends: 4670 [2021-11-06 12:04:23,067 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:04:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2021-11-06 12:04:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 2411. [2021-11-06 12:04:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2398 states have (on average 1.3060884070058383) internal successors, (3132), 2410 states have internal predecessors, (3132), 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-06 12:04:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3132 transitions. [2021-11-06 12:04:23,245 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3132 transitions. Word has length 78 [2021-11-06 12:04:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:23,246 INFO L470 AbstractCegarLoop]: Abstraction has 2411 states and 3132 transitions. [2021-11-06 12:04:23,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-06 12:04:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3132 transitions. [2021-11-06 12:04:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:04:23,253 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:23,253 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:23,281 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-06 12:04:23,476 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-06 12:04:23,476 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:04:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash 948357624, now seen corresponding path program 1 times [2021-11-06 12:04:23,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:23,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340758805] [2021-11-06 12:04:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:23,478 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:23,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:23,479 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-06 12:04:23,480 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-06 12:04:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:24,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:04:24,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:24,497 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-06 12:04:24,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:24,848 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-06 12:04:24,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:24,849 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340758805] [2021-11-06 12:04:24,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340758805] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:24,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:24,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-06 12:04:24,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674716256] [2021-11-06 12:04:24,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:04:24,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:04:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:04:24,850 INFO L87 Difference]: Start difference. First operand 2411 states and 3132 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:29,820 INFO L93 Difference]: Finished difference Result 9667 states and 12640 transitions. [2021-11-06 12:04:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:04:29,821 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 12:04:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:29,847 INFO L225 Difference]: With dead ends: 9667 [2021-11-06 12:04:29,847 INFO L226 Difference]: Without dead ends: 8419 [2021-11-06 12:04:29,850 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:04:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2021-11-06 12:04:30,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 7045. [2021-11-06 12:04:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7032 states have (on average 1.3111490329920363) internal successors, (9220), 7044 states have internal predecessors, (9220), 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-06 12:04:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9220 transitions. [2021-11-06 12:04:30,546 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9220 transitions. Word has length 79 [2021-11-06 12:04:30,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:30,547 INFO L470 AbstractCegarLoop]: Abstraction has 7045 states and 9220 transitions. [2021-11-06 12:04:30,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9220 transitions. [2021-11-06 12:04:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:04:30,549 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:30,549 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:30,580 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-06 12:04:30,763 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-06 12:04:30,764 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:04:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:30,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1167030794, now seen corresponding path program 1 times [2021-11-06 12:04:30,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:30,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585889244] [2021-11-06 12:04:30,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:30,765 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:30,766 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-06 12:04:30,767 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-06 12:04:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:31,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:04:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:31,769 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-06 12:04:31,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:31,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-06 12:04:31,932 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:31,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585889244] [2021-11-06 12:04:31,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585889244] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:31,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:31,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:04:31,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421688732] [2021-11-06 12:04:31,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:04:31,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:31,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:04:31,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:04:31,933 INFO L87 Difference]: Start difference. First operand 7045 states and 9220 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:04:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:33,040 INFO L93 Difference]: Finished difference Result 23094 states and 30270 transitions. [2021-11-06 12:04:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:04:33,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2021-11-06 12:04:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:33,069 INFO L225 Difference]: With dead ends: 23094 [2021-11-06 12:04:33,069 INFO L226 Difference]: Without dead ends: 16058 [2021-11-06 12:04:33,081 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:04:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16058 states. [2021-11-06 12:04:33,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16058 to 7045. [2021-11-06 12:04:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7032 states have (on average 1.30773606370876) internal successors, (9196), 7044 states have internal predecessors, (9196), 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-06 12:04:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9196 transitions. [2021-11-06 12:04:33,783 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9196 transitions. Word has length 79 [2021-11-06 12:04:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:33,783 INFO L470 AbstractCegarLoop]: Abstraction has 7045 states and 9196 transitions. [2021-11-06 12:04:33,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:04:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9196 transitions. [2021-11-06 12:04:33,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:04:33,785 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:33,785 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:33,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-06 12:04:34,008 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-06 12:04:34,009 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:04:34,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -648257224, now seen corresponding path program 1 times [2021-11-06 12:04:34,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:34,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612490138] [2021-11-06 12:04:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:34,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:34,011 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-06 12:04:34,012 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-06 12:04:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:34,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-06 12:04:34,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:35,127 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-06 12:04:35,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:35,543 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-06 12:04:35,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:35,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612490138] [2021-11-06 12:04:35,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612490138] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:35,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:35,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-06 12:04:35,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670768076] [2021-11-06 12:04:35,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-06 12:04:35,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-06 12:04:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-06 12:04:35,548 INFO L87 Difference]: Start difference. First operand 7045 states and 9196 transitions. Second operand has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:04:43,554 INFO L93 Difference]: Finished difference Result 36777 states and 48158 transitions. [2021-11-06 12:04:43,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-06 12:04:43,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 12:04:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:04:43,619 INFO L225 Difference]: With dead ends: 36777 [2021-11-06 12:04:43,620 INFO L226 Difference]: Without dead ends: 33220 [2021-11-06 12:04:43,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2021-11-06 12:04:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33220 states. [2021-11-06 12:04:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33220 to 17401. [2021-11-06 12:04:44,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17401 states, 17388 states have (on average 1.3103289625028756) internal successors, (22784), 17400 states have internal predecessors, (22784), 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-06 12:04:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17401 states to 17401 states and 22784 transitions. [2021-11-06 12:04:45,017 INFO L78 Accepts]: Start accepts. Automaton has 17401 states and 22784 transitions. Word has length 79 [2021-11-06 12:04:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:04:45,017 INFO L470 AbstractCegarLoop]: Abstraction has 17401 states and 22784 transitions. [2021-11-06 12:04:45,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.083333333333334) internal successors, (157), 11 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 12:04:45,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17401 states and 22784 transitions. [2021-11-06 12:04:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 12:04:45,020 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:04:45,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:04:45,044 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-06 12:04:45,240 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-06 12:04:45,241 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:04:45,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:04:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1804226248, now seen corresponding path program 1 times [2021-11-06 12:04:45,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:04:45,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261578595] [2021-11-06 12:04:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:04:45,242 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:04:45,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:04:45,243 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-06 12:04:45,244 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-06 12:04:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:04:46,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-06 12:04:46,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:04:47,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:04:47,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:04:47,187 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-06 12:04:47,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:04:47,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:04:47,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:04:47,323 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-06 12:04:47,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:04:47,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:04:47,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:04:47,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2021-11-06 12:04:47,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-11-06 12:04:47,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2021-11-06 12:04:47,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-11-06 12:04:47,551 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-06 12:04:47,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:04:47,986 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-06 12:04:47,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:04:47,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261578595] [2021-11-06 12:04:47,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261578595] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:04:47,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:04:47,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:04:47,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651558725] [2021-11-06 12:04:47,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:04:47,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:04:47,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:04:47,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:04:47,988 INFO L87 Difference]: Start difference. First operand 17401 states and 22784 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:05:30,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:05:30,365 INFO L93 Difference]: Finished difference Result 43355 states and 56710 transitions. [2021-11-06 12:05:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:05:30,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2021-11-06 12:05:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:05:30,417 INFO L225 Difference]: With dead ends: 43355 [2021-11-06 12:05:30,418 INFO L226 Difference]: Without dead ends: 25443 [2021-11-06 12:05:30,449 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:05:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25443 states. [2021-11-06 12:05:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25443 to 11503. [2021-11-06 12:05:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11503 states, 11490 states have (on average 1.306875543951262) internal successors, (15016), 11502 states have internal predecessors, (15016), 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-06 12:05:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11503 states to 11503 states and 15016 transitions. [2021-11-06 12:05:31,607 INFO L78 Accepts]: Start accepts. Automaton has 11503 states and 15016 transitions. Word has length 79 [2021-11-06 12:05:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:05:31,607 INFO L470 AbstractCegarLoop]: Abstraction has 11503 states and 15016 transitions. [2021-11-06 12:05:31,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-06 12:05:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 11503 states and 15016 transitions. [2021-11-06 12:05:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-06 12:05:31,609 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:05:31,609 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:05:31,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-11-06 12:05:31,823 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-06 12:05:31,823 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:05:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:05:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 559162765, now seen corresponding path program 1 times [2021-11-06 12:05:31,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:05:31,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701197093] [2021-11-06 12:05:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:05:31,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:05:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:05:31,826 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-06 12:05:31,827 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-06 12:05:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:05:32,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:05:32,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:05:32,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:05:32,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:05:33,005 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-06 12:05:33,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:05:33,345 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-06 12:05:33,346 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:05:33,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701197093] [2021-11-06 12:05:33,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701197093] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:05:33,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:05:33,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:05:33,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383569957] [2021-11-06 12:05:33,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:05:33,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:05:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:05:33,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:05:33,347 INFO L87 Difference]: Start difference. First operand 11503 states and 15016 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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-06 12:07:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:07:21,841 INFO L93 Difference]: Finished difference Result 22633 states and 29572 transitions. [2021-11-06 12:07:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:07:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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 85 [2021-11-06 12:07:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:07:21,883 INFO L225 Difference]: With dead ends: 22633 [2021-11-06 12:07:21,883 INFO L226 Difference]: Without dead ends: 22486 [2021-11-06 12:07:21,894 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:07:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22486 states. [2021-11-06 12:07:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22486 to 11508. [2021-11-06 12:07:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11508 states, 11495 states have (on average 1.3059591126576773) internal successors, (15012), 11507 states have internal predecessors, (15012), 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-06 12:07:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11508 states to 11508 states and 15012 transitions. [2021-11-06 12:07:22,989 INFO L78 Accepts]: Start accepts. Automaton has 11508 states and 15012 transitions. Word has length 85 [2021-11-06 12:07:22,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:07:22,989 INFO L470 AbstractCegarLoop]: Abstraction has 11508 states and 15012 transitions. [2021-11-06 12:07:22,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 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-06 12:07:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 11508 states and 15012 transitions. [2021-11-06 12:07:22,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-06 12:07:22,991 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:07:22,992 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:07:23,022 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-06 12:07:23,215 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-06 12:07:23,216 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:07:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:07:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1810418226, now seen corresponding path program 1 times [2021-11-06 12:07:23,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:07:23,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119336643] [2021-11-06 12:07:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:07:23,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:07:23,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:07:23,218 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:07:23,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-06 12:07:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:07:25,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:07:25,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:07:25,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:07:25,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:07:25,672 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-06 12:07:25,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:07:25,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:07:25,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:07:25,820 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-06 12:07:25,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:07:25,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:07:25,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:07:25,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:07:25,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:07:25,934 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-06 12:07:25,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:07:26,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-06 12:07:26,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:07:26,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119336643] [2021-11-06 12:07:26,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119336643] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:07:26,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:07:26,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:07:26,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437034273] [2021-11-06 12:07:26,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:07:26,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:07:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:07:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:07:26,321 INFO L87 Difference]: Start difference. First operand 11508 states and 15012 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:08:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:08:11,681 INFO L93 Difference]: Finished difference Result 31957 states and 41687 transitions. [2021-11-06 12:08:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:08:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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 86 [2021-11-06 12:08:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:08:11,706 INFO L225 Difference]: With dead ends: 31957 [2021-11-06 12:08:11,706 INFO L226 Difference]: Without dead ends: 20223 [2021-11-06 12:08:11,724 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:08:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20223 states. [2021-11-06 12:08:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20223 to 10694. [2021-11-06 12:08:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10694 states, 10681 states have (on average 1.3048403707518024) internal successors, (13937), 10693 states have internal predecessors, (13937), 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-06 12:08:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10694 states to 10694 states and 13937 transitions. [2021-11-06 12:08:12,754 INFO L78 Accepts]: Start accepts. Automaton has 10694 states and 13937 transitions. Word has length 86 [2021-11-06 12:08:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:08:12,755 INFO L470 AbstractCegarLoop]: Abstraction has 10694 states and 13937 transitions. [2021-11-06 12:08:12,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 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-06 12:08:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 10694 states and 13937 transitions. [2021-11-06 12:08:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-06 12:08:12,756 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:08:12,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:08:12,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-11-06 12:08:12,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:08:12,960 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:08:12,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:08:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash -642776665, now seen corresponding path program 1 times [2021-11-06 12:08:12,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:08:12,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259959691] [2021-11-06 12:08:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:08:12,962 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:08:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:08:12,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:08:12,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-11-06 12:08:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:08:13,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:08:13,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:08:14,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:08:14,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:08:14,289 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-06 12:08:14,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:08:14,609 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-06 12:08:14,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:08:14,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259959691] [2021-11-06 12:08:14,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259959691] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:08:14,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:08:14,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:08:14,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163954383] [2021-11-06 12:08:14,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:08:14,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:08:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:08:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:08:14,611 INFO L87 Difference]: Start difference. First operand 10694 states and 13937 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-06 12:10:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:10:57,686 INFO L93 Difference]: Finished difference Result 21026 states and 27429 transitions. [2021-11-06 12:10:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:10:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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 92 [2021-11-06 12:10:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:10:57,708 INFO L225 Difference]: With dead ends: 21026 [2021-11-06 12:10:57,708 INFO L226 Difference]: Without dead ends: 20903 [2021-11-06 12:10:57,710 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:10:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20903 states. [2021-11-06 12:10:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20903 to 10710. [2021-11-06 12:10:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10710 states, 10697 states have (on average 1.3042909226886044) internal successors, (13952), 10709 states have internal predecessors, (13952), 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-06 12:10:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10710 states to 10710 states and 13952 transitions. [2021-11-06 12:10:58,583 INFO L78 Accepts]: Start accepts. Automaton has 10710 states and 13952 transitions. Word has length 92 [2021-11-06 12:10:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:10:58,583 INFO L470 AbstractCegarLoop]: Abstraction has 10710 states and 13952 transitions. [2021-11-06 12:10:58,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 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-06 12:10:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10710 states and 13952 transitions. [2021-11-06 12:10:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-06 12:10:58,585 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:10:58,586 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:10:58,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-11-06 12:10:58,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:10:58,800 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:10:58,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:10:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash -2144683865, now seen corresponding path program 1 times [2021-11-06 12:10:58,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:10:58,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025800109] [2021-11-06 12:10:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:10:58,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:10:58,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:10:58,802 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:10:58,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-11-06 12:11:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:11:01,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-06 12:11:01,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:11:01,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:11:01,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:11:01,428 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-06 12:11:01,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:11:01,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-06 12:11:01,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-06 12:11:01,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:11:01,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:11:01,544 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-06 12:11:01,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:11:01,801 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-06 12:11:01,801 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:11:01,801 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025800109] [2021-11-06 12:11:01,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025800109] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:11:01,801 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:11:01,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:11:01,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646111898] [2021-11-06 12:11:01,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:11:01,802 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:11:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:11:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:11:01,802 INFO L87 Difference]: Start difference. First operand 10710 states and 13952 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:11:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:11:42,847 INFO L93 Difference]: Finished difference Result 29465 states and 38416 transitions. [2021-11-06 12:11:42,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:11:42,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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 93 [2021-11-06 12:11:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:11:42,871 INFO L225 Difference]: With dead ends: 29465 [2021-11-06 12:11:42,872 INFO L226 Difference]: Without dead ends: 18715 [2021-11-06 12:11:42,883 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:11:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2021-11-06 12:11:43,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 9889. [2021-11-06 12:11:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9889 states, 9876 states have (on average 1.303665451599838) internal successors, (12875), 9888 states have internal predecessors, (12875), 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-06 12:11:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9889 states to 9889 states and 12875 transitions. [2021-11-06 12:11:43,756 INFO L78 Accepts]: Start accepts. Automaton has 9889 states and 12875 transitions. Word has length 93 [2021-11-06 12:11:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:11:43,756 INFO L470 AbstractCegarLoop]: Abstraction has 9889 states and 12875 transitions. [2021-11-06 12:11:43,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 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-06 12:11:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 9889 states and 12875 transitions. [2021-11-06 12:11:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-11-06 12:11:43,757 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:11:43,757 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:11:43,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-11-06 12:11:43,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:11:43,958 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:11:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:11:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1307096688, now seen corresponding path program 1 times [2021-11-06 12:11:43,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:11:43,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129836284] [2021-11-06 12:11:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:11:43,959 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:11:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:11:43,960 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:11:43,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-11-06 12:11:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:11:45,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:11:45,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:11:45,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2021-11-06 12:11:45,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-11-06 12:11:45,329 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-06 12:11:45,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:11:45,596 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-06 12:11:45,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:11:45,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129836284] [2021-11-06 12:11:45,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129836284] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:11:45,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:11:45,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2021-11-06 12:11:45,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791297832] [2021-11-06 12:11:45,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:11:45,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:11:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:11:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:11:45,598 INFO L87 Difference]: Start difference. First operand 9889 states and 12875 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-06 12:12:31,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:12:31,169 INFO L93 Difference]: Finished difference Result 25687 states and 33509 transitions. [2021-11-06 12:12:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-06 12:12:31,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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 98 [2021-11-06 12:12:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:12:31,190 INFO L225 Difference]: With dead ends: 25687 [2021-11-06 12:12:31,190 INFO L226 Difference]: Without dead ends: 15759 [2021-11-06 12:12:31,196 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:12:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2021-11-06 12:12:31,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 8131. [2021-11-06 12:12:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8131 states, 8118 states have (on average 1.3026607538802661) internal successors, (10575), 8130 states have internal predecessors, (10575), 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-06 12:12:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8131 states to 8131 states and 10575 transitions. [2021-11-06 12:12:31,912 INFO L78 Accepts]: Start accepts. Automaton has 8131 states and 10575 transitions. Word has length 98 [2021-11-06 12:12:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:12:31,912 INFO L470 AbstractCegarLoop]: Abstraction has 8131 states and 10575 transitions. [2021-11-06 12:12:31,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 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-06 12:12:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 8131 states and 10575 transitions. [2021-11-06 12:12:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-06 12:12:31,913 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:12:31,913 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:12:31,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-11-06 12:12:32,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:12:32,114 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:12:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:12:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1984260860, now seen corresponding path program 1 times [2021-11-06 12:12:32,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:12:32,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363584233] [2021-11-06 12:12:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:12:32,115 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:12:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:12:32,116 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:12:32,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-11-06 12:12:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:12:33,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-06 12:12:33,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:12:33,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:12:33,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:12:33,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:12:33,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:12:33,708 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-06 12:12:33,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:12:34,064 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-06 12:12:34,064 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:12:34,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363584233] [2021-11-06 12:12:34,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363584233] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:12:34,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:12:34,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-06 12:12:34,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637869880] [2021-11-06 12:12:34,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-06 12:12:34,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:12:34,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-06 12:12:34,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-06 12:12:34,066 INFO L87 Difference]: Start difference. First operand 8131 states and 10575 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-06 12:13:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:13:17,031 INFO L93 Difference]: Finished difference Result 12341 states and 16077 transitions. [2021-11-06 12:13:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:13:17,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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 99 [2021-11-06 12:13:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:13:17,045 INFO L225 Difference]: With dead ends: 12341 [2021-11-06 12:13:17,046 INFO L226 Difference]: Without dead ends: 12301 [2021-11-06 12:13:17,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-11-06 12:13:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12301 states. [2021-11-06 12:13:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12301 to 8150. [2021-11-06 12:13:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8150 states, 8137 states have (on average 1.3031829912744255) internal successors, (10604), 8149 states have internal predecessors, (10604), 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-06 12:13:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 10604 transitions. [2021-11-06 12:13:17,838 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 10604 transitions. Word has length 99 [2021-11-06 12:13:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:13:17,839 INFO L470 AbstractCegarLoop]: Abstraction has 8150 states and 10604 transitions. [2021-11-06 12:13:17,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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-06 12:13:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 10604 transitions. [2021-11-06 12:13:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-06 12:13:17,840 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:13:17,841 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:13:17,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-11-06 12:13:18,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:13:18,059 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:13:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:13:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash 973251299, now seen corresponding path program 1 times [2021-11-06 12:13:18,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:13:18,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113930267] [2021-11-06 12:13:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:13:18,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:13:18,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:13:18,062 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:13:18,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-11-06 12:13:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:13:19,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-06 12:13:19,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:13:19,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:13:19,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-06 12:13:19,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2021-11-06 12:13:19,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-06 12:13:19,767 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-06 12:13:19,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:13:20,019 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-06 12:13:20,019 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:13:20,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113930267] [2021-11-06 12:13:20,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113930267] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:13:20,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:13:20,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-06 12:13:20,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877491856] [2021-11-06 12:13:20,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 12:13:20,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:13:20,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 12:13:20,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 12:13:20,021 INFO L87 Difference]: Start difference. First operand 8150 states and 10604 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-06 12:13:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:13:46,029 INFO L93 Difference]: Finished difference Result 11471 states and 14886 transitions. [2021-11-06 12:13:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 12:13:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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 126 [2021-11-06 12:13:46,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:13:46,036 INFO L225 Difference]: With dead ends: 11471 [2021-11-06 12:13:46,036 INFO L226 Difference]: Without dead ends: 4803 [2021-11-06 12:13:46,077 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 12:13:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2021-11-06 12:13:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4756. [2021-11-06 12:13:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4743 states have (on average 1.298123550495467) internal successors, (6157), 4755 states have internal predecessors, (6157), 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-06 12:13:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 6157 transitions. [2021-11-06 12:13:46,503 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 6157 transitions. Word has length 126 [2021-11-06 12:13:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:13:46,503 INFO L470 AbstractCegarLoop]: Abstraction has 4756 states and 6157 transitions. [2021-11-06 12:13:46,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 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-06 12:13:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 6157 transitions. [2021-11-06 12:13:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-06 12:13:46,505 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:13:46,505 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:13:46,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-11-06 12:13:46,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:13:46,706 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:13:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:13:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1858974813, now seen corresponding path program 1 times [2021-11-06 12:13:46,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:13:46,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830328621] [2021-11-06 12:13:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:13:46,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:13:46,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:13:46,708 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:13:46,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-11-06 12:13:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:13:48,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:13:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:13:48,447 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-06 12:13:48,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:13:48,652 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-06 12:13:48,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:13:48,652 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830328621] [2021-11-06 12:13:48,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830328621] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:13:48,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:13:48,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-06 12:13:48,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703645406] [2021-11-06 12:13:48,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 12:13:48,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:13:48,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 12:13:48,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 12:13:48,653 INFO L87 Difference]: Start difference. First operand 4756 states and 6157 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-06 12:13:49,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:13:49,389 INFO L93 Difference]: Finished difference Result 9941 states and 12868 transitions. [2021-11-06 12:13:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 12:13:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 126 [2021-11-06 12:13:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:13:49,399 INFO L225 Difference]: With dead ends: 9941 [2021-11-06 12:13:49,399 INFO L226 Difference]: Without dead ends: 5194 [2021-11-06 12:13:49,402 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 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-06 12:13:49,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5194 states. [2021-11-06 12:13:49,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5194 to 4696. [2021-11-06 12:13:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4683 states have (on average 1.28913089899637) internal successors, (6037), 4695 states have internal predecessors, (6037), 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-06 12:13:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6037 transitions. [2021-11-06 12:13:49,805 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6037 transitions. Word has length 126 [2021-11-06 12:13:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:13:49,805 INFO L470 AbstractCegarLoop]: Abstraction has 4696 states and 6037 transitions. [2021-11-06 12:13:49,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-06 12:13:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6037 transitions. [2021-11-06 12:13:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-11-06 12:13:49,806 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:13:49,806 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:13:49,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-11-06 12:13:50,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:13:50,011 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:13:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:13:50,011 INFO L85 PathProgramCache]: Analyzing trace with hash -758969181, now seen corresponding path program 1 times [2021-11-06 12:13:50,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:13:50,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467195450] [2021-11-06 12:13:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:13:50,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:13:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:13:50,014 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:13:50,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-11-06 12:13:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:13:51,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:13:51,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:13:51,973 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-06 12:13:51,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:13:52,175 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-06 12:13:52,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:13:52,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467195450] [2021-11-06 12:13:52,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467195450] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-06 12:13:52,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-06 12:13:52,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-06 12:13:52,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120183476] [2021-11-06 12:13:52,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 12:13:52,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:13:52,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 12:13:52,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 12:13:52,177 INFO L87 Difference]: Start difference. First operand 4696 states and 6037 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-06 12:13:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:13:52,853 INFO L93 Difference]: Finished difference Result 4982 states and 6413 transitions. [2021-11-06 12:13:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:13:52,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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 126 [2021-11-06 12:13:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:13:52,858 INFO L225 Difference]: With dead ends: 4982 [2021-11-06 12:13:52,858 INFO L226 Difference]: Without dead ends: 4978 [2021-11-06 12:13:52,859 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 249 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-06 12:13:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2021-11-06 12:13:53,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4696. [2021-11-06 12:13:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4696 states, 4683 states have (on average 1.2882767456758488) internal successors, (6033), 4695 states have internal predecessors, (6033), 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-06 12:13:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6033 transitions. [2021-11-06 12:13:53,282 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6033 transitions. Word has length 126 [2021-11-06 12:13:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:13:53,282 INFO L470 AbstractCegarLoop]: Abstraction has 4696 states and 6033 transitions. [2021-11-06 12:13:53,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 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-06 12:13:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6033 transitions. [2021-11-06 12:13:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-11-06 12:13:53,284 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:13:53,284 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:13:53,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-11-06 12:13:53,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:13:53,500 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:13:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:13:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1856285262, now seen corresponding path program 1 times [2021-11-06 12:13:53,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:13:53,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762044378] [2021-11-06 12:13:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:13:53,503 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:13:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:13:53,505 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:13:53,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-11-06 12:13:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 12:13:55,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 1221 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 12:13:55,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 12:13:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:13:55,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-06 12:13:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 12:13:56,207 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-06 12:13:56,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762044378] [2021-11-06 12:13:56,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762044378] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-06 12:13:56,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 12:13:56,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-06 12:13:56,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645454649] [2021-11-06 12:13:56,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-06 12:13:56,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-06 12:13:56,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-06 12:13:56,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:13:56,209 INFO L87 Difference]: Start difference. First operand 4696 states and 6033 transitions. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-06 12:13:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 12:13:56,643 INFO L93 Difference]: Finished difference Result 7432 states and 9493 transitions. [2021-11-06 12:13:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 12:13:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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 131 [2021-11-06 12:13:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 12:13:56,649 INFO L225 Difference]: With dead ends: 7432 [2021-11-06 12:13:56,650 INFO L226 Difference]: Without dead ends: 3863 [2021-11-06 12:13:56,654 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-06 12:13:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2021-11-06 12:13:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3859. [2021-11-06 12:13:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3846 states have (on average 1.2722308892355694) internal successors, (4893), 3858 states have internal predecessors, (4893), 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-06 12:13:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 4893 transitions. [2021-11-06 12:13:57,035 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 4893 transitions. Word has length 131 [2021-11-06 12:13:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 12:13:57,036 INFO L470 AbstractCegarLoop]: Abstraction has 3859 states and 4893 transitions. [2021-11-06 12:13:57,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-06 12:13:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 4893 transitions. [2021-11-06 12:13:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-06 12:13:57,039 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 12:13:57,040 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 12:13:57,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-11-06 12:13:57,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:13:57,260 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2021-11-06 12:13:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 12:13:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1634788380, now seen corresponding path program 1 times [2021-11-06 12:13:57,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-06 12:13:57,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568681427] [2021-11-06 12:13:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 12:13:57,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-06 12:13:57,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-06 12:13:57,262 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-06 12:13:57,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-11-06 12:14:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:14:24,166 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-06 12:14:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-06 12:14:38,318 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-11-06 12:14:38,318 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-06 12:14:38,319 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-11-06 12:14:38,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-11-06 12:14:38,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-06 12:14:38,524 INFO L731 BasicCegarLoop]: Path program 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-06 12:14:38,526 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-06 12:14:38,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 12:14:38 BoogieIcfgContainer [2021-11-06 12:14:38,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-06 12:14:38,859 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-06 12:14:38,859 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-06 12:14:38,859 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-06 12:14:38,860 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 12:02:40" (3/4) ... [2021-11-06 12:14:38,862 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-06 12:14:38,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-06 12:14:38,863 INFO L168 Benchmark]: Toolchain (without parser) took 745131.66 ms. Allocated memory was 67.1 MB in the beginning and 1.9 GB in the end (delta: 1.9 GB). Free memory was 38.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 446.5 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,864 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 47.8 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:14:38,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1724.47 ms. Allocated memory was 67.1 MB in the beginning and 121.6 MB in the end (delta: 54.5 MB). Free memory was 38.1 MB in the beginning and 62.9 MB in the end (delta: -24.8 MB). Peak memory consumption was 52.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 230.27 ms. Allocated memory is still 121.6 MB. Free memory was 62.9 MB in the beginning and 70.7 MB in the end (delta: -7.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,865 INFO L168 Benchmark]: Boogie Preprocessor took 187.50 ms. Allocated memory is still 121.6 MB. Free memory was 70.7 MB in the beginning and 47.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,865 INFO L168 Benchmark]: RCFGBuilder took 24907.98 ms. Allocated memory was 121.6 MB in the beginning and 234.9 MB in the end (delta: 113.2 MB). Free memory was 47.6 MB in the beginning and 130.7 MB in the end (delta: -83.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,865 INFO L168 Benchmark]: TraceAbstraction took 718070.62 ms. Allocated memory was 234.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 130.7 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 370.9 MB. Max. memory is 16.1 GB. [2021-11-06 12:14:38,865 INFO L168 Benchmark]: Witness Printer took 3.25 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-06 12:14:38,867 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.18 ms. Allocated memory is still 67.1 MB. Free memory was 47.9 MB in the beginning and 47.8 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1724.47 ms. Allocated memory was 67.1 MB in the beginning and 121.6 MB in the end (delta: 54.5 MB). Free memory was 38.1 MB in the beginning and 62.9 MB in the end (delta: -24.8 MB). Peak memory consumption was 52.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 230.27 ms. Allocated memory is still 121.6 MB. Free memory was 62.9 MB in the beginning and 70.7 MB in the end (delta: -7.8 MB). Peak memory consumption was 33.0 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 187.50 ms. Allocated memory is still 121.6 MB. Free memory was 70.7 MB in the beginning and 47.6 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 24907.98 ms. Allocated memory was 121.6 MB in the beginning and 234.9 MB in the end (delta: 113.2 MB). Free memory was 47.6 MB in the beginning and 130.7 MB in the end (delta: -83.1 MB). Peak memory consumption was 114.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 718070.62 ms. Allocated memory was 234.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 130.7 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 370.9 MB. Max. memory is 16.1 GB. * Witness Printer took 3.25 ms. Allocated memory is still 1.9 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 16.1 GB. * 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: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L5088] int tmp___7 ; [L7209] return __VERIFIER_nondet_int(); [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6320] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6326] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6343] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6349] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6366] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] return ldv_malloc(0UL); [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] catc->ctrl_urb [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] catc->tx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] catc->rx_urb [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] catc->irq_urb [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5148] urb->start_frame = -1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] EXPR catc->is_f5u011 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6608] netdev->dev_addr [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6612] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5696] EXPR catc->usbdev [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5705] return (tmp___11); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6627] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] catc->is_f5u011 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L7138] return __VERIFIER_nondet_int(); [L6643] netdev->dev.parent = & intf->dev [L7187] return __VERIFIER_nondet_int(); [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6793] COND TRUE 1 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb [L7217] return __VERIFIER_nondet_int(); [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6854] res_catc_open_15 = catc_open(var_group1) [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=4294967295, res_catc_probe_17=0, res_catc_stop_16=0] [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=4294967295, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={576320014680844209:0}, __key___11={1152780766984267698:0}, __key___9={1152780766984267697:0}, __this_module={66:57}, catc_driver={1152780766984267703:0}, catc_id_table={5764466785411655607:0}, catc_netdev_ops={1152780766984267699:0}, driver_name={8070309794625349552:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={-8070591269870508105:0}, res_catc_open_15=4294967295, res_catc_probe_17=0, res_catc_stop_16=0] - UnprovableResult [Line: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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: 6946]: 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, 689 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 717.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 624.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 29526 SDtfs, 58330 SDslu, 71184 SDs, 0 SdLazy, 6719 SolverSat, 946 SolverUnsat, 109 SolverUnknown, 0 SolverNotchecked, 590.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3473 GetRequests, 3344 SyntacticMatches, 6 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17401occurred in iteration=11, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 99786 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 38.8s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3424 ConstructedInterpolants, 0 QuantifiedInterpolants, 9163 SizeOfPredicates, 116 NumberOfNonLiveVariables, 18001 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 44 InterpolantComputations, 42 PerfectInterpolantSequences, 24/30 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-06 12:14:38,950 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 Result: UNKNOWN: Overapproximated counterexample