./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c36dfa3b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 03:27:12,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 03:27:12,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 03:27:12,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 03:27:12,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 03:27:12,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 03:27:12,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 03:27:12,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 03:27:12,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 03:27:12,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 03:27:12,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 03:27:12,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 03:27:12,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 03:27:12,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 03:27:12,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 03:27:12,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 03:27:12,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 03:27:12,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 03:27:12,256 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 03:27:12,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 03:27:12,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 03:27:12,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 03:27:12,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 03:27:12,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 03:27:12,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 03:27:12,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 03:27:12,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 03:27:12,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 03:27:12,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 03:27:12,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 03:27:12,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 03:27:12,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 03:27:12,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 03:27:12,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 03:27:12,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 03:27:12,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 03:27:12,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 03:27:12,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 03:27:12,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 03:27:12,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 03:27:12,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 03:27:12,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-04 03:27:12,304 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 03:27:12,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 03:27:12,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 03:27:12,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 03:27:12,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 03:27:12,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 03:27:12,309 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 03:27:12,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 03:27:12,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-04 03:27:12,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 03:27:12,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 03:27:12,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 03:27:12,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 03:27:12,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 03:27:12,311 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 03:27:12,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 03:27:12,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 03:27:12,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 03:27:12,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 03:27:12,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-04 03:27:12,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 03:27:12,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 03:27:12,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 03:27:12,313 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 03:27:12,313 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 -> 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b [2021-11-04 03:27:12,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 03:27:12,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 03:27:12,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 03:27:12,554 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 03:27:12,555 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 03:27:12,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:27:12,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858da8ed3/9792cff0821f4e9bb98f9e61f0310625/FLAG0279dc460 [2021-11-04 03:27:13,162 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 03:27:13,162 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:27:13,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858da8ed3/9792cff0821f4e9bb98f9e61f0310625/FLAG0279dc460 [2021-11-04 03:27:13,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/858da8ed3/9792cff0821f4e9bb98f9e61f0310625 [2021-11-04 03:27:13,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 03:27:13,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 03:27:13,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 03:27:13,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 03:27:13,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 03:27:13,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 03:27:13" (1/1) ... [2021-11-04 03:27:13,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe13cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:13, skipping insertion in model container [2021-11-04 03:27:13,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 03:27:13" (1/1) ... [2021-11-04 03:27:13,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 03:27:13,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 03:27:14,283 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2021-11-04 03:27:14,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 03:27:14,661 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 03:27:14,767 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2021-11-04 03:27:14,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 03:27:14,923 INFO L208 MainTranslator]: Completed translation [2021-11-04 03:27:14,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14 WrapperNode [2021-11-04 03:27:14,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 03:27:14,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 03:27:14,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 03:27:14,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 03:27:14,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:14,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 03:27:15,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 03:27:15,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 03:27:15,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 03:27:15,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 03:27:15,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 03:27:15,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 03:27:15,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 03:27:15,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (1/1) ... [2021-11-04 03:27:15,260 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 03:27:15,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 03:27:15,289 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-04 03:27:15,305 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-04 03:27:15,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-04 03:27:15,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2021-11-04 03:27:15,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2021-11-04 03:27:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 03:27:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 03:27:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-04 03:27:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-04 03:27:15,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 03:27:15,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 03:27:15,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 03:27:15,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-04 03:27:15,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-04 03:27:15,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 03:27:15,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 03:27:15,319 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_read_int_callback [2021-11-04 03:27:15,319 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_read_int_callback [2021-11-04 03:27:17,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 03:27:17,646 INFO L299 CfgBuilder]: Removed 741 assume(true) statements. [2021-11-04 03:27:17,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 03:27:17 BoogieIcfgContainer [2021-11-04 03:27:17,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 03:27:17,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 03:27:17,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 03:27:17,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 03:27:17,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 03:27:13" (1/3) ... [2021-11-04 03:27:17,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6202a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 03:27:17, skipping insertion in model container [2021-11-04 03:27:17,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:27:14" (2/3) ... [2021-11-04 03:27:17,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6202a227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 03:27:17, skipping insertion in model container [2021-11-04 03:27:17,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 03:27:17" (3/3) ... [2021-11-04 03:27:17,656 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:27:17,660 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 03:27:17,660 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-04 03:27:17,705 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 03:27:17,712 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-04 03:27:17,712 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-04 03:27:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 727 states, 709 states have (on average 1.4400564174894217) internal successors, (1021), 715 states have internal predecessors, (1021), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-04 03:27:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-04 03:27:17,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:17,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:27:17,762 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:17,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -415135425, now seen corresponding path program 1 times [2021-11-04 03:27:17,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:17,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395491235] [2021-11-04 03:27:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:17,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:18,208 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-04 03:27:18,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:18,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395491235] [2021-11-04 03:27:18,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395491235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:18,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:18,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 03:27:18,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467868071] [2021-11-04 03:27:18,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:18,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:18,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:18,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:18,251 INFO L87 Difference]: Start difference. First operand has 727 states, 709 states have (on average 1.4400564174894217) internal successors, (1021), 715 states have internal predecessors, (1021), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-04 03:27:20,292 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:22,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:22,494 INFO L93 Difference]: Finished difference Result 1450 states and 2069 transitions. [2021-11-04 03:27:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:22,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2021-11-04 03:27:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:22,523 INFO L225 Difference]: With dead ends: 1450 [2021-11-04 03:27:22,523 INFO L226 Difference]: Without dead ends: 718 [2021-11-04 03:27:22,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.84ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:22,530 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3702.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.48ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4090.93ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:22,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 1976 Unknown, 0 Unchecked, 13.48ms Time], IncrementalHoareTripleChecker [0 Valid, 1975 Invalid, 1 Unknown, 0 Unchecked, 4090.93ms Time] [2021-11-04 03:27:22,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-11-04 03:27:22,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2021-11-04 03:27:22,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 701 states have (on average 1.398002853067047) internal successors, (980), 706 states have internal predecessors, (980), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-04 03:27:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 996 transitions. [2021-11-04 03:27:22,592 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 996 transitions. Word has length 30 [2021-11-04 03:27:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:22,593 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 996 transitions. [2021-11-04 03:27:22,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-04 03:27:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 996 transitions. [2021-11-04 03:27:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-04 03:27:22,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:22,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:27:22,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-04 03:27:22,596 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:22,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1015957192, now seen corresponding path program 1 times [2021-11-04 03:27:22,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:22,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595488961] [2021-11-04 03:27:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:22,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 03:27:22,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:22,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595488961] [2021-11-04 03:27:22,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595488961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:22,711 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:22,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 03:27:22,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351927361] [2021-11-04 03:27:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:22,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:22,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:22,713 INFO L87 Difference]: Start difference. First operand 718 states and 996 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 03:27:24,729 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:27,517 INFO L93 Difference]: Finished difference Result 2039 states and 2853 transitions. [2021-11-04 03:27:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2021-11-04 03:27:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:27,525 INFO L225 Difference]: With dead ends: 2039 [2021-11-04 03:27:27,525 INFO L226 Difference]: Without dead ends: 1352 [2021-11-04 03:27:27,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.29ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:27,532 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 913 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4240.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.18ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4665.25ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:27,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 40 Invalid, 1934 Unknown, 0 Unchecked, 10.18ms Time], IncrementalHoareTripleChecker [3 Valid, 1930 Invalid, 1 Unknown, 0 Unchecked, 4665.25ms Time] [2021-11-04 03:27:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-11-04 03:27:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2021-11-04 03:27:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1323 states have (on average 1.4051398337112624) internal successors, (1859), 1329 states have internal predecessors, (1859), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-04 03:27:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1891 transitions. [2021-11-04 03:27:27,590 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1891 transitions. Word has length 31 [2021-11-04 03:27:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:27,591 INFO L470 AbstractCegarLoop]: Abstraction has 1352 states and 1891 transitions. [2021-11-04 03:27:27,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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-04 03:27:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1891 transitions. [2021-11-04 03:27:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 03:27:27,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:27,598 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:27:27,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-04 03:27:27,599 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1271852623, now seen corresponding path program 1 times [2021-11-04 03:27:27,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:27,600 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855493021] [2021-11-04 03:27:27,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:27,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-04 03:27:27,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:27,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855493021] [2021-11-04 03:27:27,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855493021] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:27,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:27,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 03:27:27,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492559156] [2021-11-04 03:27:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:27,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:27,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:27,707 INFO L87 Difference]: Start difference. First operand 1352 states and 1891 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 03:27:29,722 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:33,644 INFO L93 Difference]: Finished difference Result 3983 states and 5585 transitions. [2021-11-04 03:27:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:33,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2021-11-04 03:27:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:33,656 INFO L225 Difference]: With dead ends: 3983 [2021-11-04 03:27:33,656 INFO L226 Difference]: Without dead ends: 2662 [2021-11-04 03:27:33,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:33,661 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 942 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 2835 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5187.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.56ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2835 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5747.79ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:33,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 48 Invalid, 2841 Unknown, 0 Unchecked, 9.56ms Time], IncrementalHoareTripleChecker [5 Valid, 2835 Invalid, 1 Unknown, 0 Unchecked, 5747.79ms Time] [2021-11-04 03:27:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2021-11-04 03:27:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 1353. [2021-11-04 03:27:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1324 states have (on average 1.404833836858006) internal successors, (1860), 1330 states have internal predecessors, (1860), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-04 03:27:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1892 transitions. [2021-11-04 03:27:33,719 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1892 transitions. Word has length 34 [2021-11-04 03:27:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:33,721 INFO L470 AbstractCegarLoop]: Abstraction has 1353 states and 1892 transitions. [2021-11-04 03:27:33,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 03:27:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1892 transitions. [2021-11-04 03:27:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 03:27:33,724 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:33,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:27:33,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-04 03:27:33,725 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1390658420, now seen corresponding path program 1 times [2021-11-04 03:27:33,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:33,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755098670] [2021-11-04 03:27:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:33,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 03:27:33,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:33,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755098670] [2021-11-04 03:27:33,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755098670] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 03:27:33,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229553570] [2021-11-04 03:27:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:33,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 03:27:33,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 03:27:33,874 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-04 03:27:33,892 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-04 03:27:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:34,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 03:27:34,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:27:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 03:27:34,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:27:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-04 03:27:34,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229553570] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 03:27:34,561 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-04 03:27:34,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2021-11-04 03:27:34,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975997744] [2021-11-04 03:27:34,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-04 03:27:34,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 03:27:34,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 03:27:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:27:34,562 INFO L87 Difference]: Start difference. First operand 1353 states and 1892 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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-04 03:27:36,578 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:39,230 INFO L93 Difference]: Finished difference Result 2679 states and 3754 transitions. [2021-11-04 03:27:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 03:27:39,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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 34 [2021-11-04 03:27:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:39,235 INFO L225 Difference]: With dead ends: 2679 [2021-11-04 03:27:39,235 INFO L226 Difference]: Without dead ends: 1356 [2021-11-04 03:27:39,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.29ms TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:27:39,238 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 2934 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4132.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.49ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2934 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4557.49ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:39,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 2940 Unknown, 0 Unchecked, 7.49ms Time], IncrementalHoareTripleChecker [5 Valid, 2934 Invalid, 1 Unknown, 0 Unchecked, 4557.49ms Time] [2021-11-04 03:27:39,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-11-04 03:27:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1356. [2021-11-04 03:27:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1327 states have (on average 1.4039186134137152) internal successors, (1863), 1333 states have internal predecessors, (1863), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2021-11-04 03:27:39,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1895 transitions. [2021-11-04 03:27:39,269 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1895 transitions. Word has length 34 [2021-11-04 03:27:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:39,269 INFO L470 AbstractCegarLoop]: Abstraction has 1356 states and 1895 transitions. [2021-11-04 03:27:39,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 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-04 03:27:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1895 transitions. [2021-11-04 03:27:39,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-04 03:27:39,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:39,270 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:27:39,295 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-04 03:27:39,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 03:27:39,492 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1908500643, now seen corresponding path program 2 times [2021-11-04 03:27:39,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:39,492 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901400429] [2021-11-04 03:27:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:39,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:39,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:27:39,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:39,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901400429] [2021-11-04 03:27:39,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901400429] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:39,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:39,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 03:27:39,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41871643] [2021-11-04 03:27:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:39,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:39,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:39,666 INFO L87 Difference]: Start difference. First operand 1356 states and 1895 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 03:27:41,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:44,234 INFO L93 Difference]: Finished difference Result 3998 states and 5652 transitions. [2021-11-04 03:27:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:44,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 37 [2021-11-04 03:27:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:44,246 INFO L225 Difference]: With dead ends: 3998 [2021-11-04 03:27:44,248 INFO L226 Difference]: Without dead ends: 2676 [2021-11-04 03:27:44,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.90ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:44,253 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 959 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3926.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4438.21ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:44,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [959 Valid, 48 Invalid, 1940 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [16 Valid, 1923 Invalid, 1 Unknown, 0 Unchecked, 4438.21ms Time] [2021-11-04 03:27:44,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2021-11-04 03:27:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2664. [2021-11-04 03:27:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2611 states have (on average 1.4006127920337035) internal successors, (3657), 2619 states have internal predecessors, (3657), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (48), 32 states have call predecessors, (48), 32 states have call successors, (48) [2021-11-04 03:27:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3737 transitions. [2021-11-04 03:27:44,369 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3737 transitions. Word has length 37 [2021-11-04 03:27:44,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:44,370 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 3737 transitions. [2021-11-04 03:27:44,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-04 03:27:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3737 transitions. [2021-11-04 03:27:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 03:27:44,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:44,372 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:27:44,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-04 03:27:44,372 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:44,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 966022899, now seen corresponding path program 1 times [2021-11-04 03:27:44,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:44,373 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679299787] [2021-11-04 03:27:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:44,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:44,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:27:44,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:44,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679299787] [2021-11-04 03:27:44,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679299787] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:44,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:44,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 03:27:44,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008144011] [2021-11-04 03:27:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:44,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:44,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:44,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:44,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:44,531 INFO L87 Difference]: Start difference. First operand 2664 states and 3737 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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-04 03:27:46,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:50,647 INFO L93 Difference]: Finished difference Result 7902 states and 11234 transitions. [2021-11-04 03:27:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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 38 [2021-11-04 03:27:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:50,668 INFO L225 Difference]: With dead ends: 7902 [2021-11-04 03:27:50,668 INFO L226 Difference]: Without dead ends: 5272 [2021-11-04 03:27:50,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.64ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:50,676 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 952 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5234.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.40ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5898.58ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:50,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [952 Valid, 48 Invalid, 1937 Unknown, 0 Unchecked, 5.40ms Time], IncrementalHoareTripleChecker [9 Valid, 1927 Invalid, 1 Unknown, 0 Unchecked, 5898.58ms Time] [2021-11-04 03:27:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5272 states. [2021-11-04 03:27:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5272 to 5261. [2021-11-04 03:27:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5160 states have (on average 1.3959302325581395) internal successors, (7203), 5172 states have internal predecessors, (7203), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:27:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7411 transitions. [2021-11-04 03:27:50,857 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7411 transitions. Word has length 38 [2021-11-04 03:27:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:50,858 INFO L470 AbstractCegarLoop]: Abstraction has 5261 states and 7411 transitions. [2021-11-04 03:27:50,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 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-04 03:27:50,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7411 transitions. [2021-11-04 03:27:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-04 03:27:50,859 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:50,859 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:27:50,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-04 03:27:50,860 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -118060505, now seen corresponding path program 1 times [2021-11-04 03:27:50,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:50,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402581673] [2021-11-04 03:27:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:50,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:27:50,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:50,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402581673] [2021-11-04 03:27:50,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402581673] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:50,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:50,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 03:27:50,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504573673] [2021-11-04 03:27:50,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:50,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:50,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:50,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:50,953 INFO L87 Difference]: Start difference. First operand 5261 states and 7411 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:27:52,969 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:55,809 INFO L93 Difference]: Finished difference Result 5266 states and 7415 transitions. [2021-11-04 03:27:55,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 39 [2021-11-04 03:27:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:55,825 INFO L225 Difference]: With dead ends: 5266 [2021-11-04 03:27:55,825 INFO L226 Difference]: Without dead ends: 5264 [2021-11-04 03:27:55,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.71ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:55,828 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 949 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4269.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.34ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4684.16ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:55,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [949 Valid, 48 Invalid, 1927 Unknown, 0 Unchecked, 4.34ms Time], IncrementalHoareTripleChecker [5 Valid, 1921 Invalid, 1 Unknown, 0 Unchecked, 4684.16ms Time] [2021-11-04 03:27:55,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states. [2021-11-04 03:27:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 5262. [2021-11-04 03:27:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5262 states, 5161 states have (on average 1.3958535167603177) internal successors, (7204), 5173 states have internal predecessors, (7204), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:27:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5262 states to 5262 states and 7412 transitions. [2021-11-04 03:27:55,967 INFO L78 Accepts]: Start accepts. Automaton has 5262 states and 7412 transitions. Word has length 39 [2021-11-04 03:27:55,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:55,967 INFO L470 AbstractCegarLoop]: Abstraction has 5262 states and 7412 transitions. [2021-11-04 03:27:55,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:27:55,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5262 states and 7412 transitions. [2021-11-04 03:27:55,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 03:27:55,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:55,969 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:27:55,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-04 03:27:55,970 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 635092349, now seen corresponding path program 1 times [2021-11-04 03:27:55,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:55,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103135948] [2021-11-04 03:27:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:55,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:27:56,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:56,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103135948] [2021-11-04 03:27:56,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103135948] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:56,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:56,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 03:27:56,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248092264] [2021-11-04 03:27:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:56,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:56,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:56,058 INFO L87 Difference]: Start difference. First operand 5262 states and 7412 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-04 03:27:58,092 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:27:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:27:59,497 INFO L93 Difference]: Finished difference Result 5262 states and 7412 transitions. [2021-11-04 03:27:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:27:59,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 40 [2021-11-04 03:27:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:27:59,514 INFO L225 Difference]: With dead ends: 5262 [2021-11-04 03:27:59,514 INFO L226 Difference]: Without dead ends: 5260 [2021-11-04 03:27:59,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:59,518 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 958 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3089.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.84ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3319.44ms IncrementalHoareTripleChecker+Time [2021-11-04 03:27:59,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [958 Valid, 16 Invalid, 977 Unknown, 0 Unchecked, 1.84ms Time], IncrementalHoareTripleChecker [0 Valid, 976 Invalid, 1 Unknown, 0 Unchecked, 3319.44ms Time] [2021-11-04 03:27:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2021-11-04 03:27:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2021-11-04 03:27:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5160 states have (on average 1.3957364341085272) internal successors, (7202), 5171 states have internal predecessors, (7202), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:27:59,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 7410 transitions. [2021-11-04 03:27:59,666 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 7410 transitions. Word has length 40 [2021-11-04 03:27:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:27:59,666 INFO L470 AbstractCegarLoop]: Abstraction has 5260 states and 7410 transitions. [2021-11-04 03:27:59,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-04 03:27:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 7410 transitions. [2021-11-04 03:27:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 03:27:59,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:27:59,668 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:27:59,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-04 03:27:59,668 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:27:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:27:59,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1786972943, now seen corresponding path program 1 times [2021-11-04 03:27:59,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:27:59,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073343732] [2021-11-04 03:27:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:27:59,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:27:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:27:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:27:59,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:27:59,763 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073343732] [2021-11-04 03:27:59,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073343732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:27:59,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:27:59,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-04 03:27:59,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755651802] [2021-11-04 03:27:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:27:59,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:27:59,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:27:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:27:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:27:59,765 INFO L87 Difference]: Start difference. First operand 5260 states and 7410 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:28:01,782 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:03,191 INFO L93 Difference]: Finished difference Result 5260 states and 7410 transitions. [2021-11-04 03:28:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:28:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 41 [2021-11-04 03:28:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:03,208 INFO L225 Difference]: With dead ends: 5260 [2021-11-04 03:28:03,209 INFO L226 Difference]: Without dead ends: 5244 [2021-11-04 03:28:03,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.62ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:28:03,212 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 955 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3074.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.63ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3306.69ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:03,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [955 Valid, 16 Invalid, 975 Unknown, 0 Unchecked, 1.63ms Time], IncrementalHoareTripleChecker [0 Valid, 974 Invalid, 1 Unknown, 0 Unchecked, 3306.69ms Time] [2021-11-04 03:28:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2021-11-04 03:28:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2021-11-04 03:28:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 5145 states have (on average 1.3957240038872691) internal successors, (7181), 5155 states have internal predecessors, (7181), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7389 transitions. [2021-11-04 03:28:03,377 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7389 transitions. Word has length 41 [2021-11-04 03:28:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:03,379 INFO L470 AbstractCegarLoop]: Abstraction has 5244 states and 7389 transitions. [2021-11-04 03:28:03,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:28:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7389 transitions. [2021-11-04 03:28:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-04 03:28:03,384 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:03,384 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-11-04 03:28:03,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-04 03:28:03,385 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:03,386 INFO L85 PathProgramCache]: Analyzing trace with hash -31704417, now seen corresponding path program 1 times [2021-11-04 03:28:03,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:03,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992153069] [2021-11-04 03:28:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:03,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:28:03,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:03,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992153069] [2021-11-04 03:28:03,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992153069] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:03,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:03,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 03:28:03,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639298082] [2021-11-04 03:28:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:03,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:28:03,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:03,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:28:03,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:28:03,464 INFO L87 Difference]: Start difference. First operand 5244 states and 7389 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-04 03:28:05,489 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:08,362 INFO L93 Difference]: Finished difference Result 13471 states and 19090 transitions. [2021-11-04 03:28:08,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:28:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 89 [2021-11-04 03:28:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:08,382 INFO L225 Difference]: With dead ends: 13471 [2021-11-04 03:28:08,382 INFO L226 Difference]: Without dead ends: 8261 [2021-11-04 03:28:08,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.74ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:28:08,393 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 566 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4188.07ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.41ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4650.96ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:08,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [566 Valid, 32 Invalid, 1958 Unknown, 0 Unchecked, 4.41ms Time], IncrementalHoareTripleChecker [2 Valid, 1955 Invalid, 1 Unknown, 0 Unchecked, 4650.96ms Time] [2021-11-04 03:28:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2021-11-04 03:28:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 8228. [2021-11-04 03:28:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8228 states, 8129 states have (on average 1.4134579899126585) internal successors, (11490), 8139 states have internal predecessors, (11490), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 11698 transitions. [2021-11-04 03:28:08,640 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 11698 transitions. Word has length 89 [2021-11-04 03:28:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:08,640 INFO L470 AbstractCegarLoop]: Abstraction has 8228 states and 11698 transitions. [2021-11-04 03:28:08,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-04 03:28:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 11698 transitions. [2021-11-04 03:28:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-04 03:28:08,647 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:08,647 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:28:08,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-04 03:28:08,648 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash 137381215, now seen corresponding path program 1 times [2021-11-04 03:28:08,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:08,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040574830] [2021-11-04 03:28:08,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:08,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-04 03:28:08,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:08,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040574830] [2021-11-04 03:28:08,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040574830] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:08,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:08,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 03:28:08,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490688220] [2021-11-04 03:28:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:08,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:28:08,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:28:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:28:08,739 INFO L87 Difference]: Start difference. First operand 8228 states and 11698 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-04 03:28:10,761 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:16,056 INFO L93 Difference]: Finished difference Result 20503 states and 29180 transitions. [2021-11-04 03:28:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-04 03:28:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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 109 [2021-11-04 03:28:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:16,086 INFO L225 Difference]: With dead ends: 20503 [2021-11-04 03:28:16,087 INFO L226 Difference]: Without dead ends: 12309 [2021-11-04 03:28:16,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 03:28:16,103 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1765 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 4418 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6282.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.71ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4418 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6945.83ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:16,103 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1765 Valid, 38 Invalid, 4425 Unknown, 0 Unchecked, 13.71ms Time], IncrementalHoareTripleChecker [6 Valid, 4418 Invalid, 1 Unknown, 0 Unchecked, 6945.83ms Time] [2021-11-04 03:28:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12309 states. [2021-11-04 03:28:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12309 to 8236. [2021-11-04 03:28:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8236 states, 8137 states have (on average 1.4123141206832985) internal successors, (11492), 8147 states have internal predecessors, (11492), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 11700 transitions. [2021-11-04 03:28:16,409 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 11700 transitions. Word has length 109 [2021-11-04 03:28:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:16,409 INFO L470 AbstractCegarLoop]: Abstraction has 8236 states and 11700 transitions. [2021-11-04 03:28:16,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-04 03:28:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 11700 transitions. [2021-11-04 03:28:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-04 03:28:16,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:16,421 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:28:16,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-04 03:28:16,421 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1841223644, now seen corresponding path program 1 times [2021-11-04 03:28:16,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:16,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918018025] [2021-11-04 03:28:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:16,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:16,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:16,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918018025] [2021-11-04 03:28:16,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918018025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:16,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:16,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-04 03:28:16,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052876856] [2021-11-04 03:28:16,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:16,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:28:16,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:16,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:28:16,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:28:16,504 INFO L87 Difference]: Start difference. First operand 8236 states and 11700 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:18,521 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:20,698 INFO L93 Difference]: Finished difference Result 16446 states and 23376 transitions. [2021-11-04 03:28:20,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:28:20,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 110 [2021-11-04 03:28:20,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:20,724 INFO L225 Difference]: With dead ends: 16446 [2021-11-04 03:28:20,724 INFO L226 Difference]: Without dead ends: 8244 [2021-11-04 03:28:20,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.58ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:28:20,736 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3482.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3959.36ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:20,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 1944 Unknown, 0 Unchecked, 3.56ms Time], IncrementalHoareTripleChecker [0 Valid, 1943 Invalid, 1 Unknown, 0 Unchecked, 3959.36ms Time] [2021-11-04 03:28:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8244 states. [2021-11-04 03:28:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8244 to 8244. [2021-11-04 03:28:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8244 states, 8145 states have (on average 1.4119091467157765) internal successors, (11500), 8155 states have internal predecessors, (11500), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8244 states to 8244 states and 11708 transitions. [2021-11-04 03:28:20,998 INFO L78 Accepts]: Start accepts. Automaton has 8244 states and 11708 transitions. Word has length 110 [2021-11-04 03:28:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:20,999 INFO L470 AbstractCegarLoop]: Abstraction has 8244 states and 11708 transitions. [2021-11-04 03:28:20,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 8244 states and 11708 transitions. [2021-11-04 03:28:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-04 03:28:21,008 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:21,008 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:28:21,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-04 03:28:21,008 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -187362466, now seen corresponding path program 1 times [2021-11-04 03:28:21,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:21,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63234823] [2021-11-04 03:28:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:21,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:21,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:21,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63234823] [2021-11-04 03:28:21,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63234823] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-04 03:28:21,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820779023] [2021-11-04 03:28:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:21,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-04 03:28:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 03:28:21,137 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-04 03:28:21,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-04 03:28:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:21,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1715 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 03:28:21,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:28:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:21,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-04 03:28:21,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820779023] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:21,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-04 03:28:21,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2021-11-04 03:28:21,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330641101] [2021-11-04 03:28:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:21,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 03:28:21,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:21,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 03:28:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-04 03:28:21,799 INFO L87 Difference]: Start difference. First operand 8244 states and 11708 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:23,819 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:30,655 INFO L93 Difference]: Finished difference Result 31582 states and 44888 transitions. [2021-11-04 03:28:30,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 03:28:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 110 [2021-11-04 03:28:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:30,704 INFO L225 Difference]: With dead ends: 31582 [2021-11-04 03:28:30,705 INFO L226 Difference]: Without dead ends: 23372 [2021-11-04 03:28:30,718 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 48.12ms TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-11-04 03:28:30,719 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 2434 mSDsluCounter, 4092 mSDsCounter, 0 mSdLazyCounter, 6572 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7188.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2434 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.67ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6572 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8053.86ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:30,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2434 Valid, 112 Invalid, 6589 Unknown, 0 Unchecked, 26.67ms Time], IncrementalHoareTripleChecker [16 Valid, 6572 Invalid, 1 Unknown, 0 Unchecked, 8053.86ms Time] [2021-11-04 03:28:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23372 states. [2021-11-04 03:28:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23372 to 8360. [2021-11-04 03:28:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8360 states, 8261 states have (on average 1.4080619779687689) internal successors, (11632), 8271 states have internal predecessors, (11632), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8360 states to 8360 states and 11840 transitions. [2021-11-04 03:28:31,090 INFO L78 Accepts]: Start accepts. Automaton has 8360 states and 11840 transitions. Word has length 110 [2021-11-04 03:28:31,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:31,090 INFO L470 AbstractCegarLoop]: Abstraction has 8360 states and 11840 transitions. [2021-11-04 03:28:31,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8360 states and 11840 transitions. [2021-11-04 03:28:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-04 03:28:31,097 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:31,097 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:28:31,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-04 03:28:31,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-04 03:28:31,322 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:31,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:31,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1775710368, now seen corresponding path program 1 times [2021-11-04 03:28:31,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:31,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573056181] [2021-11-04 03:28:31,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:31,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:31,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:31,496 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573056181] [2021-11-04 03:28:31,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573056181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:31,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:31,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 03:28:31,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633611039] [2021-11-04 03:28:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:31,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 03:28:31,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 03:28:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 03:28:31,499 INFO L87 Difference]: Start difference. First operand 8360 states and 11840 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:33,516 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:44,137 INFO L93 Difference]: Finished difference Result 46364 states and 65975 transitions. [2021-11-04 03:28:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 03:28:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 110 [2021-11-04 03:28:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:44,218 INFO L225 Difference]: With dead ends: 46364 [2021-11-04 03:28:44,218 INFO L226 Difference]: Without dead ends: 38038 [2021-11-04 03:28:44,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 39.82ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-04 03:28:44,241 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 4758 mSDsluCounter, 6059 mSDsCounter, 0 mSdLazyCounter, 7922 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9796.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.23ms SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 7922 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11112.64ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:44,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4761 Valid, 108 Invalid, 7960 Unknown, 0 Unchecked, 26.23ms Time], IncrementalHoareTripleChecker [37 Valid, 7922 Invalid, 1 Unknown, 0 Unchecked, 11112.64ms Time] [2021-11-04 03:28:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38038 states. [2021-11-04 03:28:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38038 to 8384. [2021-11-04 03:28:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8384 states, 8285 states have (on average 1.4068799034399517) internal successors, (11656), 8295 states have internal predecessors, (11656), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 11864 transitions. [2021-11-04 03:28:44,965 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 11864 transitions. Word has length 110 [2021-11-04 03:28:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:44,966 INFO L470 AbstractCegarLoop]: Abstraction has 8384 states and 11864 transitions. [2021-11-04 03:28:44,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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-04 03:28:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 11864 transitions. [2021-11-04 03:28:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-04 03:28:44,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:44,975 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:28:44,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-04 03:28:44,975 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:44,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:44,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1024160708, now seen corresponding path program 1 times [2021-11-04 03:28:44,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:44,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66506811] [2021-11-04 03:28:44,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:44,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:45,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:45,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66506811] [2021-11-04 03:28:45,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66506811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:45,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:45,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-04 03:28:45,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164554322] [2021-11-04 03:28:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:45,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:28:45,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:28:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:28:45,107 INFO L87 Difference]: Start difference. First operand 8384 states and 11864 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-04 03:28:47,126 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:28:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:28:52,220 INFO L93 Difference]: Finished difference Result 23640 states and 33534 transitions. [2021-11-04 03:28:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:28:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 112 [2021-11-04 03:28:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:28:52,247 INFO L225 Difference]: With dead ends: 23640 [2021-11-04 03:28:52,248 INFO L226 Difference]: Without dead ends: 15274 [2021-11-04 03:28:52,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.98ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-04 03:28:52,264 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 717 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 3949 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5634.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.06ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3949 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6323.78ms IncrementalHoareTripleChecker+Time [2021-11-04 03:28:52,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 60 Invalid, 3962 Unknown, 0 Unchecked, 11.06ms Time], IncrementalHoareTripleChecker [12 Valid, 3949 Invalid, 1 Unknown, 0 Unchecked, 6323.78ms Time] [2021-11-04 03:28:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2021-11-04 03:28:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 8384. [2021-11-04 03:28:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8384 states, 8285 states have (on average 1.4059143029571515) internal successors, (11648), 8295 states have internal predecessors, (11648), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:28:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 11856 transitions. [2021-11-04 03:28:52,721 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 11856 transitions. Word has length 112 [2021-11-04 03:28:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:28:52,721 INFO L470 AbstractCegarLoop]: Abstraction has 8384 states and 11856 transitions. [2021-11-04 03:28:52,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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-04 03:28:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 11856 transitions. [2021-11-04 03:28:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-04 03:28:52,728 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:28:52,728 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:28:52,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-04 03:28:52,729 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:28:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:28:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1868684184, now seen corresponding path program 1 times [2021-11-04 03:28:52,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:28:52,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510549579] [2021-11-04 03:28:52,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:28:52,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:28:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:28:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-04 03:28:52,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-04 03:28:52,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510549579] [2021-11-04 03:28:52,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510549579] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-04 03:28:52,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:28:52,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-04 03:28:52,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326623632] [2021-11-04 03:28:52,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-04 03:28:52,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-04 03:28:52,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-04 03:28:52,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-04 03:28:52,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-04 03:28:52,887 INFO L87 Difference]: Start difference. First operand 8384 states and 11856 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-04 03:28:54,905 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:29:07,249 INFO L93 Difference]: Finished difference Result 49788 states and 71010 transitions. [2021-11-04 03:29:07,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-04 03:29:07,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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 114 [2021-11-04 03:29:07,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:29:07,335 INFO L225 Difference]: With dead ends: 49788 [2021-11-04 03:29:07,336 INFO L226 Difference]: Without dead ends: 41438 [2021-11-04 03:29:07,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.69ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:29:07,355 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 2903 mSDsluCounter, 6466 mSDsCounter, 0 mSdLazyCounter, 9430 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10799.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.09ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 9430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12188.42ms IncrementalHoareTripleChecker+Time [2021-11-04 03:29:07,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2908 Valid, 113 Invalid, 9459 Unknown, 0 Unchecked, 23.09ms Time], IncrementalHoareTripleChecker [28 Valid, 9430 Invalid, 1 Unknown, 0 Unchecked, 12188.42ms Time] [2021-11-04 03:29:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41438 states. [2021-11-04 03:29:08,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41438 to 8408. [2021-11-04 03:29:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8408 states, 8309 states have (on average 1.4047418461908774) internal successors, (11672), 8319 states have internal predecessors, (11672), 64 states have call successors, (64), 32 states have call predecessors, (64), 32 states have return successors, (144), 64 states have call predecessors, (144), 64 states have call successors, (144) [2021-11-04 03:29:08,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8408 states to 8408 states and 11880 transitions. [2021-11-04 03:29:08,022 INFO L78 Accepts]: Start accepts. Automaton has 8408 states and 11880 transitions. Word has length 114 [2021-11-04 03:29:08,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:29:08,023 INFO L470 AbstractCegarLoop]: Abstraction has 8408 states and 11880 transitions. [2021-11-04 03:29:08,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 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-04 03:29:08,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8408 states and 11880 transitions. [2021-11-04 03:29:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-04 03:29:08,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:29:08,029 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2021-11-04 03:29:08,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-04 03:29:08,029 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:29:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:29:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1854355564, now seen corresponding path program 1 times [2021-11-04 03:29:08,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-04 03:29:08,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050631331] [2021-11-04 03:29:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:29:08,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-04 03:29:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 03:29:10,308 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-04 03:29:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-04 03:29:11,212 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-04 03:29:11,212 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-04 03:29:11,213 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2021-11-04 03:29:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2021-11-04 03:29:11,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2021-11-04 03:29:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2021-11-04 03:29:11,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2021-11-04 03:29:11,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-04 03:29:11,218 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:29:11,220 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-04 03:29:11,269 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,270 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,271 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,272 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,274 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,275 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,276 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,277 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,278 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,279 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,280 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,281 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,282 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,283 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,284 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,288 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,289 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,290 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,291 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,292 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,293 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,294 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,295 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,296 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,297 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,297 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,297 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,297 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,298 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,299 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,300 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,301 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,302 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,303 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,304 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,305 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,306 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,306 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,306 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,306 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,307 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,307 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,307 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,307 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,308 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,309 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,310 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,310 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,310 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,310 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,311 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,312 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,313 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,314 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,315 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,315 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,315 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,315 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,315 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,316 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,316 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,316 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,316 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,316 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,317 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,317 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,317 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,317 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,318 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,319 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,320 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,321 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,321 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,321 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,321 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,321 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,322 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,322 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,322 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,322 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,323 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,323 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,323 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,329 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,330 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,331 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,332 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,333 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,334 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,335 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,352 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,353 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,354 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,354 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,354 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,354 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,355 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,355 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,355 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,355 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,356 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,357 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,358 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,359 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,359 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,359 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,360 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,361 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,362 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,362 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,362 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,362 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,363 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,364 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,365 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,365 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,365 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,365 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,366 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,366 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,366 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,366 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,367 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,367 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,367 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,367 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,368 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,368 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,368 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,368 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,368 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,369 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,369 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,369 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,369 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,370 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,370 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,370 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,370 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,371 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,372 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,373 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,373 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,373 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,373 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,374 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,374 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,374 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,374 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,375 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,376 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,376 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,377 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,377 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,377 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,377 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,378 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,378 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,378 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,378 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,379 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,379 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,379 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,379 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,381 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,381 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,381 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,381 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled [2021-11-04 03:29:11,382 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled [2021-11-04 03:29:11,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.11 03:29:11 BoogieIcfgContainer [2021-11-04 03:29:11,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-04 03:29:11,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-04 03:29:11,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-04 03:29:11,615 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-04 03:29:11,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 03:27:17" (3/4) ... [2021-11-04 03:29:11,618 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-04 03:29:11,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-04 03:29:11,619 INFO L158 Benchmark]: Toolchain (without parser) took 117976.31ms. Allocated memory was 98.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 71.9MB in the beginning and 875.5MB in the end (delta: -803.6MB). Peak memory consumption was 554.7MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,619 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 03:29:11,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1280.69ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 71.5MB in the beginning and 60.6MB in the end (delta: 10.9MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 197.49ms. Allocated memory is still 125.8MB. Free memory was 60.6MB in the beginning and 65.8MB in the end (delta: -5.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,620 INFO L158 Benchmark]: Boogie Preprocessor took 128.70ms. Allocated memory is still 125.8MB. Free memory was 65.8MB in the beginning and 46.0MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,621 INFO L158 Benchmark]: RCFGBuilder took 2396.18ms. Allocated memory was 125.8MB in the beginning and 310.4MB in the end (delta: 184.5MB). Free memory was 46.0MB in the beginning and 126.4MB in the end (delta: -80.4MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,621 INFO L158 Benchmark]: TraceAbstraction took 113964.12ms. Allocated memory was 310.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 126.4MB in the beginning and 875.5MB in the end (delta: -749.1MB). Peak memory consumption was 927.2MB. Max. memory is 16.1GB. [2021-11-04 03:29:11,621 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 1.5GB. Free memory is still 875.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-04 03:29:11,623 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.21ms. Allocated memory is still 81.8MB. Free memory is still 55.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1280.69ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 71.5MB in the beginning and 60.6MB in the end (delta: 10.9MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 197.49ms. Allocated memory is still 125.8MB. Free memory was 60.6MB in the beginning and 65.8MB in the end (delta: -5.2MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.70ms. Allocated memory is still 125.8MB. Free memory was 65.8MB in the beginning and 46.0MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * RCFGBuilder took 2396.18ms. Allocated memory was 125.8MB in the beginning and 310.4MB in the end (delta: 184.5MB). Free memory was 46.0MB in the beginning and 126.4MB in the end (delta: -80.4MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. * TraceAbstraction took 113964.12ms. Allocated memory was 310.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 126.4MB in the beginning and 875.5MB in the end (delta: -749.1MB). Peak memory consumption was 927.2MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 1.5GB. Free memory is still 875.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 5675]: 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 6535, overapproximation of bitwiseAnd at line 6494. Possible FailurePath: [L5698] int LDV_IN_INTERRUPT = 1; [L5699] struct usb_interface *gigaset_usb_driver_group1 ; [L5700] int ldv_state_variable_2 ; [L5701] int ref_cnt ; [L5702] int ldv_state_variable_1 ; [L5703] int usb_counter ; [L5704] struct cardstate *ops_group1 ; [L5705] int ldv_state_variable_0 ; [L5706] struct bc_state *ops_group0 ; [L5774] static int startmode = 1; [L5775] static int cidmode = 1; [L5776-L5778] static struct usb_device_id const gigaset_table[2U] = { {3U, 1665U, 9U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L5779] struct usb_device_id const __mod_usb_device_table ; [L5785] static struct gigaset_driver *driver ; [L5786-L5792] static struct usb_driver gigaset_usb_driver = {"usb_gigaset", & gigaset_probe, & gigaset_disconnect, 0, & gigaset_suspend, & gigaset_resume, & gigaset_resume, & gigaset_pre_reset, & gigaset_resume, (struct usb_device_id const *)(& gigaset_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, 1U, (unsigned char)0}; [L6716-L6720] static struct gigaset_ops const ops = {& gigaset_write_cmd, & gigaset_write_room, & gigaset_chars_in_buffer, & gigaset_brkchars, & gigaset_init_bchannel, & gigaset_close_bchannel, & gigaset_initbcshw, & gigaset_freebcshw, & gigaset_reinitbcshw, & gigaset_initcshw, & gigaset_freecshw, & gigaset_set_modem_ctrl, & gigaset_baud_rate, & gigaset_set_line_ctrl, & gigaset_m10x_send_skb, & gigaset_m10x_input}; [L6770] int ldv_retval_2 ; [L6772] int ldv_retval_0 ; [L6773] int ldv_retval_4 ; [L6775] int ldv_retval_1 ; [L6777] int ldv_retval_3 ; [L7358] int INTERF_STATE = 0; [L7359] int SERIAL_STATE = 0; [L7360] void *usb_intfdata = 0; [L7361] struct urb *usb_urb = 0; [L7362] struct usb_device *usb_dev = 0; [L7363] int dev_counter = 0; [L7364] int completeFnIntCounter = 0; [L7365] int completeFnBulkCounter = 0; [L7366] void (*completeFnInt)(struct urb * ) ; [L7367] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6801] struct inbuf_t *ldvarg7 ; [L6802] void *tmp ; [L6803] struct sk_buff *ldvarg3 ; [L6804] void *tmp___0 ; [L6805] unsigned int ldvarg0 ; [L6806] unsigned int tmp___1 ; [L6807] unsigned int ldvarg5 ; [L6808] unsigned int tmp___2 ; [L6809] struct cmdbuf_t *ldvarg6 ; [L6810] void *tmp___3 ; [L6811] unsigned int ldvarg1 ; [L6812] unsigned int tmp___4 ; [L6813] unsigned int ldvarg4 ; [L6814] unsigned int tmp___5 ; [L6815] unsigned char *ldvarg2 ; [L6816] void *tmp___6 ; [L6817] pm_message_t ldvarg8 ; [L6818] struct usb_device_id *ldvarg9 ; [L6819] void *tmp___7 ; [L6820] int tmp___8 ; [L6821] int tmp___9 ; [L6822] int tmp___10 ; [L6823] int tmp___11 ; [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6825] tmp = ldv_zalloc(8216UL) [L6826] ldvarg7 = (struct inbuf_t *)tmp [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6827] tmp___0 = ldv_zalloc(240UL) [L6828] ldvarg3 = (struct sk_buff *)tmp___0 [L6829] tmp___1 = __VERIFIER_nondet_uint() [L6830] ldvarg0 = tmp___1 [L6831] tmp___2 = __VERIFIER_nondet_uint() [L6832] ldvarg5 = tmp___2 [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6833] tmp___3 = ldv_zalloc(32UL) [L6834] ldvarg6 = (struct cmdbuf_t *)tmp___3 [L6835] tmp___4 = __VERIFIER_nondet_uint() [L6836] ldvarg1 = tmp___4 [L6837] tmp___5 = __VERIFIER_nondet_uint() [L6838] ldvarg4 = tmp___5 [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6839] tmp___6 = ldv_zalloc(1UL) [L6840] ldvarg2 = (unsigned char *)tmp___6 [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6841] tmp___7 = ldv_zalloc(32UL) [L6842] ldvarg9 = (struct usb_device_id *)tmp___7 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6845] ldv_state_variable_1 = 0 [L6846] ref_cnt = 0 [L6847] ldv_state_variable_0 = 1 [L6848] ldv_state_variable_2 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6850] tmp___8 = __VERIFIER_nondet_int() [L6852] case 0: [L7066] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7067] COND TRUE ldv_state_variable_0 != 0 [L7068] tmp___10 = __VERIFIER_nondet_int() [L7070] case 0: [L7078] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7079] COND TRUE ldv_state_variable_0 == 1 [L6723] int result ; [L6725] CALL, EXPR gigaset_initdriver(8U, 1U, "usb_gigaset", "ttyGU", & ops, & __this_module) [L5623] void *p ; [L5624] void *tmp ; [L5625] int tmp___0 ; [L5627] tmp___0 = __VERIFIER_nondet_int() [L5628] COND FALSE !(tmp___0 != 0) [L5631] tmp = malloc(size) [L5632] p = tmp [L5619] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5634] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7652] return ldv_malloc(sizeof(struct gigaset_driver)); [L6725] driver = gigaset_initdriver(8U, 1U, "usb_gigaset", "ttyGU", & ops, & __this_module) [L6726] COND FALSE !((unsigned long )driver == (unsigned long )((struct gigaset_driver *)0)) [L6731] CALL, EXPR ldv_usb_register_driver_25(& gigaset_usb_driver, & __this_module, "usb_gigaset") [L7330] ldv_func_ret_type ldv_func_res ; [L7331] int tmp ; [L7714] return __VERIFIER_nondet_int(); [L7333] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L7334] ldv_func_res = tmp [L7335] ldv_state_variable_2 = 1 [L7336] usb_counter = 0 [L6780] void *tmp ; [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6782] tmp = ldv_zalloc(1520UL) [L6783] gigaset_usb_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7338] return (ldv_func_res); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6731] result = ldv_usb_register_driver_25(& gigaset_usb_driver, & __this_module, "usb_gigaset") [L6732] COND FALSE !(result < 0) [L6738] return (0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7080] ldv_retval_0 = usb_gigaset_init() [L7081] COND TRUE ldv_retval_0 == 0 [L7082] ldv_state_variable_0 = 3 [L7083] ldv_state_variable_1 = 1 [L6789] void *tmp ; [L6790] void *tmp___0 ; [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6792] tmp = ldv_zalloc(480UL) [L6793] ops_group0 = (struct bc_state *)tmp [L5640] void *p ; [L5641] void *tmp ; [L5642] int tmp___0 ; [L5644] tmp___0 = __VERIFIER_nondet_int() [L5645] COND TRUE tmp___0 != 0 [L5646] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6794] tmp___0 = ldv_zalloc(5256UL) [L6795] ops_group1 = (struct cardstate *)tmp___0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7087] COND FALSE !(ldv_retval_0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6850] tmp___8 = __VERIFIER_nondet_int() [L6852] case 0: [L7066] case 1: [L7102] case 2: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7103] COND TRUE ldv_state_variable_2 != 0 [L7104] tmp___11 = __VERIFIER_nondet_int() [L7106] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7107] COND TRUE ldv_state_variable_2 == 1 [L6472] int retval ; [L6473] struct usb_device *udev ; [L6474] struct usb_device *tmp ; [L6475] struct usb_host_interface *hostif ; [L6476] struct cardstate *cs ; [L6477] struct usb_cardstate *ucs ; [L6478] struct usb_endpoint_descriptor *endpoint ; [L6479] int buffer_size ; [L6480] long tmp___0 ; [L6481] long tmp___1 ; [L6482] long tmp___2 ; [L6483] void *tmp___3 ; [L6484] void *tmp___4 ; [L6485] unsigned int tmp___5 ; [L6486] struct urb *tmp___6 ; [L6487] unsigned char *tmp___7 ; [L7180] struct usb_device *tmp ; [L7471] void *result ; [L7472] void *tmp ; [L5623] void *p ; [L5624] void *tmp ; [L5625] int tmp___0 ; [L5627] tmp___0 = __VERIFIER_nondet_int() [L5628] COND FALSE !(tmp___0 != 0) [L5631] tmp = malloc(size) [L5632] p = tmp [L5619] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5634] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7474] tmp = ldv_malloc(sizeof(struct usb_device)) [L7475] result = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7476] COND TRUE (unsigned long )result != (unsigned long )((void *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7480] return (result); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7182] tmp = ldv_interface_to_usbdev() [L7183] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6489] tmp = interface_to_usbdev(interface) [L6490] udev = tmp [L6491] EXPR interface->cur_altsetting [L6491] hostif = interface->cur_altsetting [L6492] cs = (struct cardstate *)0 [L6493] ucs = (struct usb_cardstate *)0 [L5688] return (exp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6494-L6495] tmp___0 = ldv__builtin_expect(((unsigned int )gigaset_debuglevel & 4194303U) != 0U, 0L) [L6496] COND TRUE tmp___0 != 0L [L6500] EXPR udev->descriptor.idVendor [L6500] (unsigned int )udev->descriptor.idVendor != 1665U || (unsigned int )udev->descriptor.idProduct != 9U [L6500] EXPR udev->descriptor.idProduct [L6500] (unsigned int )udev->descriptor.idVendor != 1665U || (unsigned int )udev->descriptor.idProduct != 9U VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6500] COND FALSE !((unsigned int )udev->descriptor.idVendor != 1665U || (unsigned int )udev->descriptor.idProduct != 9U) [L6511] EXPR hostif->desc.bInterfaceNumber VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6511] COND FALSE !((unsigned int )hostif->desc.bInterfaceNumber != 0U) [L6521] EXPR hostif->desc.bAlternateSetting VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6521] COND FALSE !((unsigned int )hostif->desc.bAlternateSetting != 0U) [L6527] EXPR hostif->desc.bInterfaceClass VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6527] COND FALSE !((unsigned int )hostif->desc.bInterfaceClass != 255U) [L6535] CALL, EXPR gigaset_initcs(driver, 1, 1, 0, cidmode, "usb_gigaset") [L5623] void *p ; [L5624] void *tmp ; [L5625] int tmp___0 ; [L5627] tmp___0 = __VERIFIER_nondet_int() [L5628] COND FALSE !(tmp___0 != 0) [L5631] tmp = malloc(size) [L5632] p = tmp [L5619] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5634] return (p); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7649] return ldv_malloc(sizeof(struct cardstate)); [L6535] cs = gigaset_initcs(driver, 1, 1, 0, cidmode, "usb_gigaset") [L6536] COND FALSE !((unsigned long )cs == (unsigned long )((struct cardstate *)0)) [L6540] EXPR cs->hw.usb [L6540] ucs = cs->hw.usb [L7222] struct usb_device *tmp ; [L7485] int tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7487] COND TRUE (unsigned long )usb_dev == (unsigned long )((struct usb_device *)0) [L5657] int tmp ; [L5659] tmp = __VERIFIER_nondet_int() [L5660] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7488] tmp = ldv_undef_int() [L7489] COND TRUE \read(tmp) [L7490] dev_counter = dev_counter + 1 [L7491] usb_dev = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7499] return (usb_dev); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7224] tmp = ldv_get_dev(ldv_func_arg1) [L7225] return (tmp); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6542] ucs->udev = udev [L6543] ucs->interface = interface [L6544] cs->dev = & interface->dev [L7377] usb_intfdata = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L6546] EXPR hostif->endpoint [L6546] endpoint = & (hostif->endpoint)->desc [L6547] EXPR endpoint->wMaxPacketSize [L6547] buffer_size = (int )endpoint->wMaxPacketSize [L6548] ucs->bulk_out_size = buffer_size [L6549] EXPR endpoint->bEndpointAddress [L6549] ucs->bulk_out_endpointAddr = endpoint->bEndpointAddress [L5606] void *tmp___2 ; [L5623] void *p ; [L5624] void *tmp ; [L5625] int tmp___0 ; [L5627] tmp___0 = __VERIFIER_nondet_int() [L5628] COND TRUE tmp___0 != 0 [L5629] return ((void *)0); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L5601] return ldv_malloc(size); [L5608] tmp___2 = __kmalloc(size, flags) [L5609] return (tmp___2); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L6550] tmp___3 = kmalloc((size_t )buffer_size, 208U) [L6551] ucs->bulk_out_buffer = (unsigned char *)tmp___3 [L6552] EXPR ucs->bulk_out_buffer VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L6552] COND TRUE (unsigned long )ucs->bulk_out_buffer == (unsigned long )((unsigned char *)0U) [L6553] cs->dev [L6554] retval = -12 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L6607] ucs->read_urb [L6608] ucs->bulk_out_buffer [L6609] ucs->bulk_out_urb [L7410] COND FALSE !((unsigned long )usb_urb == (unsigned long )urb && (unsigned long )usb_urb != (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L6610] ucs->rcvbuf [L6611] ucs->read_urb [L7410] COND FALSE !((unsigned long )usb_urb == (unsigned long )urb && (unsigned long )usb_urb != (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={-18446744073709551615:0}, usb_urb={0:0}] [L7377] usb_intfdata = data VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6613] tmp___6 = (struct urb *)0 [L6614] ucs->bulk_out_urb = tmp___6 [L6615] ucs->read_urb = tmp___6 [L6616] tmp___7 = (unsigned char *)0U [L6617] ucs->bulk_out_buffer = tmp___7 [L6618] ucs->rcvbuf = tmp___7 [L6619] ucs->udev [L7505] COND FALSE !((unsigned long )usb_dev == (unsigned long )data && (unsigned long )data != (unsigned long )((struct usb_device *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6620] ucs->udev = (struct usb_device *)0 [L6621] ucs->interface = (struct usb_interface *)0 [L6623] return (retval); VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7108] ldv_retval_4 = gigaset_probe(gigaset_usb_driver_group1, (struct usb_device_id const *)ldvarg9) [L7109] COND FALSE !(ldv_retval_4 == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6850] tmp___8 = __VERIFIER_nondet_int() [L6852] case 0: [L7066] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7067] COND TRUE ldv_state_variable_0 != 0 [L7068] tmp___10 = __VERIFIER_nondet_int() [L7070] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7071] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6750] int i ; [L6753] i = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6759] EXPR driver->minors VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6759] COND FALSE !((unsigned int )i < driver->minors) [L7345] ldv_state_variable_2 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={-36893488147419103231:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L6765] driver = (struct gigaset_driver *)0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7073] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7577] COND TRUE (unsigned long )usb_urb == (unsigned long )((struct urb *)0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L7581] COND FALSE !((unsigned long )usb_dev == (unsigned long )((struct usb_device *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] [L5675] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4194346:4194307}, cidmode=1, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=1, driver={0:0}, gigaset_table={135:0}, gigaset_usb_driver={60:0}, gigaset_usb_driver_group1={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=-12, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ops={25:0}, ops_group0={0:0}, ops_group1={0:0}, ref_cnt=0, SERIAL_STATE=0, startmode=1, usb_counter=0, usb_dev={-55340232221128654847:0}, usb_intfdata={0:0}, usb_urb={0:0}] - UnprovableResult [Line: 5675]: 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: 5675]: 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: 5675]: 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: 5675]: 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 5 procedures, 727 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 113514.89ms, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 93.22ms, AutomataDifference: 102123.93ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 29.38ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 19782 SdHoareTripleChecker+Valid, 93943.37ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19771 mSDsluCounter, 851 SdHoareTripleChecker+Invalid, 84227.63ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30859 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53584 IncrementalHoareTripleChecker+Invalid, 53744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 389 mSDtfsCounter, 53584 mSolverCounterSat, 167.08ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 245.37ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8408occurred in iteration=16, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 3954.18ms AutomataMinimizationTime, 16 MinimizatonAttempts, 90026 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 263.55ms SsaConstructionTime, 3272.67ms SatisfiabilityAnalysisTime, 1696.31ms InterpolantComputationTime, 1338 NumberOfCodeBlocks, 1338 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1237 ConstructedInterpolants, 0 QuantifiedInterpolants, 2841 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2731 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 213/224 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-04 03:29:11,899 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-04 03:29:11,921 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-c36dfa3 [2021-11-04 03:29:13,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-04 03:29:13,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-04 03:29:13,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-04 03:29:13,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-04 03:29:13,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-04 03:29:13,525 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-04 03:29:13,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-04 03:29:13,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-04 03:29:13,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-04 03:29:13,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-04 03:29:13,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-04 03:29:13,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-04 03:29:13,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-04 03:29:13,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-04 03:29:13,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-04 03:29:13,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-04 03:29:13,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-04 03:29:13,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-04 03:29:13,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-04 03:29:13,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-04 03:29:13,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-04 03:29:13,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-04 03:29:13,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-04 03:29:13,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-04 03:29:13,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-04 03:29:13,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-04 03:29:13,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-04 03:29:13,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-04 03:29:13,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-04 03:29:13,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-04 03:29:13,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-04 03:29:13,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-04 03:29:13,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-04 03:29:13,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-04 03:29:13,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-04 03:29:13,570 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-04 03:29:13,570 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-04 03:29:13,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-04 03:29:13,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-04 03:29:13,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-04 03:29:13,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-04 03:29:13,605 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-04 03:29:13,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-04 03:29:13,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-04 03:29:13,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-04 03:29:13,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-04 03:29:13,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-04 03:29:13,608 INFO L138 SettingsManager]: * Use SBE=true [2021-11-04 03:29:13,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-04 03:29:13,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-04 03:29:13,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-04 03:29:13,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-04 03:29:13,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-04 03:29:13,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-04 03:29:13,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-04 03:29:13,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-04 03:29:13,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 03:29:13,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-04 03:29:13,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-04 03:29:13,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-04 03:29:13,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-04 03:29:13,613 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 -> 99f9870c0a11847528222b5446256dd4069d375e1dee3e428847b909838b4c1b [2021-11-04 03:29:13,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-04 03:29:13,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-04 03:29:13,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-04 03:29:13,933 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-04 03:29:13,934 INFO L275 PluginConnector]: CDTParser initialized [2021-11-04 03:29:13,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:29:13,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c532d716/8645bbcf1f384bb989378819395d76a6/FLAG7074ae20d [2021-11-04 03:29:14,568 INFO L306 CDTParser]: Found 1 translation units. [2021-11-04 03:29:14,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:29:14,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c532d716/8645bbcf1f384bb989378819395d76a6/FLAG7074ae20d [2021-11-04 03:29:14,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c532d716/8645bbcf1f384bb989378819395d76a6 [2021-11-04 03:29:14,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-04 03:29:14,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-04 03:29:14,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-04 03:29:14,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-04 03:29:14,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-04 03:29:14,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 03:29:14" (1/1) ... [2021-11-04 03:29:14,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@491d8c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:14, skipping insertion in model container [2021-11-04 03:29:14,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 03:29:14" (1/1) ... [2021-11-04 03:29:14,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-04 03:29:14,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-04 03:29:15,556 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2021-11-04 03:29:15,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 03:29:15,981 INFO L203 MainTranslator]: Completed pre-run [2021-11-04 03:29:16,086 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i[164521,164534] [2021-11-04 03:29:16,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-04 03:29:16,331 INFO L208 MainTranslator]: Completed translation [2021-11-04 03:29:16,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16 WrapperNode [2021-11-04 03:29:16,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-04 03:29:16,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-04 03:29:16,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-04 03:29:16,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-04 03:29:16,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-04 03:29:16,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-04 03:29:16,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-04 03:29:16,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-04 03:29:16,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-04 03:29:16,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-04 03:29:16,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-04 03:29:16,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-04 03:29:16,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (1/1) ... [2021-11-04 03:29:16,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-04 03:29:16,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-04 03:29:16,745 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-04 03:29:16,791 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-04 03:29:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-04 03:29:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2021-11-04 03:29:16,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2021-11-04 03:29:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-04 03:29:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-04 03:29:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-11-04 03:29:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-04 03:29:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2021-11-04 03:29:16,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2021-11-04 03:29:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-04 03:29:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-04 03:29:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-04 03:29:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-04 03:29:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-04 03:29:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 03:29:16,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-04 03:29:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-04 03:29:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-04 03:29:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure gigaset_read_int_callback [2021-11-04 03:29:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure gigaset_read_int_callback [2021-11-04 03:29:19,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-04 03:29:19,612 INFO L299 CfgBuilder]: Removed 741 assume(true) statements. [2021-11-04 03:29:19,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 03:29:19 BoogieIcfgContainer [2021-11-04 03:29:19,615 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-04 03:29:19,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-04 03:29:19,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-04 03:29:19,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-04 03:29:19,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 03:29:14" (1/3) ... [2021-11-04 03:29:19,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7520596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 03:29:19, skipping insertion in model container [2021-11-04 03:29:19,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 03:29:16" (2/3) ... [2021-11-04 03:29:19,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7520596b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 03:29:19, skipping insertion in model container [2021-11-04 03:29:19,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 03:29:19" (3/3) ... [2021-11-04 03:29:19,622 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--isdn--gigaset--usb_gigaset.ko-entry_point.cil.out.i [2021-11-04 03:29:19,626 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-04 03:29:19,627 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-04 03:29:19,666 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-04 03:29:19,671 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-04 03:29:19,672 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-04 03:29:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 727 states, 709 states have (on average 1.4400564174894217) internal successors, (1021), 715 states have internal predecessors, (1021), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-04 03:29:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-04 03:29:19,704 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:29:19,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:29:19,705 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:29:19,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:29:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash -415135425, now seen corresponding path program 1 times [2021-11-04 03:29:19,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:29:19,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049205396] [2021-11-04 03:29:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:29:19,719 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:29:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:29:19,721 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-04 03:29:19,748 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-04 03:29:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:29:20,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:29:20,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:29:20,532 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-04 03:29:20,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:29:20,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-04 03:29:20,597 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:29:20,597 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049205396] [2021-11-04 03:29:20,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049205396] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:29:20,597 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:29:20,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 03:29:20,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737432214] [2021-11-04 03:29:20,600 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:29:20,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:29:20,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:29:20,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:29:20,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:29:20,629 INFO L87 Difference]: Start difference. First operand has 727 states, 709 states have (on average 1.4400564174894217) internal successors, (1021), 715 states have internal predecessors, (1021), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-04 03:29:22,720 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:26,818 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:31,182 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:33,646 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:29:38,068 INFO L93 Difference]: Finished difference Result 1451 states and 2071 transitions. [2021-11-04 03:29:38,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:29:38,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 30 [2021-11-04 03:29:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:29:38,081 INFO L225 Difference]: With dead ends: 1451 [2021-11-04 03:29:38,082 INFO L226 Difference]: Without dead ends: 719 [2021-11-04 03:29:38,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.95ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:29:38,089 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 2010 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16199.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 28.49ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17215.74ms IncrementalHoareTripleChecker+Time [2021-11-04 03:29:38,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 2960 Unknown, 0 Unchecked, 28.49ms Time], IncrementalHoareTripleChecker [1 Valid, 2956 Invalid, 3 Unknown, 0 Unchecked, 17215.74ms Time] [2021-11-04 03:29:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-11-04 03:29:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-11-04 03:29:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 702 states have (on average 1.3974358974358974) internal successors, (981), 707 states have internal predecessors, (981), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-04 03:29:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 997 transitions. [2021-11-04 03:29:38,155 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 997 transitions. Word has length 30 [2021-11-04 03:29:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:29:38,156 INFO L470 AbstractCegarLoop]: Abstraction has 719 states and 997 transitions. [2021-11-04 03:29:38,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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-04 03:29:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 997 transitions. [2021-11-04 03:29:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-04 03:29:38,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:29:38,160 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:29:38,178 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-04 03:29:38,376 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-04 03:29:38,377 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:29:38,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:29:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1864811937, now seen corresponding path program 1 times [2021-11-04 03:29:38,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:29:38,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018130853] [2021-11-04 03:29:38,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:29:38,379 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:29:38,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:29:38,381 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-04 03:29:38,383 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-04 03:29:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:29:38,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-04 03:29:38,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:29:39,102 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-04 03:29:39,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:29:39,391 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-04 03:29:39,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:29:39,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018130853] [2021-11-04 03:29:39,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018130853] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 03:29:39,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-04 03:29:39,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-04 03:29:39,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010101287] [2021-11-04 03:29:39,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-04 03:29:39,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 03:29:39,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:29:39,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 03:29:39,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:29:39,397 INFO L87 Difference]: Start difference. First operand 719 states and 997 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:29:41,473 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:47,343 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:29:52,526 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:02,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:30:02,800 INFO L93 Difference]: Finished difference Result 1409 states and 1961 transitions. [2021-11-04 03:30:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-04 03:30:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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 32 [2021-11-04 03:30:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:30:02,805 INFO L225 Difference]: With dead ends: 1409 [2021-11-04 03:30:02,805 INFO L226 Difference]: Without dead ends: 721 [2021-11-04 03:30:02,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 213.66ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:30:02,808 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 3908 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21307.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 37.86ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3908 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23166.47ms IncrementalHoareTripleChecker+Time [2021-11-04 03:30:02,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3914 Unknown, 0 Unchecked, 37.86ms Time], IncrementalHoareTripleChecker [3 Valid, 3908 Invalid, 3 Unknown, 0 Unchecked, 23166.47ms Time] [2021-11-04 03:30:02,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-11-04 03:30:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2021-11-04 03:30:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 704 states have (on average 1.3963068181818181) internal successors, (983), 709 states have internal predecessors, (983), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-04 03:30:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 999 transitions. [2021-11-04 03:30:02,828 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 999 transitions. Word has length 32 [2021-11-04 03:30:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:30:02,828 INFO L470 AbstractCegarLoop]: Abstraction has 721 states and 999 transitions. [2021-11-04 03:30:02,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:30:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 999 transitions. [2021-11-04 03:30:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-04 03:30:02,830 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:30:02,830 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 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-04 03:30:02,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-04 03:30:03,049 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-04 03:30:03,050 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:30:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:30:03,051 INFO L85 PathProgramCache]: Analyzing trace with hash 860431231, now seen corresponding path program 2 times [2021-11-04 03:30:03,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:30:03,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318333569] [2021-11-04 03:30:03,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-04 03:30:03,052 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:30:03,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:30:03,053 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-04 03:30:03,055 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-04 03:30:03,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-04 03:30:03,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-04 03:30:03,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:30:03,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:30:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:30:03,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:30:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:30:03,760 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:30:03,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318333569] [2021-11-04 03:30:03,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318333569] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:30:03,761 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:30:03,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-04 03:30:03,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120139635] [2021-11-04 03:30:03,761 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:30:03,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:30:03,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:30:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:30:03,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:30:03,762 INFO L87 Difference]: Start difference. First operand 721 states and 999 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:30:05,843 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:09,049 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:11,887 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:30:28,595 INFO L93 Difference]: Finished difference Result 2671 states and 3748 transitions. [2021-11-04 03:30:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:30:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 34 [2021-11-04 03:30:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:30:28,603 INFO L225 Difference]: With dead ends: 2671 [2021-11-04 03:30:28,604 INFO L226 Difference]: Without dead ends: 1984 [2021-11-04 03:30:28,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.17ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:30:28,607 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1807 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 3751 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22595.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.53ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3751 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24381.00ms IncrementalHoareTripleChecker+Time [2021-11-04 03:30:28,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1807 Valid, 64 Invalid, 3761 Unknown, 0 Unchecked, 47.53ms Time], IncrementalHoareTripleChecker [7 Valid, 3751 Invalid, 3 Unknown, 0 Unchecked, 24381.00ms Time] [2021-11-04 03:30:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2021-11-04 03:30:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1984. [2021-11-04 03:30:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1943 states have (on average 1.408646423057128) internal successors, (2737), 1950 states have internal predecessors, (2737), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-04 03:30:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2785 transitions. [2021-11-04 03:30:28,684 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2785 transitions. Word has length 34 [2021-11-04 03:30:28,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:30:28,685 INFO L470 AbstractCegarLoop]: Abstraction has 1984 states and 2785 transitions. [2021-11-04 03:30:28,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:30:28,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2785 transitions. [2021-11-04 03:30:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-04 03:30:28,688 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:30:28,689 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:30:28,709 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-04 03:30:28,909 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-04 03:30:28,910 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:30:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:30:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash -276044390, now seen corresponding path program 1 times [2021-11-04 03:30:28,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:30:28,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25952760] [2021-11-04 03:30:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:30:28,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:30:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:30:28,915 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-04 03:30:28,916 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-04 03:30:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:30:29,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-04 03:30:29,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:30:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:30:29,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:30:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:30:29,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:30:29,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25952760] [2021-11-04 03:30:29,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25952760] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:30:29,869 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:30:29,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-04 03:30:29,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323515468] [2021-11-04 03:30:29,869 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:30:29,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 03:30:29,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:30:29,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 03:30:29,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:30:29,870 INFO L87 Difference]: Start difference. First operand 1984 states and 2785 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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-04 03:30:31,954 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:38,424 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:30:44,214 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:31:35,002 INFO L93 Difference]: Finished difference Result 12092 states and 17124 transitions. [2021-11-04 03:31:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 03:31:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 37 [2021-11-04 03:31:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:31:35,037 INFO L225 Difference]: With dead ends: 12092 [2021-11-04 03:31:35,037 INFO L226 Difference]: Without dead ends: 10142 [2021-11-04 03:31:35,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 275.91ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-04 03:31:35,048 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 8505 mSDsluCounter, 9164 mSDsCounter, 0 mSdLazyCounter, 11226 mSolverCounterSat, 82 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58473.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 8508 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 11311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 112.33ms SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 11226 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64090.88ms IncrementalHoareTripleChecker+Time [2021-11-04 03:31:35,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8508 Valid, 155 Invalid, 11311 Unknown, 0 Unchecked, 112.33ms Time], IncrementalHoareTripleChecker [82 Valid, 11226 Invalid, 3 Unknown, 0 Unchecked, 64090.88ms Time] [2021-11-04 03:31:35,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10142 states. [2021-11-04 03:31:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10142 to 1988. [2021-11-04 03:31:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1947 states have (on average 1.4078068823831535) internal successors, (2741), 1954 states have internal predecessors, (2741), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-11-04 03:31:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2789 transitions. [2021-11-04 03:31:35,168 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2789 transitions. Word has length 37 [2021-11-04 03:31:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:31:35,169 INFO L470 AbstractCegarLoop]: Abstraction has 1988 states and 2789 transitions. [2021-11-04 03:31:35,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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-04 03:31:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2789 transitions. [2021-11-04 03:31:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-04 03:31:35,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:31:35,170 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:31:35,193 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-04 03:31:35,383 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-04 03:31:35,384 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:31:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:31:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1908500643, now seen corresponding path program 1 times [2021-11-04 03:31:35,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:31:35,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108123003] [2021-11-04 03:31:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:31:35,386 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:31:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:31:35,389 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-04 03:31:35,391 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-04 03:31:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:31:35,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:31:35,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:31:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:31:36,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:31:36,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:31:36,498 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:31:36,498 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108123003] [2021-11-04 03:31:36,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108123003] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:31:36,498 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:31:36,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-04 03:31:36,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810203140] [2021-11-04 03:31:36,499 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:31:36,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:31:36,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:31:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:31:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:31:36,499 INFO L87 Difference]: Start difference. First operand 1988 states and 2789 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-04 03:31:38,579 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:41,366 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:44,014 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:31:50,488 INFO L93 Difference]: Finished difference Result 5892 states and 8356 transitions. [2021-11-04 03:31:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:31:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 37 [2021-11-04 03:31:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:31:50,501 INFO L225 Difference]: With dead ends: 5892 [2021-11-04 03:31:50,501 INFO L226 Difference]: Without dead ends: 3938 [2021-11-04 03:31:50,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.18ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:31:50,505 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1897 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 49 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12909.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.90ms SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13799.54ms IncrementalHoareTripleChecker+Time [2021-11-04 03:31:50,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1897 Valid, 48 Invalid, 1974 Unknown, 0 Unchecked, 8.90ms Time], IncrementalHoareTripleChecker [49 Valid, 1922 Invalid, 3 Unknown, 0 Unchecked, 13799.54ms Time] [2021-11-04 03:31:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2021-11-04 03:31:50,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3926. [2021-11-04 03:31:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3849 states have (on average 1.4037412314886983) internal successors, (5403), 3859 states have internal predecessors, (5403), 48 states have call successors, (48), 24 states have call predecessors, (48), 24 states have return successors, (72), 48 states have call predecessors, (72), 48 states have call successors, (72) [2021-11-04 03:31:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5523 transitions. [2021-11-04 03:31:50,611 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5523 transitions. Word has length 37 [2021-11-04 03:31:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:31:50,613 INFO L470 AbstractCegarLoop]: Abstraction has 3926 states and 5523 transitions. [2021-11-04 03:31:50,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-04 03:31:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5523 transitions. [2021-11-04 03:31:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-04 03:31:50,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:31:50,617 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:31:50,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-04 03:31:50,833 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-04 03:31:50,834 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:31:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:31:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 966022899, now seen corresponding path program 1 times [2021-11-04 03:31:50,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:31:50,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160572382] [2021-11-04 03:31:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:31:50,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:31:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:31:50,836 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-04 03:31:50,838 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-04 03:31:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:31:51,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:31:51,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:31:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:31:51,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:31:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:31:51,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:31:51,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160572382] [2021-11-04 03:31:51,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160572382] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:31:51,868 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:31:51,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-04 03:31:51,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430059223] [2021-11-04 03:31:51,868 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:31:51,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:31:51,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:31:51,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:31:51,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:31:51,869 INFO L87 Difference]: Start difference. First operand 3926 states and 5523 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-04 03:31:53,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:56,949 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:31:59,975 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:32:18,174 INFO L93 Difference]: Finished difference Result 15513 states and 22108 transitions. [2021-11-04 03:32:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:32:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 38 [2021-11-04 03:32:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:32:18,222 INFO L225 Difference]: With dead ends: 15513 [2021-11-04 03:32:18,222 INFO L226 Difference]: Without dead ends: 11621 [2021-11-04 03:32:18,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.68ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:32:18,234 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 1866 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 3796 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24022.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1866 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.37ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3796 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25831.46ms IncrementalHoareTripleChecker+Time [2021-11-04 03:32:18,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1866 Valid, 72 Invalid, 3815 Unknown, 0 Unchecked, 15.37ms Time], IncrementalHoareTripleChecker [16 Valid, 3796 Invalid, 3 Unknown, 0 Unchecked, 25831.46ms Time] [2021-11-04 03:32:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11621 states. [2021-11-04 03:32:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11621 to 11587. [2021-11-04 03:32:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11587 states, 11366 states have (on average 1.3972373746260778) internal successors, (15881), 11388 states have internal predecessors, (15881), 144 states have call successors, (144), 72 states have call predecessors, (144), 72 states have return successors, (288), 144 states have call predecessors, (288), 144 states have call successors, (288) [2021-11-04 03:32:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11587 states to 11587 states and 16313 transitions. [2021-11-04 03:32:18,605 INFO L78 Accepts]: Start accepts. Automaton has 11587 states and 16313 transitions. Word has length 38 [2021-11-04 03:32:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:32:18,605 INFO L470 AbstractCegarLoop]: Abstraction has 11587 states and 16313 transitions. [2021-11-04 03:32:18,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-04 03:32:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 11587 states and 16313 transitions. [2021-11-04 03:32:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-04 03:32:18,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:32:18,607 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:32:18,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-04 03:32:18,827 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-04 03:32:18,828 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:32:18,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:32:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -118060505, now seen corresponding path program 1 times [2021-11-04 03:32:18,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:32:18,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053780210] [2021-11-04 03:32:18,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:32:18,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:32:18,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:32:18,830 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-04 03:32:18,830 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-04 03:32:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:32:19,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:32:19,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:32:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:19,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:32:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:19,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:32:19,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053780210] [2021-11-04 03:32:19,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053780210] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:32:19,560 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:32:19,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:32:19,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048463323] [2021-11-04 03:32:19,560 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:32:19,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:32:19,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:32:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:32:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:32:19,561 INFO L87 Difference]: Start difference. First operand 11587 states and 16313 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:32:21,634 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:24,488 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:27,109 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:32:32,926 INFO L93 Difference]: Finished difference Result 11613 states and 16341 transitions. [2021-11-04 03:32:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:32:32,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 39 [2021-11-04 03:32:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:32:32,952 INFO L225 Difference]: With dead ends: 11613 [2021-11-04 03:32:32,952 INFO L226 Difference]: Without dead ends: 11611 [2021-11-04 03:32:32,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.03ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:32:32,958 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 945 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12295.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.44ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13050.53ms IncrementalHoareTripleChecker+Time [2021-11-04 03:32:32,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 48 Invalid, 1946 Unknown, 0 Unchecked, 5.44ms Time], IncrementalHoareTripleChecker [5 Valid, 1938 Invalid, 3 Unknown, 0 Unchecked, 13050.53ms Time] [2021-11-04 03:32:32,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11611 states. [2021-11-04 03:32:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11611 to 11609. [2021-11-04 03:32:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11609 states, 11388 states have (on average 1.3967334035827186) internal successors, (15906), 11410 states have internal predecessors, (15906), 144 states have call successors, (144), 72 states have call predecessors, (144), 72 states have return successors, (288), 144 states have call predecessors, (288), 144 states have call successors, (288) [2021-11-04 03:32:33,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11609 states to 11609 states and 16338 transitions. [2021-11-04 03:32:33,351 INFO L78 Accepts]: Start accepts. Automaton has 11609 states and 16338 transitions. Word has length 39 [2021-11-04 03:32:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:32:33,351 INFO L470 AbstractCegarLoop]: Abstraction has 11609 states and 16338 transitions. [2021-11-04 03:32:33,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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-04 03:32:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 11609 states and 16338 transitions. [2021-11-04 03:32:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-04 03:32:33,354 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:32:33,354 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:32:33,375 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-04 03:32:33,583 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-04 03:32:33,584 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:32:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:32:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash 635092349, now seen corresponding path program 1 times [2021-11-04 03:32:33,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:32:33,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857977412] [2021-11-04 03:32:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:32:33,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:32:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:32:33,586 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-04 03:32:33,587 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-04 03:32:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:32:34,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:32:34,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:32:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:34,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:32:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:34,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:32:34,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857977412] [2021-11-04 03:32:34,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857977412] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:32:34,461 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:32:34,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:32:34,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096895996] [2021-11-04 03:32:34,461 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:32:34,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:32:34,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:32:34,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:32:34,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:32:34,462 INFO L87 Difference]: Start difference. First operand 11609 states and 16338 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-04 03:32:36,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:39,542 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:42,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:32:50,827 INFO L93 Difference]: Finished difference Result 23179 states and 32632 transitions. [2021-11-04 03:32:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:32:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 40 [2021-11-04 03:32:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:32:50,884 INFO L225 Difference]: With dead ends: 23179 [2021-11-04 03:32:50,884 INFO L226 Difference]: Without dead ends: 23177 [2021-11-04 03:32:50,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.33ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:32:50,897 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 954 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1952 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14736.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.43ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1952 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15735.00ms IncrementalHoareTripleChecker+Time [2021-11-04 03:32:50,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 40 Invalid, 1956 Unknown, 0 Unchecked, 8.43ms Time], IncrementalHoareTripleChecker [1 Valid, 1952 Invalid, 3 Unknown, 0 Unchecked, 15735.00ms Time] [2021-11-04 03:32:50,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23177 states. [2021-11-04 03:32:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23177 to 23171. [2021-11-04 03:32:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23171 states, 22734 states have (on average 1.397158441101434) internal successors, (31763), 22774 states have internal predecessors, (31763), 288 states have call successors, (288), 144 states have call predecessors, (288), 144 states have return successors, (576), 288 states have call predecessors, (576), 288 states have call successors, (576) [2021-11-04 03:32:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23171 states to 23171 states and 32627 transitions. [2021-11-04 03:32:51,671 INFO L78 Accepts]: Start accepts. Automaton has 23171 states and 32627 transitions. Word has length 40 [2021-11-04 03:32:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:32:51,672 INFO L470 AbstractCegarLoop]: Abstraction has 23171 states and 32627 transitions. [2021-11-04 03:32:51,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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-04 03:32:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23171 states and 32627 transitions. [2021-11-04 03:32:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-04 03:32:51,673 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:32:51,673 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 03:32:51,693 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-04 03:32:51,885 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-04 03:32:51,885 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:32:51,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:32:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1786972943, now seen corresponding path program 1 times [2021-11-04 03:32:51,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:32:51,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316936664] [2021-11-04 03:32:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:32:51,887 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:32:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:32:51,888 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-04 03:32:51,889 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-04 03:32:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:32:52,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:32:52,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:32:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:52,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:32:52,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:32:52,786 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:32:52,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316936664] [2021-11-04 03:32:52,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316936664] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:32:52,786 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:32:52,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:32:52,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292150771] [2021-11-04 03:32:52,786 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:32:52,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:32:52,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:32:52,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:32:52,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:32:52,787 INFO L87 Difference]: Start difference. First operand 23171 states and 32627 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:32:54,870 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:32:57,837 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:00,947 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:33:08,935 INFO L93 Difference]: Finished difference Result 23180 states and 32632 transitions. [2021-11-04 03:33:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:33:08,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 41 [2021-11-04 03:33:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:33:08,987 INFO L225 Difference]: With dead ends: 23180 [2021-11-04 03:33:08,987 INFO L226 Difference]: Without dead ends: 23164 [2021-11-04 03:33:08,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.28ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:33:09,000 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 951 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14488.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.05ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15446.09ms IncrementalHoareTripleChecker+Time [2021-11-04 03:33:09,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [951 Valid, 40 Invalid, 1958 Unknown, 0 Unchecked, 8.05ms Time], IncrementalHoareTripleChecker [0 Valid, 1955 Invalid, 3 Unknown, 0 Unchecked, 15446.09ms Time] [2021-11-04 03:33:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23164 states. [2021-11-04 03:33:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23164 to 23158. [2021-11-04 03:33:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23158 states, 22721 states have (on average 1.3971216055631355) internal successors, (31744), 22761 states have internal predecessors, (31744), 288 states have call successors, (288), 144 states have call predecessors, (288), 144 states have return successors, (576), 288 states have call predecessors, (576), 288 states have call successors, (576) [2021-11-04 03:33:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23158 states to 23158 states and 32608 transitions. [2021-11-04 03:33:09,727 INFO L78 Accepts]: Start accepts. Automaton has 23158 states and 32608 transitions. Word has length 41 [2021-11-04 03:33:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:33:09,728 INFO L470 AbstractCegarLoop]: Abstraction has 23158 states and 32608 transitions. [2021-11-04 03:33:09,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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-04 03:33:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23158 states and 32608 transitions. [2021-11-04 03:33:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-04 03:33:09,730 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:33:09,731 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-11-04 03:33:09,749 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-04 03:33:09,947 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-04 03:33:09,947 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:33:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:33:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -318595226, now seen corresponding path program 1 times [2021-11-04 03:33:09,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:33:09,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24133591] [2021-11-04 03:33:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:33:09,948 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:33:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:33:09,950 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-04 03:33:09,954 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-04 03:33:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:33:10,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:33:10,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:33:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:33:10,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:33:10,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:33:10,759 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:33:10,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24133591] [2021-11-04 03:33:10,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24133591] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:33:10,759 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:33:10,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-04 03:33:10,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519798179] [2021-11-04 03:33:10,759 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:33:10,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:33:10,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:33:10,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:33:10,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:33:10,760 INFO L87 Difference]: Start difference. First operand 23158 states and 32608 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-04 03:33:12,835 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:16,986 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:20,790 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:26,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:33:26,380 INFO L93 Difference]: Finished difference Result 56852 states and 79575 transitions. [2021-11-04 03:33:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:33:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 54 [2021-11-04 03:33:26,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:33:26,453 INFO L225 Difference]: With dead ends: 56852 [2021-11-04 03:33:26,454 INFO L226 Difference]: Without dead ends: 33728 [2021-11-04 03:33:26,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.98ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:33:26,484 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 441 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13726.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.14ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14553.39ms IncrementalHoareTripleChecker+Time [2021-11-04 03:33:26,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 40 Invalid, 2000 Unknown, 0 Unchecked, 7.14ms Time], IncrementalHoareTripleChecker [1 Valid, 1996 Invalid, 3 Unknown, 0 Unchecked, 14553.39ms Time] [2021-11-04 03:33:26,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33728 states. [2021-11-04 03:33:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33728 to 33598. [2021-11-04 03:33:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33598 states, 32729 states have (on average 1.377921720798069) internal successors, (45098), 32805 states have internal predecessors, (45098), 576 states have call successors, (576), 288 states have call predecessors, (576), 288 states have return successors, (1152), 576 states have call predecessors, (1152), 576 states have call successors, (1152) [2021-11-04 03:33:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 46826 transitions. [2021-11-04 03:33:27,625 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 46826 transitions. Word has length 54 [2021-11-04 03:33:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:33:27,625 INFO L470 AbstractCegarLoop]: Abstraction has 33598 states and 46826 transitions. [2021-11-04 03:33:27,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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-04 03:33:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 46826 transitions. [2021-11-04 03:33:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-04 03:33:27,631 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:33:27,631 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:33:27,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-04 03:33:27,845 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-04 03:33:27,845 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:33:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:33:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1631391149, now seen corresponding path program 1 times [2021-11-04 03:33:27,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:33:27,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037072365] [2021-11-04 03:33:27,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:33:27,847 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:33:27,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:33:27,856 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-04 03:33:27,857 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-04 03:33:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:33:28,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-04 03:33:28,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:33:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 03:33:28,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:33:28,812 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 03:33:28,812 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:33:28,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037072365] [2021-11-04 03:33:28,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037072365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:33:28,812 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:33:28,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2021-11-04 03:33:28,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602151822] [2021-11-04 03:33:28,813 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:33:28,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-04 03:33:28,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:33:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-04 03:33:28,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-04 03:33:28,814 INFO L87 Difference]: Start difference. First operand 33598 states and 46826 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-04 03:33:30,887 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:37,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:42,750 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:44,273 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:46,299 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:48,318 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:50,331 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:33:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:33:57,307 INFO L93 Difference]: Finished difference Result 58207 states and 81071 transitions. [2021-11-04 03:33:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-04 03:33:57,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 74 [2021-11-04 03:33:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:33:57,365 INFO L225 Difference]: With dead ends: 58207 [2021-11-04 03:33:57,365 INFO L226 Difference]: Without dead ends: 24615 [2021-11-04 03:33:57,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 97.65ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-04 03:33:57,407 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 135 mSDsluCounter, 4043 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26344.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 5007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.48ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27451.27ms IncrementalHoareTripleChecker+Time [2021-11-04 03:33:57,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 80 Invalid, 5007 Unknown, 0 Unchecked, 12.48ms Time], IncrementalHoareTripleChecker [5 Valid, 4997 Invalid, 5 Unknown, 0 Unchecked, 27451.27ms Time] [2021-11-04 03:33:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24615 states. [2021-11-04 03:33:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24615 to 24109. [2021-11-04 03:33:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24109 states, 23456 states have (on average 1.375) internal successors, (32252), 23514 states have internal predecessors, (32252), 432 states have call successors, (432), 216 states have call predecessors, (432), 216 states have return successors, (864), 432 states have call predecessors, (864), 432 states have call successors, (864) [2021-11-04 03:33:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24109 states to 24109 states and 33548 transitions. [2021-11-04 03:33:58,165 INFO L78 Accepts]: Start accepts. Automaton has 24109 states and 33548 transitions. Word has length 74 [2021-11-04 03:33:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:33:58,165 INFO L470 AbstractCegarLoop]: Abstraction has 24109 states and 33548 transitions. [2021-11-04 03:33:58,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-04 03:33:58,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24109 states and 33548 transitions. [2021-11-04 03:33:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-04 03:33:58,170 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:33:58,170 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:33:58,190 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-04 03:33:58,387 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-04 03:33:58,387 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:33:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:33:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash -244886215, now seen corresponding path program 1 times [2021-11-04 03:33:58,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:33:58,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266448349] [2021-11-04 03:33:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:33:58,389 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:33:58,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:33:58,390 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-04 03:33:58,391 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-04 03:33:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:33:58,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:33:58,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:33:59,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:33:59,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:33:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:33:59,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:33:59,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266448349] [2021-11-04 03:33:59,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266448349] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:33:59,255 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:33:59,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-04 03:33:59,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915781037] [2021-11-04 03:33:59,255 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:33:59,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:33:59,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:33:59,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:33:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:33:59,256 INFO L87 Difference]: Start difference. First operand 24109 states and 33548 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 03:34:01,329 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:34:05,550 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:34:10,981 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:34:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:34:15,158 INFO L93 Difference]: Finished difference Result 54966 states and 77045 transitions. [2021-11-04 03:34:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:34:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-04 03:34:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:34:15,236 INFO L225 Difference]: With dead ends: 54966 [2021-11-04 03:34:15,236 INFO L226 Difference]: Without dead ends: 32583 [2021-11-04 03:34:15,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.77ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:34:15,274 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 681 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 66 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13880.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.10ms SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14797.86ms IncrementalHoareTripleChecker+Time [2021-11-04 03:34:15,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 48 Invalid, 2177 Unknown, 0 Unchecked, 9.10ms Time], IncrementalHoareTripleChecker [66 Valid, 2108 Invalid, 3 Unknown, 0 Unchecked, 14797.86ms Time] [2021-11-04 03:34:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32583 states. [2021-11-04 03:34:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32583 to 32149. [2021-11-04 03:34:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32149 states, 31208 states have (on average 1.3660279415534478) internal successors, (42631), 31290 states have internal predecessors, (42631), 624 states have call successors, (624), 312 states have call predecessors, (624), 312 states have return successors, (1248), 624 states have call predecessors, (1248), 624 states have call successors, (1248) [2021-11-04 03:34:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32149 states to 32149 states and 44503 transitions. [2021-11-04 03:34:16,352 INFO L78 Accepts]: Start accepts. Automaton has 32149 states and 44503 transitions. Word has length 80 [2021-11-04 03:34:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:34:16,352 INFO L470 AbstractCegarLoop]: Abstraction has 32149 states and 44503 transitions. [2021-11-04 03:34:16,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 03:34:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 32149 states and 44503 transitions. [2021-11-04 03:34:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-04 03:34:16,356 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:34:16,356 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:34:16,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-04 03:34:16,567 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-04 03:34:16,568 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:34:16,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:34:16,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1125268816, now seen corresponding path program 1 times [2021-11-04 03:34:16,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:34:16,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920683998] [2021-11-04 03:34:16,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:34:16,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:34:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:34:16,570 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-04 03:34:16,571 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-04 03:34:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:34:17,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-04 03:34:17,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:34:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 03:34:17,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:34:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-04 03:34:17,609 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:34:17,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920683998] [2021-11-04 03:34:17,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920683998] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:34:17,609 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:34:17,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-11-04 03:34:17,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406119968] [2021-11-04 03:34:17,609 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:34:17,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-04 03:34:17,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:34:17,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-04 03:34:17,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-11-04 03:34:17,610 INFO L87 Difference]: Start difference. First operand 32149 states and 44503 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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-04 03:34:19,695 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:34:36,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:35:07,751 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:36:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:36:39,078 INFO L93 Difference]: Finished difference Result 285496 states and 396959 transitions. [2021-11-04 03:36:39,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-04 03:36:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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 80 [2021-11-04 03:36:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:36:39,765 INFO L225 Difference]: With dead ends: 285496 [2021-11-04 03:36:39,766 INFO L226 Difference]: Without dead ends: 270267 [2021-11-04 03:36:39,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 572.73ms TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-11-04 03:36:39,871 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 12642 mSDsluCounter, 24020 mSDsCounter, 0 mSdLazyCounter, 26228 mSolverCounterSat, 99 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120366.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12650 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 26330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 146.41ms SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 26228 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 131586.02ms IncrementalHoareTripleChecker+Time [2021-11-04 03:36:39,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12650 Valid, 269 Invalid, 26330 Unknown, 0 Unchecked, 146.41ms Time], IncrementalHoareTripleChecker [99 Valid, 26228 Invalid, 3 Unknown, 0 Unchecked, 131586.02ms Time] [2021-11-04 03:36:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270267 states. [2021-11-04 03:36:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270267 to 32341. [2021-11-04 03:36:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32341 states, 31400 states have (on average 1.3637898089171974) internal successors, (42823), 31482 states have internal predecessors, (42823), 624 states have call successors, (624), 312 states have call predecessors, (624), 312 states have return successors, (1248), 624 states have call predecessors, (1248), 624 states have call successors, (1248) [2021-11-04 03:36:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32341 states to 32341 states and 44695 transitions. [2021-11-04 03:36:43,487 INFO L78 Accepts]: Start accepts. Automaton has 32341 states and 44695 transitions. Word has length 80 [2021-11-04 03:36:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:36:43,488 INFO L470 AbstractCegarLoop]: Abstraction has 32341 states and 44695 transitions. [2021-11-04 03:36:43,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 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-04 03:36:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 32341 states and 44695 transitions. [2021-11-04 03:36:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-11-04 03:36:43,492 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:36:43,492 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:36:43,516 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-04 03:36:43,707 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-04 03:36:43,707 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:36:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:36:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1965448692, now seen corresponding path program 1 times [2021-11-04 03:36:43,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:36:43,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308599336] [2021-11-04 03:36:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:36:43,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:36:43,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:36:43,710 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-04 03:36:43,711 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-04 03:36:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:36:44,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:36:44,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:36:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:36:45,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:36:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:36:45,736 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:36:45,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308599336] [2021-11-04 03:36:45,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308599336] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:36:45,736 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:36:45,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-04 03:36:45,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342073112] [2021-11-04 03:36:45,737 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:36:45,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:36:45,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:36:45,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:36:45,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:36:45,738 INFO L87 Difference]: Start difference. First operand 32341 states and 44695 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-04 03:36:47,815 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:36:52,130 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:36:56,919 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:37:07,572 INFO L93 Difference]: Finished difference Result 55338 states and 76675 transitions. [2021-11-04 03:37:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:37:07,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 82 [2021-11-04 03:37:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:37:07,664 INFO L225 Difference]: With dead ends: 55338 [2021-11-04 03:37:07,664 INFO L226 Difference]: Without dead ends: 40013 [2021-11-04 03:37:07,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.87ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:37:07,699 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 928 mSDsluCounter, 1851 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18307.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.27ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19707.72ms IncrementalHoareTripleChecker+Time [2021-11-04 03:37:07,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [928 Valid, 64 Invalid, 2850 Unknown, 0 Unchecked, 12.27ms Time], IncrementalHoareTripleChecker [17 Valid, 2830 Invalid, 3 Unknown, 0 Unchecked, 19707.72ms Time] [2021-11-04 03:37:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40013 states. [2021-11-04 03:37:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40013 to 39938. [2021-11-04 03:37:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39938 states, 38781 states have (on average 1.362703385678554) internal successors, (52847), 38881 states have internal predecessors, (52847), 768 states have call successors, (768), 384 states have call predecessors, (768), 384 states have return successors, (1440), 768 states have call predecessors, (1440), 768 states have call successors, (1440) [2021-11-04 03:37:09,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39938 states to 39938 states and 55055 transitions. [2021-11-04 03:37:09,847 INFO L78 Accepts]: Start accepts. Automaton has 39938 states and 55055 transitions. Word has length 82 [2021-11-04 03:37:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:37:09,848 INFO L470 AbstractCegarLoop]: Abstraction has 39938 states and 55055 transitions. [2021-11-04 03:37:09,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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-04 03:37:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 39938 states and 55055 transitions. [2021-11-04 03:37:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-04 03:37:09,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:37:09,852 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:37:09,870 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-04 03:37:10,059 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-04 03:37:10,060 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:37:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:37:10,060 INFO L85 PathProgramCache]: Analyzing trace with hash 799367996, now seen corresponding path program 1 times [2021-11-04 03:37:10,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:37:10,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937041680] [2021-11-04 03:37:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:37:10,061 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:37:10,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:37:10,062 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-04 03:37:10,063 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-04 03:37:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:37:10,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:37:10,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:37:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:37:11,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:37:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:37:12,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:37:12,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937041680] [2021-11-04 03:37:12,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937041680] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:37:12,094 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:37:12,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-11-04 03:37:12,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676423927] [2021-11-04 03:37:12,095 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:37:12,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-04 03:37:12,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:37:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-04 03:37:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:37:12,096 INFO L87 Difference]: Start difference. First operand 39938 states and 55055 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-04 03:37:14,169 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:18,485 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:23,306 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:29,531 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:37:40,009 INFO L93 Difference]: Finished difference Result 83388 states and 115560 transitions. [2021-11-04 03:37:40,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-04 03:37:40,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 83 [2021-11-04 03:37:40,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:37:40,156 INFO L225 Difference]: With dead ends: 83388 [2021-11-04 03:37:40,156 INFO L226 Difference]: Without dead ends: 60466 [2021-11-04 03:37:40,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.42ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-04 03:37:40,200 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 2676 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22749.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 22.03ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24669.51ms IncrementalHoareTripleChecker+Time [2021-11-04 03:37:40,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2676 Valid, 56 Invalid, 2897 Unknown, 0 Unchecked, 22.03ms Time], IncrementalHoareTripleChecker [42 Valid, 2852 Invalid, 3 Unknown, 0 Unchecked, 24669.51ms Time] [2021-11-04 03:37:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60466 states. [2021-11-04 03:37:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60466 to 46330. [2021-11-04 03:37:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46330 states, 44975 states have (on average 1.364313507504169) internal successors, (61360), 45093 states have internal predecessors, (61360), 894 states have call successors, (894), 456 states have call predecessors, (894), 456 states have return successors, (1608), 894 states have call predecessors, (1608), 894 states have call successors, (1608) [2021-11-04 03:37:42,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46330 states to 46330 states and 63862 transitions. [2021-11-04 03:37:42,797 INFO L78 Accepts]: Start accepts. Automaton has 46330 states and 63862 transitions. Word has length 83 [2021-11-04 03:37:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:37:42,798 INFO L470 AbstractCegarLoop]: Abstraction has 46330 states and 63862 transitions. [2021-11-04 03:37:42,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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-04 03:37:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 46330 states and 63862 transitions. [2021-11-04 03:37:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-04 03:37:42,802 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:37:42,802 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:37:42,820 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-04 03:37:43,015 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-04 03:37:43,015 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:37:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:37:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -989395202, now seen corresponding path program 1 times [2021-11-04 03:37:43,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:37:43,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090049241] [2021-11-04 03:37:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:37:43,017 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:37:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:37:43,018 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-04 03:37:43,019 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-04 03:37:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:37:43,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:37:43,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:37:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:37:44,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:37:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:37:44,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:37:44,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090049241] [2021-11-04 03:37:44,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090049241] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:37:44,510 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:37:44,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:37:44,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959946599] [2021-11-04 03:37:44,510 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:37:44,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:37:44,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:37:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:37:44,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:37:44,511 INFO L87 Difference]: Start difference. First operand 46330 states and 63862 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 03:37:46,593 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:50,933 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:37:55,054 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:38:01,457 INFO L93 Difference]: Finished difference Result 60344 states and 83052 transitions. [2021-11-04 03:38:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:38:01,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 84 [2021-11-04 03:38:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:38:01,574 INFO L225 Difference]: With dead ends: 60344 [2021-11-04 03:38:01,574 INFO L226 Difference]: Without dead ends: 60342 [2021-11-04 03:38:01,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.19ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:01,593 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 907 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13237.54ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.61ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14081.34ms IncrementalHoareTripleChecker+Time [2021-11-04 03:38:01,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [907 Valid, 48 Invalid, 1925 Unknown, 0 Unchecked, 6.61ms Time], IncrementalHoareTripleChecker [5 Valid, 1917 Invalid, 3 Unknown, 0 Unchecked, 14081.34ms Time] [2021-11-04 03:38:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60342 states. [2021-11-04 03:38:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60342 to 60300. [2021-11-04 03:38:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60300 states, 58531 states have (on average 1.364610206557209) internal successors, (79872), 58685 states have internal predecessors, (79872), 1164 states have call successors, (1164), 600 states have call predecessors, (1164), 600 states have return successors, (1968), 1164 states have call predecessors, (1968), 1164 states have call successors, (1968) [2021-11-04 03:38:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60300 states to 60300 states and 83004 transitions. [2021-11-04 03:38:04,674 INFO L78 Accepts]: Start accepts. Automaton has 60300 states and 83004 transitions. Word has length 84 [2021-11-04 03:38:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:38:04,674 INFO L470 AbstractCegarLoop]: Abstraction has 60300 states and 83004 transitions. [2021-11-04 03:38:04,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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-04 03:38:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 60300 states and 83004 transitions. [2021-11-04 03:38:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-04 03:38:04,678 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:38:04,678 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:38:04,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-11-04 03:38:04,891 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-04 03:38:04,892 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:38:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:38:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -606479482, now seen corresponding path program 1 times [2021-11-04 03:38:04,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:38:04,893 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973112118] [2021-11-04 03:38:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:38:04,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:38:04,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:38:04,894 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-04 03:38:04,895 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-04 03:38:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:38:05,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:38:05,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:38:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:38:05,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:38:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:38:06,242 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:38:06,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973112118] [2021-11-04 03:38:06,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973112118] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:38:06,242 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:38:06,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:38:06,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383526516] [2021-11-04 03:38:06,243 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:38:06,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:38:06,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:38:06,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:38:06,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:06,244 INFO L87 Difference]: Start difference. First operand 60300 states and 83004 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 03:38:08,320 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:12,490 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:16,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:38:25,394 INFO L93 Difference]: Finished difference Result 103580 states and 142510 transitions. [2021-11-04 03:38:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:38:25,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-11-04 03:38:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:38:25,780 INFO L225 Difference]: With dead ends: 103580 [2021-11-04 03:38:25,780 INFO L226 Difference]: Without dead ends: 103578 [2021-11-04 03:38:25,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.60ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:25,810 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 916 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13455.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.65ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14320.83ms IncrementalHoareTripleChecker+Time [2021-11-04 03:38:25,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 40 Invalid, 1918 Unknown, 0 Unchecked, 6.65ms Time], IncrementalHoareTripleChecker [1 Valid, 1914 Invalid, 3 Unknown, 0 Unchecked, 14320.83ms Time] [2021-11-04 03:38:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103578 states. [2021-11-04 03:38:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103578 to 103572. [2021-11-04 03:38:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103572 states, 100543 states have (on average 1.3650776284773678) internal successors, (137249), 100805 states have internal predecessors, (137249), 1992 states have call successors, (1992), 1032 states have call predecessors, (1992), 1032 states have return successors, (3264), 1992 states have call predecessors, (3264), 1992 states have call successors, (3264) [2021-11-04 03:38:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103572 states to 103572 states and 142505 transitions. [2021-11-04 03:38:31,247 INFO L78 Accepts]: Start accepts. Automaton has 103572 states and 142505 transitions. Word has length 85 [2021-11-04 03:38:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:38:31,247 INFO L470 AbstractCegarLoop]: Abstraction has 103572 states and 142505 transitions. [2021-11-04 03:38:31,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-04 03:38:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 103572 states and 142505 transitions. [2021-11-04 03:38:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-04 03:38:31,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:38:31,251 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:38:31,268 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-04 03:38:31,467 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-04 03:38:31,467 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:38:31,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:38:31,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1620994040, now seen corresponding path program 1 times [2021-11-04 03:38:31,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:38:31,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093543563] [2021-11-04 03:38:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:38:31,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:38:31,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:38:31,469 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-04 03:38:31,470 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-04 03:38:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:38:32,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:38:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:38:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:38:32,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:38:32,634 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-04 03:38:32,635 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:38:32,635 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093543563] [2021-11-04 03:38:32,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093543563] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:38:32,635 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:38:32,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-04 03:38:32,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258126502] [2021-11-04 03:38:32,635 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:38:32,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:38:32,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:38:32,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:38:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:32,636 INFO L87 Difference]: Start difference. First operand 103572 states and 142505 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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-04 03:38:34,709 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:38,676 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:42,235 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:38:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:38:51,630 INFO L93 Difference]: Finished difference Result 103581 states and 142510 transitions. [2021-11-04 03:38:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:38:51,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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 86 [2021-11-04 03:38:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:38:51,859 INFO L225 Difference]: With dead ends: 103581 [2021-11-04 03:38:51,859 INFO L226 Difference]: Without dead ends: 103556 [2021-11-04 03:38:51,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.65ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:51,895 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 913 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13044.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.66ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13879.29ms IncrementalHoareTripleChecker+Time [2021-11-04 03:38:51,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [913 Valid, 40 Invalid, 1920 Unknown, 0 Unchecked, 6.66ms Time], IncrementalHoareTripleChecker [0 Valid, 1917 Invalid, 3 Unknown, 0 Unchecked, 13879.29ms Time] [2021-11-04 03:38:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103556 states. [2021-11-04 03:38:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103556 to 88260. [2021-11-04 03:38:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88260 states, 85663 states have (on average 1.3644397231009888) internal successors, (116882), 85889 states have internal predecessors, (116882), 1704 states have call successors, (1704), 888 states have call predecessors, (1704), 888 states have return successors, (2688), 1704 states have call predecessors, (2688), 1704 states have call successors, (2688) [2021-11-04 03:38:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88260 states to 88260 states and 121274 transitions. [2021-11-04 03:38:56,826 INFO L78 Accepts]: Start accepts. Automaton has 88260 states and 121274 transitions. Word has length 86 [2021-11-04 03:38:56,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:38:56,826 INFO L470 AbstractCegarLoop]: Abstraction has 88260 states and 121274 transitions. [2021-11-04 03:38:56,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 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-04 03:38:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 88260 states and 121274 transitions. [2021-11-04 03:38:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-04 03:38:56,831 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:38:56,831 INFO L514 BasicCegarLoop]: trace histogram [4, 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] [2021-11-04 03:38:56,851 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-04 03:38:57,048 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-04 03:38:57,049 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:38:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:38:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -31704417, now seen corresponding path program 1 times [2021-11-04 03:38:57,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:38:57,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092681650] [2021-11-04 03:38:57,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:38:57,050 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:38:57,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:38:57,051 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-04 03:38:57,052 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-04 03:38:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:38:57,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-04 03:38:57,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:38:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:38:57,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:38:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-04 03:38:58,056 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:38:58,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092681650] [2021-11-04 03:38:58,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092681650] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-04 03:38:58,057 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-04 03:38:58,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-04 03:38:58,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530952879] [2021-11-04 03:38:58,057 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-04 03:38:58,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-04 03:38:58,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:38:58,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-04 03:38:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:38:58,058 INFO L87 Difference]: Start difference. First operand 88260 states and 121274 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-04 03:39:00,145 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:39:05,093 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:39:11,983 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:39:21,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-04 03:39:21,057 INFO L93 Difference]: Finished difference Result 207718 states and 287561 transitions. [2021-11-04 03:39:21,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-04 03:39:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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 89 [2021-11-04 03:39:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-04 03:39:21,363 INFO L225 Difference]: With dead ends: 207718 [2021-11-04 03:39:21,364 INFO L226 Difference]: Without dead ends: 119492 [2021-11-04 03:39:21,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.73ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-04 03:39:21,466 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 554 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15523.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.77ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16426.80ms IncrementalHoareTripleChecker+Time [2021-11-04 03:39:21,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [554 Valid, 32 Invalid, 2467 Unknown, 0 Unchecked, 7.77ms Time], IncrementalHoareTripleChecker [2 Valid, 2462 Invalid, 3 Unknown, 0 Unchecked, 16426.80ms Time] [2021-11-04 03:39:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119492 states. [2021-11-04 03:39:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119492 to 116349. [2021-11-04 03:39:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116349 states, 113824 states have (on average 1.3834867866179366) internal successors, (157474), 114044 states have internal predecessors, (157474), 1656 states have call successors, (1656), 864 states have call predecessors, (1656), 864 states have return successors, (2592), 1656 states have call predecessors, (2592), 1656 states have call successors, (2592) [2021-11-04 03:39:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116349 states to 116349 states and 161722 transitions. [2021-11-04 03:39:28,226 INFO L78 Accepts]: Start accepts. Automaton has 116349 states and 161722 transitions. Word has length 89 [2021-11-04 03:39:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-04 03:39:28,227 INFO L470 AbstractCegarLoop]: Abstraction has 116349 states and 161722 transitions. [2021-11-04 03:39:28,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-04 03:39:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand 116349 states and 161722 transitions. [2021-11-04 03:39:28,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-04 03:39:28,234 INFO L506 BasicCegarLoop]: Found error trace [2021-11-04 03:39:28,234 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-04 03:39:28,253 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-04 03:39:28,435 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-04 03:39:28,435 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-04 03:39:28,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-04 03:39:28,435 INFO L85 PathProgramCache]: Analyzing trace with hash -176296251, now seen corresponding path program 1 times [2021-11-04 03:39:28,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-04 03:39:28,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771345996] [2021-11-04 03:39:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-04 03:39:28,436 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-04 03:39:28,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-04 03:39:28,438 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-04 03:39:28,438 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-04 03:39:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-04 03:39:29,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-04 03:39:29,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-04 03:39:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-04 03:39:29,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-04 03:39:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-11-04 03:39:29,974 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-04 03:39:29,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771345996] [2021-11-04 03:39:29,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771345996] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-04 03:39:29,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-04 03:39:29,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-04 03:39:29,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643539468] [2021-11-04 03:39:29,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-04 03:39:29,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-04 03:39:29,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-04 03:39:29,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-04 03:39:29,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-04 03:39:29,975 INFO L87 Difference]: Start difference. First operand 116349 states and 161722 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 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-04 03:39:32,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:39:37,342 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-04 03:39:48,276 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []